Groupes de Garside

Details Groupes de Garside Groupes de Garside

2001-11-13

arxiv.org/abs/math/0111157v1

Mathematics

Group Theory

Scientific paper

Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups contains the braid groups, all spherical Artin groups, and various generalizations previously considered (In particular, the Garside groups considered in [1,7] are special cases of those considered here; the latter had been called "small Gaussian" in earlier works; the name has been changed in order to uniformize the terminology with works by Bessis, Charney, Michel, and other authors). Here we prove that Garside groups are biautomatic, and that being a Garside group is a recursively enumerable property, i.e., there exists an algorithm constructing the (infinite) list of all small Gaussian groups. The latter result relies on an effective, tractable method for recognizing those presentations that define a Garside monoid.

Affiliated with

Also associated with

No associations

Rating

Groupes de Garside does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Groupes de Garside, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Groupes de Garside will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632206