2000 character limit reached
The Hanna Neumann Conjecture and the rank of the join
Published 15 Sep 2015 in math.GR and math.GT | (1509.04449v2)
Abstract: The Hanna Neumann conjecture gives a bound on the intersection of finitely generated subgroups of free groups. We explore a natural extension of this result, which turns out to be true only in the finite index case, and provide counterexamples for the general case. We also see that the graph-based method of generating random subgroups of free groups developed by Bassino, Nicaud and Weil is well-suited to generating subgroups with non-trivial intersections. The same method is then used to generate a counterexample to a similar conjecture of Guzman.
Paper Prompts
Sign up for free to create and run prompts on this paper.