This thesis focuses on the study of plactic monoids by a new approach using methods issued from rewriting theory. These methods are applied on presentations of plactic monoids given in terms of Young tableaux, Kashiwara’s crystal bases and Littelmann path model. We study the syzygy problem for the Knuth presentation of the plactic monoids. Using the homotopical completion procedure that extends Squier’s and Knuth–Bendix’s completions procedure, we construct coherent presentations of plactic monoids of type A. Such a coherent presentation extends the notion of a presentation of a monoid by a family of generating syzygies, taking into account all the relations among the relations. We make explicit a finite coherent presentation of plactic mon...
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie al...
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...
This thesis focuses on the study of plactic monoids by a new approach using methods issued from rewr...
This thesis focuses on the study of plactic monoids by a new approach using methods issued from rewr...
Cette thèse est consacrée à l’étude des monoïdes plaxiques par une nouvelle approche utilisant des m...
Plactic monoids are objects that describe the representation theory of finite dimensional complex se...
Plactic monoids are objects that describe the representation theory of finite dimensional complex se...
Plactic monoids are objects that describe the representation theory of finite dimensional complex se...
Les monoïdes plaxiques sont des objets qui décrivent la théorie des représentations des algèbres de ...
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 ...
International audienceWe give an explicit presentation for the plactic monoid for type C using admis...
International audienceWe give an explicit presentation for the plactic monoid for type C using admis...
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie al...
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie al...
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...
This thesis focuses on the study of plactic monoids by a new approach using methods issued from rewr...
This thesis focuses on the study of plactic monoids by a new approach using methods issued from rewr...
Cette thèse est consacrée à l’étude des monoïdes plaxiques par une nouvelle approche utilisant des m...
Plactic monoids are objects that describe the representation theory of finite dimensional complex se...
Plactic monoids are objects that describe the representation theory of finite dimensional complex se...
Plactic monoids are objects that describe the representation theory of finite dimensional complex se...
Les monoïdes plaxiques sont des objets qui décrivent la théorie des représentations des algèbres de ...
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 ...
International audienceWe give an explicit presentation for the plactic monoid for type C using admis...
International audienceWe give an explicit presentation for the plactic monoid for type C using admis...
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie al...
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie al...
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...