Pith. sign in

REVIEW 3 minor 19 references

The Penrose-Kauffman Polynomial

T0 review · 0 major / 3 minor · reviewed 2026-05-10 · grok-4.3

Challenge this review Download PDF Read on arXiv ↗

Pith's one-line read The Penrose-Kauffman polynomial of any cubic graph with a perfect matching equals the sum of chromatic polynomials of a collection of associated graphs.

desk verdict The paper defines the Penrose-Kauffman polynomial as a sum of chromatic polynomials and proves an equivalence between the Four Color Theorem and 3-colorings of specific reduced alternating link diagrams. read the letter →

arxiv 2604.16635 v1 submitted 2026-04-17 math.GT

Louis H. Kauffman , Daniel S. Silver , Susan G. Williams This is my paper · ORCID
classification math.GT
keywords Penrose-KauffmanpolynomialchromaticpolynomialsFourColorTheoremalternatinglinkscubicgraphsperfectmatchingsknotdiagrams3-coloring
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper shows that the Penrose-Kauffman polynomial decomposes directly into chromatic polynomials through a construction that starts from a cubic graph in a closed orientable surface plus a perfect matching. A correspondence with alternating link diagrams supplies elementary proofs for both classical and new properties of the polynomial. The same correspondence yields an exact logical equivalence between the Four Color Theorem and a concrete assertion about which reduced alternating link diagrams in the plane admit 3-colorings when they contain no bigon regions. This link between knot invariants and graph coloring supplies a new route for studying both subjects. A reader might care because the equivalence recasts a famous theorem about planar maps as a statement purely about link diagrams and their colorings.

What carries the argument

The translation between a cubic graph plus perfect matching and an alternating link diagram, which turns the Penrose-Kauffman polynomial into a sum of chromatic polynomials while preserving coloring information.

What would settle it

A single reduced alternating link diagram in the plane with no bigon regions whose 3-colorability fails to match the 4-colorability of the graph obtained from the cubic-plus-matching construction, or vice versa.

Watch

Extended reading notes

Core claim

For any cubic graph embedded in a closed orientable surface together with a perfect matching, the Penrose-Kauffman polynomial is equal to the sum of the chromatic polynomials of the associated graphs produced by the construction. The knot-theoretic translation between these graphs and alternating link diagrams gives short proofs of known results and establishes new ones. The Four Color Theorem is equivalent to a statement about 3-coloring alternating link diagrams in the plane that are reduced and have no bigon regions.

Load-bearing premise

The particular construction that produces the associated graphs from the cubic graph and perfect matching yields a genuine equivalence to the Four Color Theorem when interpreted through knot diagrams, without hidden dependence on unstated properties of surfaces or diagrams.

Editorial extensions

If this is right

  • Properties of the Penrose-Kauffman polynomial follow from elementary arguments about link diagrams rather than direct graph-theoretic calculation.
  • The Four Color Theorem acquires an equivalent formulation stated entirely in terms of 3-colorings of reduced alternating diagrams without bigons.
  • Results previously known for the polynomial receive new short proofs via the knot-diagram correspondence.
  • The same correspondence produces new identities relating the polynomial to chromatic polynomials on surfaces of any genus.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The diagram formulation may allow small cases of the Four Color Theorem to be checked by enumerating and coloring link diagrams instead of graphs.
  • The method suggests similar translations could be attempted for other graph-coloring theorems using appropriate knot or link invariants.
  • Because the construction works on surfaces of any genus, the approach may produce new coloring identities that have no direct planar counterpart.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

0 major / 3 minor

Summary. The manuscript defines the Penrose-Kauffman polynomial associated to a cubic graph embedded in a closed orientable surface together with a perfect matching as the sum of the chromatic polynomials of a collection of associated graphs obtained from the input data. A knot-theoretic translation is used to supply elementary proofs of several properties of the polynomial. The central result is an equivalence between the Four Color Theorem and the 3-colorability of reduced alternating link diagrams in the plane that have no bigon regions, established via explicit bijections between the medial graphs and the diagrams.

Significance. If the claims hold, the work supplies a new bridge between graph coloring, the Four Color Theorem, and knot theory through the Penrose-Kauffman polynomial. The explicit constructions in §2, the direct expansions establishing the sum-of-chromatic-polynomials formula in §3, and the explicit bijections proving both directions of the equivalence in §5 are strengths that make the equivalence falsifiable and the proofs elementary without hidden surface or diagram assumptions. This perspective may yield further applications in both fields.

minor comments (3)
  1. [§1] §1: The introduction would be strengthened by a short paragraph comparing the Penrose-Kauffman polynomial to the Kauffman bracket and Jones polynomial, clarifying what is new versus what is recovered.
  2. [§4] §4: A single illustrative diagram showing the passage from a cubic graph plus matching to the associated alternating link diagram would make the knot-theoretic translation easier to follow.
  3. [§5] §5, Theorem 5.1: The statement of the equivalence could explicitly note that the reduction and no-bigon conditions are preserved under the medial-graph construction, even though the proof already shows this.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation of minor revision. No specific major comments were raised in the report, so we have no point-by-point responses. We will prepare a revised manuscript addressing any minor editorial matters as needed.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity detected in derivation chain

full rationale

The paper explicitly defines the Penrose-Kauffman polynomial as the sum of chromatic polynomials of graphs associated to a cubic graph plus perfect matching (via direct expansion in the relevant sections). The knot-theoretic translation supplies independent elementary proofs, and the Four Color Theorem equivalence is established by exhibiting explicit bijections between medial graphs and the specified reduced alternating diagrams with no bigons; both directions are proved directly without reducing to self-citations, fitted parameters renamed as predictions, or ansatzes smuggled via prior work. All load-bearing steps remain self-contained against external graph-theoretic and diagrammatic benchmarks.

Assumptions & free parameters 0 free parameters · 2 assumptions · 1 invented entities

Only the abstract is available, so the ledger is necessarily incomplete. The work rests on standard properties of chromatic polynomials and on the correspondence between cubic graphs with matchings and link diagrams.

assumptions (2)
  • standard math Chromatic polynomials satisfy the deletion-contraction recurrence and evaluate to the number of proper colorings
    Invoked when the polynomial is expressed as a sum of chromatic polynomials of associated graphs.
  • domain assumption Reduced alternating link diagrams without bigons admit a well-defined 3-coloring invariant under Reidemeister moves
    Required for the equivalence statement to the Four Color Theorem.
invented entities (1)
  • Penrose-Kauffman polynomial
    purpose: To encode information about a cubic graph plus perfect matching via a sum of chromatic polynomials
    Newly defined object whose properties are studied in the paper; no independent existence outside the definition is claimed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of The Penrose-Kauffman Polynomial." pith.science (2026). https://pith.science/paper/2604.16635

@misc{pith2026260416635,
  author       = {Pith},
  title        = {Pith review of: The Penrose-Kauffman Polynomial},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2604.16635}},
  note         = {Machine review of arXiv:2604.16635}
}
read the original abstract

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old and new results about the polynomial. The Four Color Theorem is shown to be equivalent to a statement about 3-coloring alternating link diagrams in the plane that are reduced and have no bigon regions.

Figures

Figures reproduced from arXiv: 2604.16635 by the authors.

Figure 1
Figure 1. Tait n-Coloring Condition 3 Penrose-Kauffman Polynomial All surfaces are assumed to be connected, closed and orientable. In [11] the first author defined an integral polynomial for cubic graphs and perfect matchings in surfaces with the property that its evaluation at any positive integer n ≥ 3 is the number of Tait n-colorings. Since there can be only one such polynomial, the following definition is equivalent to t… view at source ↗
Figure 2
Figure 2. Building a Link Diagram D from (G, M) A (smoothing) state of D is the link diagram S gotten by smoothing a subset of crossings in the manner shown in [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Smoothing a Crossing of D Definition 3.2. A state S is colorable if, for each edge e ∈ M, the two arcs (crossing or parallel) that replace e lie in different link components Ce, C′ e . If the arcs cross, then we will say that the components cross; if they are parallel then the components kiss. Note that a state is colorable if no component crosses or kisses itself. 4 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (25 more)
Figure 4
Figure 4. Figure 4: Correspondence between Tait n-colorings of (G, M) and n￾colorings of states S We will refer to the polynomial P(q) as the PK polynomial of both (G, M) and the associated link diagram D. If D has no colorable states, then the polynomial is zero. 5 [PITH_FULL_IMAGE:figu…
Figure 5
Figure 5. Figure 5: Left-hand trefoil, colorable state and component graph [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]
Figure 6
Figure 6. Figure 6: Right-hand trefoil, colorable states and component graphs [PITH_FULL_IMAGE:figures/full_fig_p006_6.png]
Figure 7
Figure 7. Figure 7: Non-prime link diagrams Definition 3.6. A connected sum of link diagrams D1, D2 is a link diagram D1♯D2 obtained by cutting an arc of each diagram and connecting them as in [PITH_FULL_IMAGE:figures/full_fig_p007_7.png]
Figure 8
Figure 8. Figure 8: Map coloring from 3-colorable state of associated link diagram [PITH_FULL_IMAGE:figures/full_fig_p009_8.png]
Figure 9
Figure 9. Figure 9: Left-right walks corresponding to the set [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]
Figure 10
Figure 10. Figure 10: Admissible n-valuation labeling Every Penrose polynomial arises as a PK polynomial. To see this, “blow up” each vertex of G to obtain a cubic graph Gˆ (see [PITH_FULL_IMAGE:figures/full_fig_p010_10.png]
Figure 11
Figure 11. Figure 11: (a) Plane graph G; (b) blowing up vertices of G to obtain Gˆ; (c) medial graph M(G) Remark 4.2. While every polynomial arising from Aigner’s construction arises as a PK polynomial, the reverse inclusion does not hold [PITH_FULL_IMAGE:figures/full_fig_p011_11.png]
Figure 12
Figure 12. Figure 12: Link diagram D in the torus (left) ; states of D (right) 6 Alternating link diagrams An alternating link diagram D can be checkerboard shaded so the regions containing dots, the dotted regions of D, are the shaded regions. We will 13 [PITH_FULL_IMAGE:figures/full_fig…
Figure 13
Figure 13. Figure 13: Obtaining an n-coloring of S ′ from S We see from the argument above that the 2r -to-1 function f from states of D to states of D¯ also preserves the number of components of the state. This yields: Corollary 6.4. For a semi-reduced alternating plane diagram D, the num…
Figure 14
Figure 14. Figure 14: Nonalternating diagram such that P(q) has odd leading coeffi￾cient Let D be a semi-reduced alternating plane link diagram. If D has a chain of (one or more) dotted bigons, they correspond to parallel edges in the dual Tait graph of D. If we replace each chain by a sin…
Figure 15
Figure 15. Figure 15: Diagram with undotted bigon (left); after removal (right) [PITH_FULL_IMAGE:figures/full_fig_p017_15.png]
Figure 16
Figure 16. Figure 16: Proof that D′ is semi-reduced Suppose that D′ has a 3-colorable state S ′ . Extend S ′ to a state S of D by smoothing the two crossings of the bigon to create an unknot component. Any 3-coloring of S ′ can be extended to a 3-coloring of S by giving the unknot a color …
Figure 17
Figure 17. Figure 17: Flype 18 [PITH_FULL_IMAGE:figures/full_fig_p018_17.png]
Figure 18
Figure 18. Figure 18: Projection of L = 83 1 8 PK Polynomial and Falling Factorials Assume that (G, M) is a cubic graph with perfect matching M. For each m ∈ N, let cm denote the number of Tait m-colorings of (G, M) using all m colors. (Note that cm = 0 for sufficiently large m.) The numbe…
Figure 19
Figure 19. Figure 19: Nonalternating link diagram with S0 noncolorable Denote by s(n, k) the Stirling symbol of the first kind. Its absolute value (−1)n−k s(n, k) is equal to the number of permutations of n elements with exactly k disjoint cycles. It is well known that (q)n = Xn k=1 s(n, k…
Figure 20
Figure 20. Figure 20: (a) link diagram D; (b) orientation of all-smoothed state S0 The colorable states must each have an even number of crossings since two components intersect in an even number of points and no component of a colorable state crosses itself. Thus the number of components …
Figure 21
Figure 21. Figure 21: Link diagram in torus and colorable states [PITH_FULL_IMAGE:figures/full_fig_p025_21.png]
Figure 22
Figure 22. Figure 22: Penrose Formula 27 [PITH_FULL_IMAGE:figures/full_fig_p027_22.png]
Figure 23
Figure 23. Figure 23: Tautological Formula The tautology indicates how to generalize this notion of coloring a graph with 3 colors to colorings with n colors for a graph G with a given perfect matching M. Here M denotes a set of disjoint “matching edges” whose end￾points comprise the entir…
Figure 24
Figure 24. Figure 24: Graphs for States that G[S] has no vertices with self-loops correspond to the colorable states defined above.) See [PITH_FULL_IMAGE:figures/full_fig_p029_24.png]
Figure 25
Figure 25. Figure 25: Generalized Penrose Expansion can start with virtual diagrams when working with non-planar graphs. The virtual crossings are then crossings resulting from taking representative im￾mersions of the graphs in the plane. It is worth mentioning that the logical tautology a…
Figure 26
Figure 26. Figure 26: Knot Diagram Expansion [PITH_FULL_IMAGE:figures/full_fig_p031_26.png]
Figure 27
Figure 27. Figure 27: Uncolorability Criterion 31 [PITH_FULL_IMAGE:figures/full_fig_p031_27.png]
Figure 28
Figure 28. Figure 28: Uncolorability Criterion and Petersen Graph [PITH_FULL_IMAGE:figures/full_fig_p032_28.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references · 19 canonical work pages

  1. [1]

    Aigner, The Penrose polynomial of a plane graph, Math

    M. Aigner, The Penrose polynomial of a plane graph, Math. Ann. 307 (1997), 173–189. MR1428870

    work page 1997

  2. [2]

    Baldridge and B

    S. Baldridge and B. McCarty, Quantum state systems that count perfect matchings, arXiv:2401.07939v1

    work page arXiv

  3. [3]

    Biggs, Algebraic Graph Theory, Cambridge University Press, Cam- bridge, 1974

    N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cam- bridge, 1974

    work page 1974

  4. [4]

    Crapo, Chromatic polynomials for a join of graphs.Combinatorial theory and its applications, I–III (Proc

    H.H. Crapo, Chromatic polynomials for a join of graphs.Combinatorial theory and its applications, I–III (Proc. Colloq., Balatonf¨ ured, 1969), pp. 239–245 Colloq. Math. Soc. J´ anos Bolyai, 4 North-Holland Publishing Co., Amsterdam-London, 1970. MR0299524

    work page 1969

  5. [5]

    Diestel, Graph Theory, 5th ed., Springer-Verlag, Berlin, 2017

    R. Diestel, Graph Theory, 5th ed., Springer-Verlag, Berlin, 2017

    work page 2017

  6. [6]

    J. A. Ellis-Monaghan and I. Moffatt, A Penrose polynomial for embedded graphs, European J. Combin. 34 (2013), 424–445. MR2994409

    work page 2013

  7. [7]

    J. A. Ellis-Monaghan, L. H. Kauffman, and I. Moffatt, Edge colorings and topological graph polynomials, Australasian Journal of Combina- torics 72 (2018), no. 2, 90–305. MR3856479 32

    work page 2018

  8. [8]

    Jacobson, Basic Algebra I, W

    N. Jacobson, Basic Algebra I, W. H. Freeman and Co., San Francisco, 1985

    work page 1985

Show all 19 references
  1. [9]

    Jaeger, On transition polynomials of 4-regular graphs, In Cycles and rays (Montreal, PQ, 1987), vol

    F. Jaeger, On transition polynomials of 4-regular graphs, In Cycles and rays (Montreal, PQ, 1987), vol. 301 of NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., pp. 123–150. Kluwer Acad. Publ., Dordrecht, 1990. MR1096990

    1987

  2. [10]

    L. H. Kauffman,Knots and Physics, World Scientific Pub. Co. (1991,1994, 2001, 2012)

    1991

  3. [11]

    Kauffman,Colorings and Penrose evaluations, virtual colloquium presented at University of South Alabama, January 18, 2024

    L.H. Kauffman,Colorings and Penrose evaluations, virtual colloquium presented at University of South Alabama, January 18, 2024

    2024

  4. [12]

    Kauffman, Multi-virtual knot theory, J

    L.H. Kauffman, Multi-virtual knot theory, J. Knot Theory Ramifica- tions 34, no. 14 (2015) 2540002, 78 pp

    2015

  5. [13]

    Kauffman, New invariants in the theory of knots

    L.H. Kauffman, New invariants in the theory of knots. Amer. Math. Monthly 95 (1988), no.3, 195–242. MR0935433

    1988

  6. [14]

    Lickorish and M.B

    W.B.R. Lickorish and M.B. Thistlethwaite,Some links with non-trivial polynomials and their crossing-numbers, Comment. Math. Helv. 63 (1988), 527–539

    1988

  7. [15]

    Ellis-Monaghan, I

    J.A. Ellis-Monaghan, I. Moffatt,A Penrose polynomial for embedded graphs, Europen J. Combinatorics 34 (2013), 424–445

    2013

  8. [16]

    Menasco and M

    W. Menasco and M. Thistlethwaite,The classification of alternating links, Ann. of Math. (2) 138 (1993), no. 1, 113–171. MR1230928

    1993

  9. [17]

    Penrose,Applications of negative-dimensional tensors, in Combina- torial Mathematics and its Applications (Proc

    R. Penrose,Applications of negative-dimensional tensors, in Combina- torial Mathematics and its Applications (Proc. Conf., Oxford, 1969), 221–244, Academic Press, London, 1971. MR0281657

    1969

  10. [18]

    Silver and S.G

    D.S. Silver and S.G. Williams,On the component number of links from plane graphs, J. Knot Theory Ramifications 24, no. 1 (2015) 1520002, 5 pp. MR3319677

    2015

  11. [19]

    Whitney,2-isomorphic graphs, Amer

    H. Whitney,2-isomorphic graphs, Amer. J. Math. 55(1933), no. 1, 245– 254. 33

    1933

Pith tools

Reviewed May 10, 2026 · model on record in the stance chip above.