Papers
Topics
Authors
Recent
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.

Citations (10)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.