Colored Stallings graphs yield monomorphisms g, h from F_n to F_2 with rk Eq(g,h) at least 2n-2, disproving the conjecture that the equalizer rank is at most n for n greater than or equal to 3.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Colored Stallings graphs and Counterexamples to Stallings equalizer conjecture
Colored Stallings graphs yield monomorphisms g, h from F_n to F_2 with rk Eq(g,h) at least 2n-2, disproving the conjecture that the equalizer rank is at most n for n greater than or equal to 3.