arxiv: 2604.12059 · v1 · submitted 2026-04-13 · 🧮 math.MG

Recognition: unknown

The Four Color Theorem meets Shapes of Polyhedra

Richard Evan Schwartz

Pith reviewed 2026-05-10 14:57 UTC · model grok-4.3

classification 🧮 math.MG

keywords four color theoremsphere triangulationspolyhedral conesquadratic formscombinatorial typesThurston moduli spaceflat cone structuresdegree sequences

0 comments

The pith

Solutions to the four-color problem on sphere triangulations with fixed degree sequence are sorted into types each parametrized by lattice points in a 4-dimensional cone.

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

The paper examines 4-colorings of the vertices of sphere triangulations where most vertices have degree 6 and exactly six have degree 4. These colorings are grouped into combinatorial types, with each generic type shown to correspond to the integer lattice points inside a 4-dimensional rational polyhedral convex cone. An integral quadratic form defined on the cone has the property that its diagonal part, when evaluated at a lattice point, equals three times the number of triangles in the associated triangulation. The construction is related to the octahedral stratum inside Thurston's moduli space of flat cone structures on the sphere. A reader would care because the result ties a classical graph-coloring question directly to the geometry of polyhedra and to a known moduli space.

Core claim

We consider solutions to the 4-color problem for the vertices of sphere triangulations with degree sequence 6,...,6,4,4,4,4,4,4. We sort these solutions into combinatorial types and show that each generic type τ is parametrized by the set of integer lattice points inside a 4-dimensional rational polyhedral convex cone C_τ. There is an integral quadratic form Q_τ on C_τ whose diagonal part, evaluated on a lattice point, is 3 times the number of triangles in the corresponding triangulation. We relate this structure to the octahedral stratum of Thurston's moduli space of flat cone structures on the sphere.

What carries the argument

The 4-dimensional rational polyhedral convex cone C_τ with its integral quadratic form Q_τ that parametrizes each generic combinatorial type of 4-coloring.

If this is right

Each generic type of 4-coloring corresponds to lattice points inside its own 4-dimensional rational polyhedral cone.
The quadratic form on the cone supplies a direct arithmetic count of the triangles in the triangulation.
The parametrization places the colorings inside the octahedral stratum of Thurston's moduli space of flat cone structures on the sphere.
The cones give a geometric organization of all solutions for this fixed degree sequence.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The cone volumes might yield asymptotic formulas for the number of triangulations of each type as the number of vertices grows.
The link to flat cone structures could connect the colorings to questions about rigid polyhedral realizations or flexible frameworks.
Similar cone parametrizations might exist for other degree sequences that satisfy the 4-color theorem.

Load-bearing premise

The 4-color solutions for the given degree sequence admit a sorting into generic combinatorial types each of which is faithfully parametrized by lattice points in a 4-dimensional rational polyhedral cone with the stated quadratic form property.

What would settle it

A concrete 4-coloring of a sphere triangulation with the stated degree sequence whose combinatorial type cannot be realized as lattice points inside any 4-dimensional rational polyhedral cone or for which the quadratic form fails to equal three times the triangle count.

Figures

Figures reproduced from arXiv: 2604.12059 by Richard Evan Schwartz.

**Figure 1.** Figure 1: A nice coloring of a flat cone sphere [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗

**Figure 2.** Figure 2: Same combinatorics, different geometry 4 [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

**Figure 3.** Figure 3: Same combinatorics, different geometry [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

**Figure 4.** Figure 4: Same combinatorics, different geometry 5 [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗

**Figure 2.1.** Figure 2.1: The dual multigraph 9 [PITH_FULL_IMAGE:figures/full_fig_p009_2_1.png] view at source ↗

**Figure 2.2.** Figure 2.2: The dual multigraph We split each blue edge e incident to v into two infinitesimally close halfedges [PITH_FULL_IMAGE:figures/full_fig_p010_2_2.png] view at source ↗

**Figure 2.** Figure 2: shows the beginning of a family of cell divisions of the sphere into [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗

**Figure 2.3.** Figure 2.3: shows the beginning of a family of cell divisions of the sphere into quadrilaterals. Our convention is that the outside of the big square is also part of the cell division [PITH_FULL_IMAGE:figures/full_fig_p011_2_3.png] view at source ↗

**Figure 2.4.** Figure 2.4: The graphs Gb6, Gb8, Gb10 The continuation of the pattern may not be entirely clear, so we say more about this. There is a spiral path in G2k which starts at the bottom left vertex and moves around until it reaches the last placed vertex. We have highlighted this path in yellow in each case. We put double red edges along this path, starting with the bottom edge and then continuing in a way that skips ove… view at source ↗

**Figure 2.5.** Figure 2.5: A nice coloring associated to Gb16. Notice the red zigzags on either side of the figure on the left. These are glued together by a translation. This creates a flat cylinder inside the octahedron. We can lengthen this cylinder by grafting in a 2 × 3 layer of trapezoids. We slit open the coloring along the green segment, then make the graft using trapezoids which have precisely the same shape as the ones a… view at source ↗

**Figure 2.** Figure 2: shows one example from an infinite family. The gluing around [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗

**Figure 2.6.** Figure 2.6: A checkerboard themed example [PITH_FULL_IMAGE:figures/full_fig_p013_2_6.png] view at source ↗

**Figure 2.7.** Figure 2.7: The dual multigraph associated to [PITH_FULL_IMAGE:figures/full_fig_p014_2_7.png] view at source ↗

**Figure 2.8.** Figure 2.8: shows two examples from what is presumably an infinite family. Unlike the previous two families, I don’t see an easy way to prove that all the members in the family exist. These examples (to me) give a hint of geodesic laminations [PITH_FULL_IMAGE:figures/full_fig_p014_2_8.png] view at source ↗

**Figure 2.9.** Figure 2.9: The multigraph corresponding to the left side of [PITH_FULL_IMAGE:figures/full_fig_p015_2_9.png] view at source ↗

**Figure 2.10.** Figure 2.10: Member 2324 of the first staircase family [PITH_FULL_IMAGE:figures/full_fig_p015_2_10.png] view at source ↗

**Figure 2.11.** Figure 2.11: The coloring associated to [PITH_FULL_IMAGE:figures/full_fig_p016_2_11.png] view at source ↗

**Figure 2.** Figure 2: ,12: Member 2324 of the second staircase family [PITH_FULL_IMAGE:figures/full_fig_p016_2.png] view at source ↗

**Figure 2.13.** Figure 2.13: The coloring associated to [PITH_FULL_IMAGE:figures/full_fig_p017_2_13.png] view at source ↗

**Figure 3.4.** Figure 3.4: Getting the shape of the nice polygon from the graph 18 [PITH_FULL_IMAGE:figures/full_fig_p018_3_4.png] view at source ↗

**Figure 3.** Figure 3: shows some local pictures of the multigraph superimposed over [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗

**Figure 3.5.** Figure 3.5: An inductive proof 19 [PITH_FULL_IMAGE:figures/full_fig_p019_3_5.png] view at source ↗

**Figure 4.** Figure 4: shows what we mean [PITH_FULL_IMAGE:figures/full_fig_p025_4.png] view at source ↗

**Figure 4.1.** Figure 4.1: shows what we mean [PITH_FULL_IMAGE:figures/full_fig_p025_4_1.png] view at source ↗

**Figure 4.** Figure 4: shows our normalization relative to the coordinate axes in [PITH_FULL_IMAGE:figures/full_fig_p027_4.png] view at source ↗

**Figure 4.2.** Figure 4.2: shows our normalization relative to the coordinate axes in C [PITH_FULL_IMAGE:figures/full_fig_p027_4_2.png] view at source ↗

read the original abstract

We consider solutions to the $4$-color problem for the vertices of sphere triangulations with degree sequence $6,...,6,4,4,4,4,4,4$. We sort these solutions into combinatorial types and show that each generic type $\tau$ is parametrized by the set of integer lattice points inside a $4$-dimensional rational polyhedral convex cone ${\cal C\/}_{\tau}$. There is an integral quadratic form $Q_{\tau}$ on ${\cal C\/}_{\tau}$ whose diagonal part, evaluated on a lattice point, is $3$ times the number of triangles in the corresponding triangulation. We relate this structure to the octahedral stratum of Thurston's moduli space of flat cone structures on the sphere.

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.

Desk Editor's Note private letter to a colleague

Schwartz parametrizes 4-colorings of certain sphere triangulations by lattice points in 4D cones and links them to Thurston's octahedral stratum.

read the letter

The key takeaway is that for sphere triangulations with that specific degree sequence, the 4-colorings can be grouped into types each parametrized by lattice points inside a 4D rational cone, complete with a quadratic form that counts the triangles and a connection to Thurston's moduli space. The paper does a good job laying out this structure for a concrete case. It moves beyond the existence proof of the four color theorem by providing an explicit geometric parametrization. The quadratic form part is neat because it ties the algebraic data directly to the number of triangles via its diagonal. Linking it to the octahedral stratum gives a potential bridge to geometric topology that feels fresh. On the soft side, the strength depends on how carefully the cones are constructed and how the parametrization is shown to be bijective or faithful for the generic types. The abstract is clear on the claims, but the full details will need to confirm that the quadratic form indeed works as stated without additional assumptions. Since the degree sequence is fixed and limited, the result is specialized, which is fine but limits broader impact. This kind of work is for people who like seeing combinatorial problems realized in geometric terms, especially those familiar with Thurston's work on cone metrics. A reader interested in moduli spaces or polyhedral combinatorics would get value from the explicit descriptions. I think it deserves serious refereeing. The ideas are grounded enough and the connection is worth verifying in detail.

Referee Report

0 major / 3 minor

Summary. The paper considers solutions to the 4-color problem for vertices of sphere triangulations with degree sequence consisting of six vertices of degree 4 and the remainder of degree 6. These solutions are partitioned into combinatorial types τ. For each generic type, the solutions are parametrized by the integer lattice points lying in a 4-dimensional rational polyhedral convex cone C_τ. An integral quadratic form Q_τ is defined on C_τ such that the diagonal part of Q_τ, evaluated at any lattice point, equals three times the number of triangles in the associated triangulation. The construction is related to the octahedral stratum of Thurston's moduli space of flat cone structures on the sphere.

Significance. If established, the result supplies an explicit geometric parametrization of 4-colorings for this fixed degree sequence, together with an algebraic invariant (the quadratic form) that directly recovers the triangle count. This framework could support enumeration or optimization of such triangulations via lattice-point techniques in convex geometry. The explicit link to Thurston's moduli space embeds the combinatorial problem in a well-studied geometric setting, potentially allowing transfer of methods between graph coloring and the theory of flat cone metrics.

minor comments (3)

[Abstract] The degree sequence is written as 6,...,6,4,4,4,4,4,4 without an explicit count of the degree-6 vertices. Although the count follows from Euler's formula, stating the total number of vertices or the precise sequence would remove any ambiguity.
[Introduction] The notion of a 'generic combinatorial type' is central to the parametrization claim but is not illustrated with a concrete low-dimensional example; adding one would help the reader verify the dimension count and the rationality of the cone.
[Section 6] The relation to the octahedral stratum of Thurston's moduli space is stated but the precise embedding or identification map is not summarized; a short diagram or coordinate description would clarify the connection.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our work and for recommending minor revision. No specific major comments were provided in the report, so we have no points requiring direct response or revision at this stage. We are happy to address any minor issues or clarifications if the editor or referee supplies them.

Circularity Check

0 steps flagged

No circularity; parametrization derived from combinatorial classification with external Thurston anchoring

full rationale

The paper's core claim is that 4-color solutions for the specified degree sequence can be partitioned into generic combinatorial types τ, each parametrized by lattice points in a 4-dimensional rational polyhedral cone C_τ equipped with an integral quadratic form Q_τ whose diagonal recovers 3 times the triangle count. This structure is then related to the octahedral stratum of Thurston's moduli space. No load-bearing step reduces by definition, by fitting a parameter then relabeling it a prediction, or by a self-citation chain whose cited result itself depends on the present work. The derivation is presented as arising from explicit sorting of solutions followed by geometric identification; the Thurston reference supplies independent external context rather than an internal bootstrap. The abstract and described claims contain no equations or definitions that equate the output cone/quadratic form to the input classification by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The abstract relies on the classical four color theorem for planar graphs and on the existence of sphere triangulations with the stated degree sequence; the novel parametrization is asserted without further axioms visible in the abstract.

axioms (2)

standard math The four color theorem holds for planar graphs and therefore for sphere triangulations.
Invoked implicitly when considering solutions to the 4-color problem.
domain assumption Sphere triangulations with degree sequence 6,6,6,6,6,6,4,4,4,4,4,4 exist and admit a combinatorial classification into generic types.
Required for the sorting step and the subsequent cone parametrization.

pith-pipeline@v0.9.0 · 5432 in / 1562 out tokens · 82852 ms · 2026-05-10T14:57:42.909578+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

10 extracted references · 2 canonical work pages · 1 internal anchor

[1]

You can color the vertices of any sphere triangulation with 4 colors in such a way that no two adjacent vertices get the same color
[2]

The Four Color Theorem meets Shapes of Polyhedra

You can color the triangles of any sphere triangulation black and white, so that the numbers of black and white triangles incident to each vertex are congruent to each other mod 3. ∗ Supported by N.S.F. Grant DMS-2505281 1 arXiv:2604.12059v1 [math.MG] 13 Apr 2026 Property (1) defines a piecewise aﬀine map ϕ from the sphere to the regular tetrahedron whose...

work page internal anchor Pith review Pith/arXiv arXiv 2026
[3]

There are 4 polygons around each regular vertex
[4]

Here the regular vertices are the vertices of the partition that are contained in disk neighborhoods

There are 2 polygons around each cone vertex. Here the regular vertices are the vertices of the partition that are contained in disk neighborhoods. We call the nice coloring unit triangulable if the polygons in the partition are all unit triangulable. In this case, the coloring gives a solution of the 4 coloring problem for the corresponding sphere triang...
[5]

two halves

of acute partners, let w be the associated vertex. There are three other nice polygons incident to w, and exactly one of them has w as an acute vertex. Thus, exactly one of our half edges in the set { e′ 1, e′ 2} has a parallel red edge. This gives us one red edge for each pair of acute partners. Hence there are 6 − k red edges incident to v. ♠ 10 2.2 A S...
[6]

The blue multigraph should divide the sphere into 6 bigons and some finite number of quadrilaterals
[7]

Each quadrilateral face of the blue multigraph should contain one red edge that is parallel to one of the blue edges of the face
[8]

We call a multigraph satisfying these conditions a plausible multigraph

The total number of edges incident to any vertex is 6. We call a multigraph satisfying these conditions a plausible multigraph . We call the plausible multigraph nice if it actually comes from a nice coloring of an octahedron. All the multigraphs shown in the previous chapter are nice. Given a plausible multigraph, we can extract the shapes that would be ...
[9]

We then consider the expression 1 4i z1w2 − z2w1 (8) When τ = τ ′ this expression computes the area of τ

For ease of notation we set wk = z′ k. We then consider the expression 1 4i z1w2 − z2w1 (8) When τ = τ ′ this expression computes the area of τ . In these coordinates, the Hermitian form is the sum of these expressions, appropriately scaled to match Equation 7. 28 4.5 The Quadratic Form Suppose we have a nice hexagon with consecutive side lengths ℓ = (ℓ1,...
[10]

This is the same factor that comes up for Q

times the area, at least when restricted to subsets of L corresponding to points in M. This is the same factor that comes up for Q. Lemma 4.2 Q′ is non-degenerate on L. Proof: If Q′ is degenerate then there is some nonzero vector V ∈ L such that ⟨V, W ⟩ is pure imaginary for all W ∈ L. But this is not true for W = V . Hence Q′ is non-degenerate. ♠ Let A∗ ...

work page arXiv 1992