On the genericity of Whitehead minimality - Université Sorbonne Paris Nord Accéder directement au contenu
Rapport Année : 2013

On the genericity of Whitehead minimality

Résumé

We show that a finitely generated subgroups of a free group, chosen uniformly at random, is strictly Whitehead minimal. Whitehead minimality is one of the key elements of the solution of the orbit problem in free groups. The proofs strongly rely on automata theory and on the combinatorial tools used in the analysis of algorithms. The result we prove actually depends implicitly on the choice of a distribution on finitely generated subgroups, and we establish it for the two distributions which appear in the literature on random subgroups.
Fichier principal
Vignette du fichier
2013-12-14-whitehead_min.pdf (349.31 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00919489 , version 1 (16-12-2013)
hal-00919489 , version 2 (06-03-2014)

Identifiants

Citer

Frédérique Bassino, Cyril Nicaud, Pascal Weil. On the genericity of Whitehead minimality. 2013. ⟨hal-00919489v1⟩
404 Consultations
212 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More