On the genericity of Whitehead minimality

Abstract : We show that a finitely generated subgroup of a free group, chosen uniformly at random, is strictly Whitehead minimal with overwhelming probability. Whitehead minimality is one of the key elements of the solution of the orbit problem in free groups. The proofs strongly rely on combinatorial tools, notably those of analytic combinatorics. 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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00919489
Contributor : Pascal Weil <>
Submitted on : Thursday, March 6, 2014 - 5:11:32 AM
Last modification on : Thursday, February 7, 2019 - 5:50:52 PM
Long-term archiving on : Sunday, April 9, 2017 - 9:06:19 PM

Files

2014-03-05-whitehead_min.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00919489, version 2
  • ARXIV : 1312.4510

Citation

Frédérique Bassino, Cyril Nicaud, Pascal Weil. On the genericity of Whitehead minimality. Journal of Group Theory, De Gruyter, 2016, 19 (1), pp.137-159. ⟨hal-00919489v2⟩

Share

Metrics

Record views

631

Files downloads

195