On the genericity of pseudo-Anosov braids. II: Conjugations to rigid braids.
From MaRDI portal
Publication:2013894
DOI10.4171/GGD/407zbMATH Open1423.20029arXiv1309.6137MaRDI QIDQ2013894FDOQ2013894
Authors: Sandrine Caruso, Bert Wiest
Publication date: 10 August 2017
Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)
Abstract: We prove that generic elements of braid groups are pseudo-Anosov, in the following sense: in the Cayley graph of the braid group with n 3 strands, with respect to Garside's generating set, we prove that the proportion of pseudo-Anosov braids in the ball of radius l tends to 1 exponentially quickly as l tends to infinity. Moreover, with a similar notion of genericity, we prove that for generic pairs of elements of the braid group, the conjugacy search problem can be solved in quadratic time. The idea behind both results is that generic braids can be conjugated "easily" into a rigid braid.
Full work available at URL: https://arxiv.org/abs/1309.6137
Recommendations
- On the genericity of pseudo-Anosov braids. I: Rigid braids.
- A family of pseudo-Anosov braids with large conjugacy invariant sets.
- A new relationship between the dilatation of pseudo-Anosov braids and fixed point theory
- Generalized braid groups and rigidity
- On period minimal pseudo-Anosov braids
- On genericity of pseudo-Anosovs in the Torelli group
- Genericity of pseudo-Anosov mapping classes, when seen as mapping classes
- Pseudo-Anosov maps and surgery on fibred 2-bridge knots
- An asymptotic behavior of the dilatation for a family of pseudo-Anosov braids
- On presentations of generalizations of braids with few generators.
Braid groups; Artin groups (20F36) Geometric group theory (20F65) Asymptotic properties of groups (20F69)
Cited In (15)
- Garside groups and geometry: Some thoughts for Patrick Dehornoy
- On the centralizer of generic braids
- Acylindrical hyperbolicity and Artin-Tits groups of spherical type
- Genericity of pseudo-Anosov mapping classes, when seen as mapping classes
- A fast algorithm to the conjugacy problem on generic braids.
- The root extraction problem in braid group-based cryptography
- On the genericity of pseudo-Anosov braids. I: Rigid braids.
- On the genericity of loxodromic actions
- A family of pseudo-Anosov braids with large conjugacy invariant sets.
- Simple braids tend toward positive entropy
- On genericity of pseudo-Anosovs in the Torelli group
- Small braids with large ultra summit set.
- Genericity of contracting elements in groups
- Fast Nielsen-Thurston classification of braids.
- Curve graphs and Garside groups
This page was built for publication: On the genericity of pseudo-Anosov braids. II: Conjugations to rigid braids.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013894)