Graphs of subgroups of free groups
Larsen Louder, D. B. McReynolds

TL;DR
This paper introduces an efficient graph model for finitely generated subgroups of free groups, providing a concise proof of a key conjecture and addressing a question on subgroup intersections.
Contribution
It presents a novel, efficient graph-based model for subgroups and offers new proofs and answers related to the Hanna Neumann Conjecture and subgroup intersection ranks.
Findings
Short proof of the Amalgamated Graph Conjecture
Answer to Culler and Shalen's question on subgroup ranks
Independent confirmation by R. P. Kent IV
Abstract
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In addition, we answer a question of Culler and Shalen on ranks of intersections in free groups. The latter has also been done independently by R. P. Kent IV.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Graph Theory Research · Cultural Insights and Digital Impacts
