Graphs of subgroups of free groups.

From MaRDI portal



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.


In the present paper, the authors propose an alternative and effective model for studying the relationship between the join and intersection of finitely generated subgroups of a free group. This authors' model yields a quick proof of Dicks' equivalence theorem [\textit{W. Dicks}, Invent. Math. 117, No. 3, 373-389 (1994; Zbl 0809.05055)] as well as an answer to an unpublished question of \textit{M. Culler} and \textit{P. B. Shalen} [Four-free groups and hyperbolic geometry. arXiv:0806.1188].











This page was built for publication: Graphs of subgroups of free groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1007212)