The Trunk of the Restricted Flip Graph of Triangulated S^3
V. Faber, M. Murphy

TL;DR
This paper studies the structure of restricted flip graphs of triangulations of the 3-sphere, proving connectivity properties of the 'trunk' subset and computationally analyzing specific cases and unflippable spheres.
Contribution
It introduces the concept of the trunk in restricted flip graphs, proves its structural properties, and provides computational evidence for connectivity and unflippable spheres in the case of the 3-sphere.
Findings
The level-n slice of the trunk forms a single connected component for all n≥5.
The entire graphs for 10 and 11 vertices are contained within the trunk, hence connected.
Known unflippable spheres become flippable after a single subdivision.
Abstract
Let be the restricted flip graph of -vertex triangulations of a closed connected -manifold , whose edges are vertex-preserving -- and -- bistellar flips. Unlike the full Pachner graph, which allows vertex-changing -- and -- moves, the restricted flip graph can fragment into multiple components. We prove a general Component Preservation Theorem: for any such , -- stellar subdivision induces a well-defined map on the connected components of . 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\)…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
