A FAMILY OF PSEUDO-ANOSOV BRAIDS WHOSE SUPER-SUMMIT SETS GROW EXPONENTIALLY

DOI10.1142/S0218216513500508zbMath1282.20034arXiv1302.5808OpenAlexW2008360405MaRDI QIDQ2850719

Sandrine Caruso

Publication date: 30 September 2013

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

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

zbMATH Keywords

braid groupsconjugacy problemGarside theorypseudo-Anosov braidssuper-summit sets

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)

Cites Work

• Reducible braids and Garside theory.
• Dual Garside structure and reducibility of braids.
• The cyclic sliding operation in Garside groups.
• A new approach to the conjugacy problem in Garside groups.
• ALGORITHMS FOR POSITIVE BRAIDS
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
• The infimum, supremum, and geodesic length of a braid conjugacy class.

This page was built for publication: A FAMILY OF PSEUDO-ANOSOV BRAIDS WHOSE SUPER-SUMMIT SETS GROW EXPONENTIALLY