International audienceWe compute coherent presentations of Artin monoids, that is presentations by generators, relations, and relations between the relations. For that, we use methods of higher-dimensional rewriting that extend Squier's and Knuth-Bendix's completions into a homotopical completion-reduction, applied to Artin's and Garside's presentations. The main result of the paper states that the so-called Tits-Zamolodchikov 3-cells extend Artin's presentation into a coherent presentation. As a byproduct, we give a new constructive proof of a theorem of Deligne on the actions of an Artin monoid on a category
28 pagesInternational audienceThis paper shows how to construct coherent presentations (presentation...
27 pagesThis paper shows how to construct coherent presentations (presentations by generators, relat...
A coherent presentation of an n-category is a presentation by generators, relations and relations am...
International audienceWe compute coherent presentations of Artin monoids, that is presentations by g...
International audienceWe compute coherent presentations of Artin monoids, that is presentations by g...
International audienceWe compute coherent presentations of Artin monoids, that is presentations by g...
Abstract – We compute coherent presentations of Artin monoids, that is presentations by generators, ...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which st...
International audienceWe construct finite coherent presentations of plactic monoids of type A. Such ...
International audienceWe construct finite coherent presentations of plactic monoids of type A. Such ...
28 pagesInternational audienceThis paper shows how to construct coherent presentations (presentation...
27 pagesThis paper shows how to construct coherent presentations (presentations by generators, relat...
A coherent presentation of an n-category is a presentation by generators, relations and relations am...
International audienceWe compute coherent presentations of Artin monoids, that is presentations by g...
International audienceWe compute coherent presentations of Artin monoids, that is presentations by g...
International audienceWe compute coherent presentations of Artin monoids, that is presentations by g...
Abstract – We compute coherent presentations of Artin monoids, that is presentations by generators, ...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
International audienceOne of the most used algorithm in rewriting theory is the Knuth-Bendix complet...
One of the most used algorithm in rewriting theory is the Knuth-Bendix completion procedure which st...
International audienceWe construct finite coherent presentations of plactic monoids of type A. Such ...
International audienceWe construct finite coherent presentations of plactic monoids of type A. Such ...
28 pagesInternational audienceThis paper shows how to construct coherent presentations (presentation...
27 pagesThis paper shows how to construct coherent presentations (presentations by generators, relat...
A coherent presentation of an n-category is a presentation by generators, relations and relations am...