2000 character limit reached
Counting cycles in labeled graphs: The nonpositive immersion property for one-relator groups
Published 9 Oct 2014 in math.GR | (1410.2579v2)
Abstract: We prove a rank 1 version of the Hanna Neumann Theorem. This shows that every one-relator 2-complex without torsion has the nonpositive immersion property. The proof generalizes to staggered and reducible 2-complexes.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.