Garside theory and subsurfaces: some examples in braid groups

DOI10.1515/GCC-2019-2007MaRDI QIDQ2178746zbMATH OpenOpenAlexFDO

Authors Saul Schleimer, Bert Wiest

Publication date 11 May 2020

Published in Groups - Complexity - Cryptology (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.01500, http://wrap.warwick.ac.uk/128733/7/WRAP-Garside-theory-subsurfaces-examples-braid-Schleimer-2019.pdf

zbMATH Keywords

braid groupconjugacy problemGarside theoryrigid braidssubsurface projection

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Braid groups; Artin groups (20F36) Geometric group theory (20F65)

Abstract: Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid braids with a fixed number of strands, the size of this set is bounded by a polynomial in the length of the braids. In this paper we suggest a more precise bound: for rigid braids with $N$ strands and of Garside length $L$, the sliding circuit set should have at most $Ccdot{L}^{N-2}$ elements, for some constant $C$. We construct a family of braids which realise this potential worst case. Our example braids suggest that having a large sliding circuit set is a geometric property of braids, as our examples have multiple subsurfaces with large subsurface projection; thus they are "almost reducible" in multiple ways, and act on the curve graph with small translation distance.

Recommendations

• On reduction curves and Garside properties of braids.
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Reducible braids and Garside theory.
• The cyclic sliding operation in Garside groups.
• A family of pseudo-Anosov braids whose super-summit sets grow exponentially.

Cites work

• A fast solution to the conjugacy problem in the four-strand braid group.
• A new approach to the word and conjugacy problems in the braid groups
• A primer on mapping class groups
• ALGORITHMS FOR POSITIVE BRAIDS
• Artin groups of finite type are biautomatic
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• Curve graphs and Garside groups
• Fast Nielsen-Thurston classification of braids.
• Geometry of the complex of curves. II: Hierarchical structure
• Groupes de Garside
• scientific article; zbMATH DE number 4011434 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Linearly bounded conjugator property for mapping class groups
• Mapping class groups are automatic
• On reduction curves and Garside properties of braids.
• The cyclic sliding operation in Garside groups.

Cited in

(8)

• A family of pseudo-Anosov braids with large conjugacy invariant sets.
• On reduction curves and Garside properties of braids.
• ON WORD REVERSING IN BRAID GROUPS
• Algorithmic recognition of quasipositive braids of algebraic length two.
• Garside groups and geometry: Some thoughts for Patrick Dehornoy
• Curve graphs and Garside groups
• Small braids with large ultra summit set.
• The cyclic sliding operation in Garside groups.

Describes a project that uses

Uses Software

• CBraid
• Curver
• OEIS
• GitHub

This page was built for publication: Garside theory and subsurfaces: some examples in braid groups

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