Translation numbers in a Garside group are rational with uniformly bounded denominators.

DOI10.1016/J.JPAA.2007.04.003MaRDI QIDQ995629zbMATH OpenOpenAlexFDO

Authors Eon-Kyung Lee, Sang-Jin Lee

Publication date 3 September 2007

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

zbMATH Keywords

finitely generated groupsGarside groupsGarside elementssemigroup generatorstranslation numberspower conjugacy problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: It is known that Garside groups are strongly translation discrete. In this paper, we show that the translation numbers in a Garside group are rational with uniformly bounded denominators and can be computed in finite time. As an application, we give solutions to some group-theoretic problems.

Recommendations

• Garside groups are strongly translation discrete.
• Translation numbers in negatively curved groups
• A class of finitely generated groups with irrational translation numbers
• Small cancellation groups and translation numbers
• Transverse properties of parabolic subgroups of Garside groups

Cites work

• scientific article; zbMATH DE number 4031953 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 3623860 (Why is no real title available?)
• scientific article; zbMATH DE number 827093 (Why is no real title available?)
• A new approach to the conjugacy problem in Garside groups.
• A new approach to the word and conjugacy problems in the braid groups
• ALGORITHMS FOR POSITIVE BRAIDS
• Abelian Subgroups of Garside Groups
• An Ordering for Groups of Pure Braids and Fibre-Type Hyperplane Arrangements
• Artin-Gruppen und Coxeter-Gruppen
• Automatic groups and amalgams
• Bestvina's normal form complex and the homology of Garside groups.
• Discreteness properties of translation numbers in solvable groups
• EXTRACTION OF ROOTS IN GARSIDE GROUPS
• Garside groups are strongly translation discrete.
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• Gaussian groups are torsion free
• Geodesic automation and growth functions for Artin groups of finite type
• Groupes de Garside
• Groups with certain solvable and unsolvable decision problems
• Hyperbolic elements in negatively curved groups
• Non-positively curved aspects of Artin groups of finite type
• Rational subgroups of biautomatic groups
• Small cancellation groups and translation numbers
• Some power of an element in a Garside group is conjugate to a periodically geodesic element
• THE BRAID GROUP AND OTHER GROUPS
• THE CONJUGACY PROBLEM IN SMALL GAUSSIAN GROUPS

Cited in

(11)

• Small cancellation groups and translation numbers
• Garside groups are strongly translation discrete.
• Discreteness properties of translation numbers in solvable groups
• A Garside-theoretic approach to the reducibility problem in braid groups.
• Acylindricity of the action of right-angled Artin groups on extension graphs
• On the cycling operation in braid groups.
• Braid groups of imprimitive complex reflection groups.
• Periodic elements in Garside groups.
• An upper bound of the minimal asymptotic translation length of right-angled Artin groups on extension graphs
• Translation numbers in negatively curved groups
• Abelian Subgroups of Garside Groups

This page was built for publication: Translation numbers in a Garside group are rational with uniformly bounded denominators.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995629)