Pith. sign in

REVIEW 2 minor 1 cited by

New relations for the Penrose polynomial

T0 review · 0 major / 2 minor · reviewed 2026-06-28 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The Penrose polynomial at n=4 satisfies two new relations based on pentagons and quadrilaterals.

desk verdict Two new relations for the Penrose polynomial at n=4, proven via a new ribbon graph polynomial, form the core advance and hold up on direct inspection. read the letter →

arxiv 2606.06643 v1 pith:DR4KZONS submitted 2026-06-04 math.CO math.GT

Scott Baldridge , Ben McCarty This is my paper
classification math.COmath.GT
keywords Penrosepolynomialribbongraphpentagonquadrilateralrelationsn=4combinatorics
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 introduces two new relations involving the pentagon and the quadrilateral for evaluating the Penrose polynomial at n=4. These relations are proven by means of a new type of ribbon graph polynomial. The work also extends several relations previously known for n=3 to hold for all n. This matters because it gives new tools for calculating the Penrose polynomial on graphs that contain these substructures.

What carries the argument

A new ribbon graph polynomial that proves the relations for the Penrose polynomial at n=4.

What would settle it

Direct computation of the Penrose polynomial at n=4 for a graph with a pentagon that contradicts the value predicted by the new relation.

Watch

Extended reading notes

Core claim

We introduce two new relations involving the pentagon and the quadrilateral for the evaluation of the Penrose polynomial at n=4 that is proven using a new type of ribbon graph polynomial. Additionally, we extend several relations for the evaluation of the Penrose polynomial at n=3 to all n.

Load-bearing premise

The new ribbon graph polynomial correctly encodes the evaluations of the Penrose polynomial at n=4 in the cases of the pentagon and the quadrilateral.

Editorial extensions

If this is right

  • The Penrose polynomial at n=4 can be reduced using operations on pentagons and quadrilaterals.
  • Relations for the Penrose polynomial at n=3 now hold for arbitrary n.
  • The new ribbon graph polynomial provides a method to establish these evaluations.

Reading between the lines

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

  • The new relations could be used to develop algorithms for computing the Penrose polynomial more efficiently.
  • Similar techniques might be applied to other values of n or related graph polynomials.
  • This work may strengthen connections between Penrose polynomials and ribbon graphs in combinatorial topology.
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 / 2 minor

Summary. The manuscript introduces two new relations for the Penrose polynomial evaluated at n=4, specifically involving the pentagon and quadrilateral, which are proven using a newly defined ribbon graph polynomial. It additionally extends several existing relations for the Penrose polynomial at n=3 to hold for arbitrary n.

Significance. If the central claims hold, the work supplies concrete new identities for Penrose polynomial evaluations at a fixed point together with a supporting ribbon-graph construction that encodes those evaluations. The generalization of the n=3 relations to all n increases the scope of previously known identities. These contributions are of moderate interest within combinatorial graph theory and knot invariants, provided the new polynomial is shown to be well-defined and faithful to the Penrose evaluations.

minor comments (2)
  1. [Abstract] The abstract states that the relations are proven via the new ribbon graph polynomial but does not indicate the precise form of either the relations or the polynomial; a one-sentence statement of each would improve readability without lengthening the abstract.
  2. Notation for the new ribbon graph polynomial is introduced without an explicit comparison table to the classical Penrose polynomial; adding such a table (even a small one) would clarify the encoding claim.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their summary of the manuscript and for recommending minor revision. The report notes the introduction of new relations at n=4 via a ribbon graph polynomial and the extension of n=3 relations to arbitrary n. No specific major comments appear under the MAJOR COMMENTS heading.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; derivation self-contained

full rationale

The paper defines a new ribbon graph polynomial to prove relations for the Penrose polynomial at n=4 and extends relations at n=3. No equations appear in the abstract, and the description indicates explicit constructions whose correctness can be verified directly without any reduction to inputs by definition, fitted parameters renamed as predictions, or load-bearing self-citations. The central argument does not invoke uniqueness theorems from the authors' prior work or smuggle ansatzes via citation. This is the normal case of an independent derivation.

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

Only the abstract is available; no explicit free parameters, axioms, or invented entities beyond the mention of a new polynomial type can be extracted or verified.

how reviews work

0 comments
Cite this review

Pith. "Pith review of New relations for the Penrose polynomial." pith.science (2026). https://pith.science/paper/DR4KZONS

@misc{pith2026260606643,
  author       = {Pith},
  title        = {Pith review of: New relations for the Penrose polynomial},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DR4KZONS}},
  note         = {Machine review of arXiv:2606.06643}
}
abstract

We introduce two new relations involving the pentagon and the quadrilateral for the evaluation of the Penrose polynomial at $n=4$ that is proven using a new type of ribbon graph polynomial. Additionally, we extend several relations for the evaluation of the Penrose polynomial at $n=3$ to all $n$.

Figures

Figures reproduced from arXiv: 2606.06643 by the authors.

Figure 1
Figure 1. Relations from Penrose’s original paper [11]. In each case, the relation involves the bracket evaluated at n = 3. 1 arXiv:2606.06643v1 [math.CO] 4 Jun 2026 [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. A hypercube of states. 2.1. A new extension of the Penrose polynomial. Theorems E and 7.2 in [5] establish that the evaluation of the Penrose polynomial at n is determined by a signed count of proper colorings of state graphs. Regarding each state graph as a ribbon graph in its own right, [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. A double theta graph with a twist. However, examining the four state graphs in this calculation, one observes that every proper coloring of each state graph must assign the same color to the two intersecting arcs at the top: the buckle is always on a single circle in each state. By Lemma 2.7, if we include the buckle in our computation of the BM polynomial, we find that BM polynomial is zero. If we examine the eight… view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: The 3-prism, or the blowup of a θ-graph. In this case, since the BM polynomial is 0, none of the four states corresponding to [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]
Figure 5
Figure 5. Figure 5: An example of a graph that contains a pentagonal face [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: Excising a pentagonal face and creating a cap. then simplify the diagram by marking one interaction site with a buckle for each pair of interacting arcs, excluding any arcs that interact along a spoke (these are addressed when considering smoothings of the configuratio…
Figure 7
Figure 7. Figure 7: A cap C. matching graph decorated by interaction sites in the cap. We denote this by C#P and refer to as a capped configuration (see [PITH_FULL_IMAGE:figures/full_fig_p008_7.png]
Figure 8
Figure 8. Figure 8: A capped configuration C#P. For a given number of spokes, the set of all possible caps is clearly finite: for n spokes, we consider all possible ways of connecting them with n arcs and then assign buckles to all possible interactions between the arcs [PITH_FULL_IMAGE:…
Figure 9
Figure 9. Figure 9: A simple cap. Our approach is to take each cap, insert various configurations, compute the polynomials for each capped configuration, and identify relations among the polynomials that hold for every possible cap. With the Penrose polynomial, this approach is ineffectiv…

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. New relations for the vertex polynomial

    math.CO 2026-07 conditional novelty 6.0 of 10

    The vertex polynomial satisfies local relations for digon, triangle, quadrilateral, and pentagon faces, extending it to arbitrary-degree graphs.

Reference graph

Works this paper leans on

21 extracted references · 7 canonical work pages · cited by 1 Pith paper

  1. [1]

    Aigner, The Penrose polynomial of a plane graph , Mathematische Annalen, 307, 173-189, 1997

    M. Aigner, The Penrose polynomial of a plane graph , Mathematische Annalen, 307, 173-189, 1997

    1997

  2. [2]

    Baldridge

    S. Baldridge, A new cohomology theory for planar trivalent graphs with perfect matchings . arXiv:1810.07302

    work page arXiv

  3. [3]

    Baldridge, L

    S. Baldridge, L. Kauffman, and W. Rushworth, On ribbon graphs and virtual links , European Journal of Combinatorics 103 , June 2022, doi: 10.1016/j.ejc.2022.103520, arXiv: 2010.04238

    work page doi:10.1016/j.ejc.2022.103520 2022

  4. [4]

    Baldridge, A

    S. Baldridge, A. Lowrance, and B. McCarty, The 2-factor polynomial detects even perfect matchings , The Electronic Journal of Combinatorics 27 (2020), no. 2, P2.27, 16 pp. doi: 10.37236/9214, arXiv:1812.10346

    work page doi:10.37236/9214 2020

  5. [5]

    Baldridge and B

    S. Baldridge and B. McCarty, A topological quantum field theory approach to graph coloring , arXiv:2303.12010

    work page arXiv

  6. [6]

    Baldridge and B

    S. Baldridge and B. McCarty, A new way to prove configuration reducibility using gauge theory , arXiv:2412.18558

    work page arXiv

  7. [7]

    Baldridge, L

    S. Baldridge, L. Kauffman, and B. McCarty, A State Sum for the Total Face Color Polynomial Journal of Graph Theory, 24 March 2025, https://doi.org/10.1002/jgt.23239

    work page doi:10.1002/jgt.23239 2025

  8. [8]

    J. A. Ellis-Monaghan and I. Moffatt, Graphs on surfaces , Springer Briefs in Mathematics. Springer, New York, 2013

    2013

Show all 21 references
  1. [9]

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

    2013

  2. [10]

    Snarks, boojums, and other conjectures related to the four-color-map theorem

    Gardner, Martin (1976), "Snarks, boojums, and other conjectures related to the four-color-map theorem", Mathematical Games, Scientific American, 4 (234): 126Ð130,

    1976

  3. [11]

    American Mathematical Monthly , vol

    Isaacs, Rufus (1975), Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable. American Mathematical Monthly , vol. 82, Pages 630Ð633

    1975

  4. [12]

    Jaeger, F., On transition polynomials of 4-regular graphs , Cycles and Rays (Hahn et al, eds.) Kluwer, 123-150, 1990

    1990

  5. [13]

    L. H. Kauffman, A state calculus for graph coloring , Illinois Journal of Mathematics 60 (2015), no. 1, 251-271

    2015

  6. [14]

    L. H. Kauffman, Multi-Virtual Knot Theory, arXiv:2409.07499

  7. [15]

    Khovanov, A categorification of the Jones polynomial, Duke Math

    M. Khovanov, A categorification of the Jones polynomial, Duke Math. J. 101 (2000), no. 3, 359--426

    2000

  8. [16]

    Lee, An endomorphism of the Khovanov invariant, Adv

    E.S. Lee, An endomorphism of the Khovanov invariant, Adv. Math. 197 (2005), no. 2, 554–586

    2005

  9. [17]

    Thesis, Grenoble 1977

    Martin, P., Enumeration eul\' e riennes dans les multigraphes et invariants de Tutte?Grothendieck. Thesis, Grenoble 1977

    1977

  10. [18]

    Penrose, ``Applications of negative dimensional tensors,'' in Combinatorial Mathematics and Its Applications , Academic Press (1971)

    R. Penrose, ``Applications of negative dimensional tensors,'' in Combinatorial Mathematics and Its Applications , Academic Press (1971)

    1971

  11. [19]

    Sur le th\'eor\`me de Tait

    Petersen, Julius (1898), "Sur le th\'eor\`me de Tait", L'Interm\'ediaire des Math\'ematiciens, 5: 225Ð227

  12. [20]

    Combin.TheorySer.B 70 (1997),no.1, 166-183

    Robertson,Neil, Seymore, Paul and Thomas, Robin, Tutte's edge coloring conjecture, J. Combin.TheorySer.B 70 (1997),no.1, 166-183

    1997

  13. [21]

    T., On the algebraic theory of graph colorings , J

    Tutte, W. T., On the algebraic theory of graph colorings , J. Combinatorial Theory,1 (1966),15-50

    1966

Pith tools

Reviewed June 28, 2026 · model on record in the stance chip above.