2000 character limit reached
Garside monoids vs divisibility monoids
Published 5 Jul 2007 in math.GR and cs.DM | (0707.0785v1)
Abstract: Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of common multiples) is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations (resp. be of Coxeter type). Here, we show that the quasi-center of these monoids can be studied and described similarly, and then we exhibit the intersection between the two classes of monoids.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.