On the genericity of Whitehead minimalityReport as inadecuate

On the genericity of Whitehead minimality - Download this document for free, or read online. Document in PDF available to download.

1 LIPN - Laboratoire d-Informatique de Paris-Nord 2 LIGM - Laboratoire d-Informatique Gaspard-Monge 3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Keywords : Whitehead minimality subgroups free groups

Author: Frédérique Bassino - Cyril Nicaud - Pascal Weil -

Source: https://hal.archives-ouvertes.fr/


Related documents