Purely algebraic reformulation of sphere manipulations

Reframe the sphere manipulations used to establish connectivity of the graph of spheres in a fixed primitive homology class entirely in algebraic terms of free splittings, including an algebraic description of the group actions used in the connectivity proof and of intermediate free-splitting graphs sharing common refinements.

Background

The sphere graph of Mr=#r(S1×S2)M_r=\#_r(S^1\times S^2) is isomorphic to the free splitting graph of FrF_r, and the subgraph associated with a fixed primitive homology class can likewise be described using one-edge free splittings inducing a fixed primitive cohomology class. The paper nevertheless conducts its connectivity arguments using embedded spheres, diffeomorphisms, and three-manifold diagrams.

The authors identify an unresolved difficulty in translating these geometric arguments into purely algebraic language. In particular, they point to the challenge of expressing the relevant group actions and the geometric process of locating disjoint spheres as algebraic constructions involving graphs of groups and common refinements.

References

However, unlike the manipulations in Aramayona and Souto's paper, it is not clear to us how to reframe the sphere manipulations in this work in purely algebraic terms. In particular, understanding the actions used to establish connectivity from the free splitting perspective seems quite challenging: We have found it much easier to study the action of a diffeomorphism on a sphere than of a graph homotopy equivalence on a graph of groups, and to locate a disjoint sphere in an appropriate diagram than to find an intermediate graph of groups that shares a common refinement with two given graphs of groups.

— Coloring graphs of homologous spheres  (2610.12347 - Bering et al., 8 Oct 2026) in Section 1, Introduction