Small braids with large ultra summit set.

DOI10.1134/S0001434611030254MaRDI QIDQ650460zbMATHOpenAlexFDO

Authors M. V. Prasolov

Publication date 25 November 2011

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434611030254

zbMATH Keywords

conjugacy problembraid groupsGarside elementsnormal form theoremsBirman-Ko-Lee presentationrigid pseudo-Anosov braidsultra summit sets

Mathematics Subject Classification ID

Conjugacy classes for groups (20E45) 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)

Recommendations

• A family of pseudo-Anosov braids whose super-summit sets grow exponentially.
• A family of pseudo-Anosov braids with large conjugacy invariant sets.
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• On the genericity of pseudo-Anosov braids. II: Conjugations to rigid braids.
• Garside theory and subsurfaces: some examples in braid groups

Cites work

• A new approach to the conjugacy problem in Garside groups.
• A new approach to the word and conjugacy problems in the braid groups
• ALGORITHMS FOR POSITIVE BRAIDS
• Conjugacy in Garside groups. I: Cyclings, powers and rigidity.
• Conjugacy in Garside groups. III: Periodic braids.
• Conjugacy problem for braid groups and Garside groups.
• On the geometry and dynamics of diffeomorphisms of surfaces
• THE BRAID GROUP AND OTHER GROUPS
• Train-tracks for surface homeomorphisms

Cited in

(4)

• A family of pseudo-Anosov braids with large conjugacy invariant sets.
• Dual Garside structure and reducibility of braids.
• Fast Nielsen-Thurston classification of braids.
• Algorithmic recognition of quasipositive braids of algebraic length two.

This page was built for publication: Small braids with large ultra summit set.

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