Search arXivSearch

arXiv · 2604.24502

Colored Stallings graphs and Counterexamples to Stallings equalizer conjecture

Abstract

The famous Stallings equalizer conjecture has remained open for more than 40 years, which states that, for any free group \(F_n\) of rank \(n\ge 2\), any free group \(F\), and any two monomorphisms $g,h:F_n\to F,$ the equalizer $\Eq(g,h)=\{w\in F_n\mid g(w)=h(w)\}$ satisfies $\rk \Eq(g,h)\le n.$ The only known case is $n=2$, due to A. D. Logan in 2022. By introducing the notion of colored Stallings graphs, we show that for every integer \(n\ge 2\) there exist monomorphisms $g,h:F_n\longrightarrow F_2$ such that$\rk\Eq(g,h)\ge 2n-2.$ This disproves Stallings equalizer conjecture for $n\ge 3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jialin Lei, Teng Zhang. 2026-05-09. Colored Stallings graphs and Counterexamples to Stallings equalizer conjecture. https://arxiv.org/abs/2604.24502

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Hyperfiniteness of boundary actions via tree decompositions

We study conditions for a countable group acting on a connected locally finite hyperbolic graph to induce a hyperfinite orbit equivalence relation on the Gromov boundary of the graph in terms of tree-decompositions of the graph. We prove that for a connected locally finite hyperbolic graph $X$ equipped with an action of a countable group $G$, if $(T, β)$ is a $G$-invariant tree-decomposition of $X$ such that each bag induces a connected subgraph $X_t$ of $X$ for each $t \in V(T)$, each adhesion set is finite and such that there are only finitely many $G$-orbits of edges of $T$, then the orbit equivalence relation of $G$ acting on the Gromov boundary $\partial X$ is hyperfinite provided the orbit equivalence relation of $G$ acting on $\partial T$ is hyperfinite and the orbit equivalence relations of the bag stabilizers acting on $\partial X_t$ are all hyperfinite. We show that the converse also holds if $(T, β)$ satisfies the additional property that each adhesion set distinguishes at least two ends of $X$.

math.GR

Compatible additions on a six-element commutative semigroup: equational bases and subvariety lattices

Let $M$ be the six-element commutative semigroup occurring as the common multiplicative reduct of the semirings $SR_6$ and $TR_6$. The closing paragraph of Shao, Ren, and Gao~\cite{ShaoRenGao2026} asks for the finite-basis and subvariety questions for the four remaining compatible additions on $M$. We answer these questions for the four isomorphism types $R_{01},R_{02},R_{11},R_{12}$. First, we classify all compatible additions on $M$: there are nine labelled additions and six isomorphism types, parametrized by $R_{ij}$ with $0\leq i\leq j\leq 2$. For each of the four new types we give a graph-theoretic criterion for every identity, an explicit infinite basis, and a proof of nonfinite basability. The generated varieties $\V(R_{01})$ and $\V(R_{02})$ have eleven subvarieties each, while $\V(R_{11})$ has sixty-six. The lattice $\Sub(\V(R_{12}))$ is countably infinite. Every identity in this variety reduces to a subset of twenty-five fixed identities together with two monotone path families $γ_n$ and $\gammaD_n$. This yields a canonical signature $(H,p,q)$, complete normal forms, explicit meet and join operations, and a formula for all covers. There are 153 fixed nodes, 43 one-parameter families, and 9 two-parameter families; exactly eighteen subvarieties are finitely based, and the unique limit subvariety is $\V(SR_6)$. The strong nonfinite-basis status of the four finite semirings remains open.

math.GR