HAL : hal-00001267, version 2

arXiv : math.GT/0403177

Fiche détaillée

Récupérer au format BibTeX - EndNote - TEI - RefWorks -

Journal of the European Mathematical Society 9, 4 (2007) 801-840

Versions disponibles :

v1 (10-03-2004)

v2 (15-04-2006)

On the complexity of braids

Ivan Dynnikov 1, Bert Wiest 2

(2007)

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta_{ij}$, which are Garside-like half-twists involving strings $i$ through $j$, and by counting powered generators $\Delta_{ij}^k$ as $\log(|k|+1)$ instead of simply $|k|$. The geometrical complexity is some natural measure of the amount of distortion of the $n$ times punctured disk caused by a homeomorphism. Our main result is that the two notions of complexity are comparable. This gives rise to a new combinatorial model for the Teichmueller space of an $n+1$ times punctured sphere. We also show how to recover a braid from its curve diagram in polynomial time. The key rôle in the proofs is played by a technique introduced by Agol, Hass, and Thurston.

1 :	Dept. of Mechanics and Mathematics (Dept. of Mechanics and Mathematics, Moscow State University)
	Lomonosov Moscow State University
2 :	Institut de Recherche Mathématique de Rennes (IRMAR)
	CNRS : UMR6625 – Université de Rennes 1 – École normale supérieure de Cachan - ENS Cachan – Institut National des Sciences Appliquées (INSA) : - RENNES – Université de Rennes II - Haute Bretagne

Domaine

:

Mathématiques/Topologie géométrique Mathématiques/Théorie des groupes

Mots Clés : braid – curve diagram – complexity – lamination – Teichmüller space

hal-00001267, version 2

http://hal.archives-ouvertes.fr/hal-00001267

oai:hal.archives-ouvertes.fr:hal-00001267

Contributeur : Bert Wiest <>

Soumis le : Vendredi 14 Avril 2006, 17:36:47

Dernière modification le : Mercredi 11 Mars 2009, 09:28:57