Probabilistic Hanna Neumann Conjectures

arXiv:2601.00053 · math.GR · Submitted 2025-12-31 · Read on arXiv

math.GR

Submitted: 2025-12-31

Updated: 2026-10-31

Comments: 56 pages. v2: substantially revised and extended, with a new abstract: new applications to Bowen's f-invariant and to the dependence theorem of Louder and Wilton (in an appendix joint with Noam Ta Shma). Appendices contributed by Doron Puder and Andrei Jaikin-Zapirain

License: http://creativecommons.org/publicdomain/zero/1.0/

The gist: We develop a theory of polymatroids on Stallings core graphs, and prove a gap theorem.

Terminology

Abstract

We develop a theory of polymatroids on Stallings core graphs, and prove a gap theorem. As special cases of it, we prove the gap conjecture of Ernst-West, Puder, Seidel and the author on the stable K-primitivity rank (using a forthcoming result of Ernst-West and Puder); prove Reiter's conjecture on word-random subgroups of finite groups; improve Bowen's bounds on the f-invariant for p.m.p. actions of free groups in which a generating partition has a non-cyclic stabilizer, deducing coalescence; and extend the proof of Wise's w-cycle conjecture by Louder and Wilton to not-necessarily-cyclic subgroups, which gives a new proof of this special case of the Friedman-Mineyev theorem (i.e. the Hanna Neumann conjecture). Louder and Wilton further improved the bound in Wise's conjecture via their "dependence theorem"; in an appendix joint with Noam Ta Shma, we extend this improvement too to not-necessarily-cyclic subgroups, again as a special case of the main gap theorem. We also compute the exact decay rate of the expected number of invariant subsets, respectively subspaces, for word-random subgroups of S n, respectively GL n(F q).

Sources

Related papers