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.
Recommendations
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- Average-case complexity of the Whitehead problem for free groups
- Heuristics for the Whitehead Minimization Problem
- Generic properties of random subgroups of a free group for general distributions.
Cited in
(10)- A list of applications of Stallings automata
- Counting words of minimum length in an automorphic orbit.
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- A hybrid search algorithm for the Whitehead minimization problem.
- Generic properties of subgroups of free groups and finite presentations
- ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
- Heuristics for the Whitehead Minimization Problem
- Growing words in the free group on two generators.
- Artificial Intelligence and Symbolic Computation
- scientific article; zbMATH DE number 5657724 (Why is no real title available?)
This page was built for publication: On the genericity of Whitehead minimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905405)
