A FAMILY OF PSEUDO-ANOSOV BRAIDS WITH LARGE CONJUGACY INVARIANT SETS

DOI10.1142/S0218216513500259zbMath1304.20054arXiv1203.2320OpenAlexW1966393286MaRDI QIDQ2840286

Byung Hee An, Ki Hyoung Ko

Publication date: 17 July 2013

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

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

zbMATH Keywords

braid groupsconjugacy problemrigid 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)

Related Items (1)

Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography

Cites Work

• 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.
• Conjugacy problem for braid groups and Garside groups.
• Geometry of the complex of curves. II: Hierarchical structure
• Geometry of the complex of curves. I: Hyperbolicity
• The \(n\)th root of a braid is unique up to conjugacy.
• Conjugacy in Garside groups. III: Periodic braids.
• A new approach to the conjugacy problem in Garside groups.
• ALGORITHMS FOR POSITIVE BRAIDS
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
• THE BRAID GROUP AND OTHER GROUPS

This page was built for publication: A FAMILY OF PSEUDO-ANOSOV BRAIDS WITH LARGE CONJUGACY INVARIANT SETS