A family of pseudo-Anosov braids with large conjugacy invariant sets.

DOI10.1142/S0218216513500259zbMATH Open1304.20054arXiv1203.2320OpenAlexW1966393286MaRDI QIDQ2840286FDOQ2840286

Authors: Byunghee An, Ki Hyoung Ko 

Publication date: 17 July 2013

Published in: Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

Abstract: We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and conclude that the conjugacy problem remains exponential in the braid index under the current knowledge.

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

Recommendations

• On the genericity of pseudo-Anosov braids. II: Conjugations to rigid braids.
• Fast Nielsen-Thurston classification of braids.
• Small braids with large ultra summit set.
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• The infimum, supremum, and geodesic length of a braid conjugacy class.
• On the genericity of pseudo-Anosov braids. I: Rigid braids.
• A fast algorithm to the conjugacy problem on generic braids.
• A family of pseudo-Anosov braids whose super-summit sets grow exponentially.
• Garside theory and subsurfaces: some examples in braid groups
• A fast solution to the conjugacy problem in the four-strand braid group.

zbMATH Keywords

conjugacy problembraid groupsrigid braidspseudo-Anosov braidscanonical lengthsconjugacy invariant sets

Mathematics Subject Classification ID

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

Cites Work

• Geometry of the complex of curves. I: Hyperbolicity
• Geometry of the complex of curves. II: Hierarchical structure
• Conjugacy problem for braid groups and Garside groups.
• THE BRAID GROUP AND OTHER GROUPS
• ALGORITHMS FOR POSITIVE BRAIDS
• Conjugacy in Garside groups. III: Periodic braids.
• A new approach to the conjugacy problem in Garside groups.
• The cyclic sliding operation in Garside groups.
• The \(n\)th root of a braid is unique up to conjugacy.
• A Garside-theoretic approach to the reducibility problem in braid groups.
• Solving the conjugacy problem in Garside groups by cyclic sliding.
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION

Cited In (13)

• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• Fast algorithmic Nielsen-Thurston classification of four-strand braids.
• A construction of pseudo-Anosov braids with small normalized entropies
• A fast algorithm to the conjugacy problem on generic braids.
• On the genericity of pseudo-Anosov braids. II: Conjugations to rigid braids.
• Conformal invariants of 3-braids and counting functions
• On the genericity of pseudo-Anosov braids. I: Rigid braids.
• Train tracks and zipping sequences for pseudo-Anosov braids
• Small braids with large ultra summit set.
• A family of pseudo-Anosov braids whose super-summit sets grow exponentially.
• An asymptotic behavior of the dilatation for a family of pseudo-Anosov braids
• Agol cycles of pseudo-Anosov 3-braids
• Fast Nielsen-Thurston classification of braids.

This page was built for publication: A family of pseudo-Anosov braids with large conjugacy invariant sets.

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