Conjugacy in Garside groups. I: Cyclings, powers and rigidity.

DOI10.4171/GGD/12MaRDI QIDQ2472583zbMATH OpenOpenAlexFDO

Authors Joan Birman, Volker Gebhardt, Juan González-Meneses

Publication date 22 February 2008

Published in Groups, Geometry, and Dynamics (Search for Journal in Brave)

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

zbMATH Keywords

braid groupsconjugacy decision problemconjugacy search problemGarside groupsiterated cyclingsiterated powersnormal form theoremsrigiditystable ultra summit sets

Mathematics Subject Classification ID

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

Abstract: In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal form changes only in the obvious way under cycling and decycling. It is also shown that, given X in a Garside group, if some power X^m is conjugate to a rigid element, then m can be bounded above by ||Delta||^3. In the particular case of braid groups, this implies that a pseudo-Anosov braid has a small power whose ultra summit set consists of rigid elements. This solves one of the problems in the way of a polynomial solution to the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in braid groups. In addition to proving the rigidity theorem, it will be shown how this paper fits into the authors' program for finding a polynomial algorithm to the CDP/CSP, and what remains to be done.

Review text

Summary: In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where `rigid' means that the left normal form changes only in the obvious way under cycling and decycling. It is also shown that, given \(X\) in a Garside group, if some power \(X^m\) is conjugate to a rigid element, then \(m\) can be bounded above by \(\|\Delta\|^3\). In the particular case of braid groups \(\{B_n;\;n\in\mathbb{N}\}\), this implies that a pseudo-Anosov braid has a small power whose ultra summit set consists of rigid elements. This solves one of the problems in the way of a polynomial solution to the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in braid groups. In addition to proving the rigidity theorem, it will be shown how this paper fits into the authors' program for finding a polynomial algorithm to the CDP/CSP, and what remains to be done.

Recommendations

• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• The cyclic sliding operation in Garside groups.
• Solving the conjugacy problem in Garside groups by cyclic sliding.
• A new approach to the conjugacy problem in Garside groups.
• Conjugacy in Garside groups. III: Periodic braids.

Cites work

• A new approach to the word and conjugacy problems in the braid groups
• An algebraic method for public-key cryptography
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
• Fragments of the word \(\Delta\) in a braid group
• scientific article; zbMATH DE number 475334 (Why is no real title available?)
• Springer theory in braid groups and the Birman-Ko-Lee monoid.
• The dual braid monoid
• Train-tracks for surface homeomorphisms

Cited in

(36)

• On the cycling operation in braid groups.
• Towards generating secure keys for braid cryptography
• Left-Garside categories, self-distributivity, and braids
• On the centralizer of generic braids
• Garside theory and subsurfaces: some examples in braid groups
• On parabolic subgroups of Artin-Tits groups of spherical type
• Noncrossing partitions for periodic braids
• On the genericity of loxodromic actions
• Fast Nielsen-Thurston classification of braids.
• Conjugacy in Garside groups. III: Periodic braids.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• A new approach to the conjugacy problem in Garside groups.
• A family of pseudo-Anosov braids with large conjugacy invariant sets.
• A fast algorithm to the conjugacy problem on generic braids.
• Some power of an element in a Garside group is conjugate to a periodically geodesic element
• Affine braid groups: a better platform than braid groups for cryptology?
• EXTRACTION OF ROOTS IN GARSIDE GROUPS
• The defect of Bennequin-Eliashberg inequality and Bennequin surfaces
• On dilatation factors of braids on three strands.
• A Garside-theoretic analysis of the Burau representations
• Curve graphs and Garside groups
• Basic results on braid groups.
• Presentations of Dehn quandles
• Generalization of the Dehornoy-Lafont order complex to categories: application to exceptional braid groups
• Recognizing trace graphs of closed braids
• Periodic elements in Garside groups.
• Small braids with large ultra summit set.
• Reducible braids and Garside theory.
• Uniqueness of roots up to conjugacy in circular and hosohedral-type Garside groups
• Morse elements in Garside groups are strongly contracting
• Membership problems in braid groups and Artin groups
• Springer categories for regular centralizers in well-generated complex braid groups
• Satellite fully positive braid links are braided satellites of fully positive braid links
• A Garside-theoretic approach to the reducibility problem in braid groups.
• The cyclic sliding operation in Garside groups.
• Solving the conjugacy problem in Garside groups by cyclic sliding.

This page was built for publication: Conjugacy in Garside groups. I: Cyclings, powers and rigidity.

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