Garside monoids vs divisibility monoids

DOI10.1017/S0960129504004414zbMath1067.20074arXiv0707.0785MaRDI QIDQ4675767

Matthieu Picantin

Publication date: 6 May 2005

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.0785

zbMATH Keywords

relationsgeneratorsquasi-centersGarside monoidsdivisibility monoidsMazurkiewicz trace monoidsspherical Artin monoids

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36)

Related Items (7)

Describing semigroups with defining relations of the form \(xy=yz\) and \(yx=zy\) and connections with knot theory ⋮ Asymptotic combinatorics of Artin-Tits monoids and of some other monoids ⋮ THE SUBWORD REVERSING METHOD ⋮ Finite transducers for divisibility monoids ⋮ Finitely generated algebras defined by homogeneous quadratic monomial relations and their underlying monoids. ⋮ The representation theorem of persistence revisited and generalized ⋮ Left-Garside categories, self-distributivity, and braids

This page was built for publication: Garside monoids vs divisibility monoids