pith. sign in

arxiv: 2505.06472 · v2 · submitted 2025-05-10 · 🧮 math.CO

The Trunk of the Restricted Flip Graph of Triangulated S³

V. Faber , M. Murphy This is my paper

Pith reviewed 2026-05-22 16:52 UTC · model grok-4.3

classification 🧮 math.CO
keywords restricted flip graphtrunk3-sphere triangulationsbistellar flipsPachner movesstellar subdivisionconnected components4-simplex
0
0 comments X

The pith

The trunk of triangulations of S^3 reachable without 4-1 moves forms one connected component in the restricted flip graph at each level n of at least 5 and is closed under 1-4 moves.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper studies the restricted flip graph of n-vertex triangulations of the 3-sphere, where only 2-3 and 3-2 flips are allowed. It introduces the trunk as the collection of triangulations that can be reached from the boundary of the 4-simplex using 1-4, 2-3, and 3-2 moves but never a 4-1 move. The main theorems show that for n at least 5 the triangulations in the trunk at that vertex count make up an entire connected component of the graph, and that performing a 1-4 move on a trunk triangulation keeps it in the trunk. A reader might care because this identifies a large, explicitly describable piece of the space of triangulations that stays connected under restricted flips, revealing how the graph fragments when vertex-changing moves are forbidden. Computational evidence places all small triangulations inside this trunk.

Core claim

We define the trunk to be the set of triangulations reachable from ∂Δ^4 using 1–4, 2–3, and 3–2 moves, but no 4–1 moves. For every n≥5, we prove that the level-n slice of the trunk is exactly one connected component of F(n), and that the trunk is closed upward under 1–4 moves. Thus any Pachner path that starts in the trunk and leaves it must do so via a 4–1 move. We complement these structural theorems with computational results showing that F(10) and F(11) are entirely contained within the trunk and are therefore connected, and that all 12-vertex seed triangulations with minimum edge valence at least 4 lie in the trunk.

What carries the argument

The trunk, the set of triangulations reachable from the boundary of the 4-simplex using 1–4, 2–3, and 3–2 moves but no 4–1 moves.

Load-bearing premise

The Component Preservation Theorem holds, so that 1–4 stellar subdivision induces a well-defined map on the connected components of the restricted flip graph for any closed connected 3-manifold.

What would settle it

An explicit n-vertex triangulation of S^3 for some n≥5 that lies in a different connected component of F(n) from the trunk triangulations would falsify the claim that the trunk slice equals one full component.

read the original abstract

Let $\mathcal{F}_M(n)$ be the restricted flip graph of $n$-vertex triangulations of a closed connected $3$-manifold $M$, whose edges are vertex-preserving $2$--$3$ and $3$--$2$ bistellar flips. Unlike the full Pachner graph, which allows vertex-changing $1$--$4$ and $4$--$1$ moves, the restricted flip graph can fragment into multiple components. We prove a general Component Preservation Theorem: for any such $M$, $1$--$4$ stellar subdivision induces a well-defined map on the connected components of $\mathcal{F}_M(n)$. For \(S^3\), we define the trunk to be the set of triangulations reachable from \(\partial\Delta^4\) using \(1\)--\(4\), \(2\)--\(3\), and \(3\)--\(2\) moves, but no \(4\)--\(1\) moves. For every \(n\ge 5\), we prove that the level-\(n\) slice of the trunk is exactly one connected component of \(\mathcal F(n)\), and that the trunk is closed upward under \(1\)--\(4\) moves. Thus any Pachner path that starts in the trunk and leaves it must do so via a \(4\)--\(1\) move. We complement these structural theorems with computational results for $S^3$. We prove that $\mathcal{F}(10)$ and $\mathcal{F}(11)$ are entirely contained within the trunk (and are therefore connected), and that all $12$-vertex seed triangulations with minimum edge valence at least $4$ lie in the trunk. Finally, we provide explicit certificates demonstrating that the four currently known isolated ``unflippable'' spheres -- $U(16)$, $U(20)$, $U_1(21)$, and $U_2(21)$ -- all enter the trunk after a single $1$--$4$ subdivision.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The paper defines the restricted flip graph F_M(n) on n-vertex triangulations of a closed connected 3-manifold M with edges given by vertex-preserving 2-3 and 3-2 bistellar flips. It proves a general Component Preservation Theorem asserting that 1-4 stellar subdivision induces a well-defined map on the connected components of F_M(n). For M = S^3 the authors define the trunk as the set of triangulations reachable from ∂Δ^4 by 1-4, 2-3 and 3-2 moves (but no 4-1 moves). They prove that for every n ≥ 5 the level-n slice of the trunk coincides with a single connected component of F(n) and that the trunk is closed upward under 1-4 moves. The manuscript also reports computational verifications that F(10) and F(11) lie entirely inside the trunk, that all 12-vertex seed triangulations with minimum edge valence at least 4 belong to the trunk, and that the four known isolated unflippable spheres enter the trunk after a single 1-4 subdivision.

Significance. If the central claims hold, the work supplies a concrete structural description of one distinguished component of the restricted flip graph on S^3 and shows that this component absorbs all triangulations up to at least 12 vertices. The general Component Preservation Theorem and the explicit certificates for the known unflippable spheres are concrete, checkable contributions that clarify how components of the restricted graph merge under vertex-increasing moves. These results are useful for any study of Pachner graphs, enumeration of triangulations, or algorithms that traverse flip graphs.

major comments (1)
  1. [Component Preservation Theorem] Component Preservation Theorem: the proof must construct an explicit sequence of 2-3/3-2 moves relating any two 1-4 subdivisions of 2-3/3-2-connected n-vertex triangulations. It is not yet clear whether this construction uses only the local combinatorics of stellar subdivisions or whether it invokes S^3-specific features such as the existence of a global 4-simplex. Because the identification of trunk slices with full components rests on this theorem, the argument needs to be presented in a form that visibly avoids manifold-specific assumptions.
minor comments (2)
  1. [Notation and definitions] Notation: the manuscript alternates between F_M(n) and F(n); a single consistent convention (e.g., F(n) only when M = S^3 is fixed) would improve readability.
  2. [Computational results] Computational section: the source or enumeration method for the 12-vertex seed triangulations should be cited explicitly so that the claim “all seeds with min valence ≥ 4 lie in the trunk” can be independently verified.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on the manuscript. We address the major comment point by point below.

read point-by-point responses

  1. Referee: Component Preservation Theorem: the proof must construct an explicit sequence of 2-3/3-2 moves relating any two 1-4 subdivisions of 2-3/3-2-connected n-vertex triangulations. It is not yet clear whether this construction uses only the local combinatorics of stellar subdivisions or whether it invokes S^3-specific features such as the existence of a global 4-simplex. Because the identification of trunk slices with full components rests on this theorem, the argument needs to be presented in a form that visibly avoids manifold-specific assumptions.

    Authors: We agree that the proof of the Component Preservation Theorem would benefit from an expanded, fully explicit construction. In the revised manuscript we will add a detailed step-by-step argument that, given two n-vertex triangulations T and T' lying in the same connected component of F_M(n), produces an explicit finite sequence of vertex-preserving 2-3 and 3-2 flips relating the two 1-4 subdivisions T* and T'*. The construction proceeds by lifting a given 2-3/3-2 path between T and T' to the subdivided triangulations using only local combinatorial rules for how each flip interacts with the newly added vertex; no global topological properties of S^3 (or of any particular manifold) are invoked. We will reorganize the section to state the theorem for arbitrary closed connected 3-manifolds M at the outset and to flag each step as depending solely on the local stellar-subdivision combinatorics, thereby making the manifold-independence of the argument immediately visible. revision: yes

Circularity Check

0 steps flagged

No circularity: central claims rest on explicitly proved general theorem and direct definitions

full rationale

The manuscript states and proves the Component Preservation Theorem as a general result applying to arbitrary closed connected 3-manifolds M before specializing to S^3; the trunk is defined directly as the set reachable from ∂Δ^4 via 1-4, 2-3, and 3-2 moves only. The claim that level-n slices coincide with components for n≥5 follows from this theorem plus the explicit reachability definition, without any reduction of a prediction to a fitted parameter, without self-citation of an unverified uniqueness result, and without smuggling an ansatz. Computational checks for n=10,11 and the unflippable spheres supply independent verification outside the general argument. No quoted step equates a derived quantity to its input by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The paper relies on standard definitions from piecewise-linear topology and introduces the trunk as a derived mathematical set rather than postulating new physical or geometric objects.

axioms (2)
  • standard math Bistellar flips and stellar subdivisions preserve the PL homeomorphism type of the manifold
    Invoked throughout the definitions of the restricted flip graph and the trunk.
  • domain assumption S^3 admits a triangulation whose boundary is that of the 4-simplex
    Used as the base case for constructing the trunk.
invented entities (1)
  • The trunk no independent evidence
    purpose: A distinguished subset of triangulations closed under 1-4 moves and connected via restricted flips
    Newly defined set whose connectivity properties are the main object of study

pith-pipeline@v0.9.0 · 5903 in / 1527 out tokens · 78747 ms · 2026-05-22T16:52:09.144477+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    The classification of simplicial 3-spheres with nine vertices into polytopes and non-polytopes

    A. Altshuler, J. Bokowski, and L. Steinberg. “The classification of simplicial 3-spheres with nine vertices into polytopes and non-polytopes.” Discrete Math., 31(2):115–124, 1980. 13

    work page 1980

  2. [2]

    Simplicial manifolds, bistellar flips and a 16-vertex triangulation of the Poincar´ e homology 3-sphere

    A. Bj¨ orner and F. H. Lutz. “Simplicial manifolds, bistellar flips and a 16-vertex triangulation of the Poincar´ e homology 3-sphere.” Exp. Math., 9(2):275–289, 2000

    work page 2000

  3. [3]

    Small triangulations of 4- manifolds and the 4-manifold census

    R. A. Burke, B. A. Burton, and J. Spreer. “Small triangulations of 4- manifolds and the 4-manifold census.” In41st International Symposium on Computational Geometry (SoCG 2025), LIPIcs vol. 332, pp. 28:1–28:16,

    work page 2025

  4. [4]

    doi:10.4230/LIPIcs.SoCG.2025.28

    work page doi:10.4230/lipics.socg.2025.28 2025

  5. [5]

    Unflippable tetrahedral com- plexes

    R. Dougherty, V. Faber, and M. Murphy. “Unflippable tetrahedral com- plexes.” Discrete Comput. Geom., 32(3):309–315, 2004

    work page 2004

  6. [6]

    Tetrahedralizing point sets in three dimensions

    H. Edelsbrunner, F. P. Preparata, and D. B. West. “Tetrahedralizing point sets in three dimensions.” J. Symbolic Comput., 10(3–4):335–347, 1990

    work page 1990

  7. [7]

    Incremental topological flipping works for regular triangulations

    H. Edelsbrunner and N. R. Shah. “Incremental topological flipping works for regular triangulations.” Algorithmica, 15(3):223–241, 1996

    work page 1996

  8. [8]

    The complete enumeration of 4-polytopes and 3-spheres with nine vertices

    M. Firsching. “The complete enumeration of 4-polytopes and 3-spheres with nine vertices.” Israel J. Math., 238(1):1–48, 2020. doi:10.1007/s11856- 020-2070-4

    work page doi:10.1007/s11856- 2020

  9. [9]

    An enumeration of simplicial 4- polytopes with 8 vertices

    B. Gr¨ unbaum and V. P. Sreedharan. “An enumeration of simplicial 4- polytopes with 8 vertices.” J. Combin. Theory, 2(4):437–465, 1967

    work page 1967

  10. [10]

    Joswig, D

    M. Joswig, D. Lofano, F. H. Lutz, et al. “Frontiers of sphere recog- nition in practice.” J. Appl. Comput. Topol., 6(3):503–527, 2022. doi:10.1007/s41468-022-00092-8

    work page doi:10.1007/s41468-022-00092-8 2022

  11. [11]

    Simplifying triangulations ofS 3

    A. Mijatovi´ c. “Simplifying triangulations ofS 3.” Pacific J. Math., 208(2):291–324, 2003

    work page 2003

  12. [12]

    Many triangulated odd-dimensional spheres

    E. Nevo, F. Santos, and S. Wilson. “Many triangulated odd-dimensional spheres.” Math. Ann., 364(3–4):737–762, 2016. doi:10.1007/s00208-015- 1232-x

    work page doi:10.1007/s00208-015- 2016

  13. [13]

    P.L. homeomorphic manifolds are equivalent by elementary shellings

    U. Pachner. “P.L. homeomorphic manifolds are equivalent by elementary shellings.” European J. Combin., 12(2):129–145, 1991. doi:10.1016/s0195- 6698(13)80080-7

    work page doi:10.1016/s0195- 1991

  14. [14]

    Combinatorial 3-manifolds with transitive cyclic symmetry

    J. Spreer. “Combinatorial 3-manifolds with transitive cyclic symmetry.” Discrete Comput. Geom., 51(2):394–426, 2014. doi:10.1007/s00454-013- 9560-7

    work page doi:10.1007/s00454-013- 2014

  15. [15]

    Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds

    T. Sulanke and F. H. Lutz. “Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds.” European J. Combin., 30(8):1965– 1979, 2009. 14

    work page 1965