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 Edit this on Wikidata


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 ge 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





Cited In (15)





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)