Counterexamples to coefficient conjectures for plane Penrose polynomials

A mix of human-written and AI-generated textHuman understanding: all partsmath.CO — Combinatoricsmath.GT — Geometric Topology

Contributed by Yair Lavi ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

We give counterexamples to coefficient-sign alternation and coefficient nonvanishing for the plane Penrose polynomial PH(q)=∑A⊆E(H)(−1)∣A∣qcH(A)P_H(q)=\sum_{A\subseteq E(H)}(-1)^{|A|}q^{c_H(A)}. Here HH is a graph embedded in the sphere, and cH(A)c_H(A) counts boundary components after replacing vertices by disks and edges by bands and half-twisting the bands in AA. Weak alternation means that coefficients, read in descending powers from a positive leading coefficient, are alternately nonnegative and nonpositive. We construct a simple bridgeless plane graph on ten vertices whose Penrose polynomial is monic of degree eight and has linear coefficient 160160, contrary to weak alternation. A bridgeless plane multigraph on eleven vertices has zero linear coefficient. We also give a simple bridgeless cubic example on twelve vertices, where cubic means that every vertex has degree three; its linear and quadratic coefficients both have the wrong signs. These examples answer Aigner's questions on coefficient nonvanishing and sign alternation negatively. Replacing each degree-kk vertex of the first two examples by a kk-cycle, with the incident edges attached in their embedding order, gives counterexamples to both coefficient conjectures of Kauffman, Silver and Williams. A known triangle-replacement identity gives infinite families, and connected sums give arbitrarily many vanishing initial coefficients for the Penrose–Kauffman polynomial. The cycle matroid of the ten-vertex example is an explicit planar minor-minimal obstruction to coefficient alternation, answering Aigner's question about minor-minimal binary-matroid obstructions negatively.

Author comments: The supplement cited in the text (supplement-v7.tar.gz: an exact verifier in Python 3.10+, its saved output and a README) is archived with the paper in the Zenodo record https://doi.org/10.5281/zenodo.24351582.

Tools used

OpenAI
GPT (Sol)
OpenAI
GPT (Astra)
Anthropic
Claude Fable

References

  1. M. Aigner, The Penrose polynomial of a plane graph , Mathematische Annalen 307 (1997), 173--189. doi:10.1007/s002080050030 (https://doi.org/10.1007/s002080050030). Author preprint A-96-12 (1996) (https://ftp.mi.fu-berlin.de/pub/math/publ/pre/1996/pr-a-96-12.ps). Item numbering follows the linked author preprint.DOI
  2. M. Aigner, Die Ideen von Penrose zum 4-Farbenproblem , Jahresbericht der Deutschen Mathematiker-Vereinigung 102 (2000), 43--68. Journal scan (https://www.math.uni-bielefeld.de/JB_DMV/JB_DMV_102_2.pdf).link
  3. M. Aigner, The Penrose polynomial of graphs and matroids , in J. W. P. Hirschfeld (ed.), Surveys in Combinatorics, 2001 , London Mathematical Society Lecture Note Series 288 , Cambridge University Press (2001), 11--46. doi:10.1017/CBO9780511721328.004 (https://doi.org/10.1017/CBO9780511721328.004).DOI
  4. M. Aigner and H. Mielke, The Penrose polynomial of binary matroids , Monatshefte für Mathematik 131 (2000), 1--13. doi:10.1007/s006050070020 (https://doi.org/10.1007/s006050070020).DOI
  5. S. Baldridge and B. McCarty, New relations for the Penrose polynomial , arXiv: 2606.06643v1 (https://arxiv.org/abs/2606.06643v1), 4 June 2026.arXiv
  6. J. A. Ellis-Monaghan and I. Moffatt, A Penrose polynomial for embedded graphs , European Journal of Combinatorics 34 (2013), 424--445. doi:10.1016/j.ejc.2012.06.009 (https://doi.org/10.1016/j.ejc.2012.06.009); arXiv: 1106.5279v3 (https://arxiv.org/abs/1106.5279v3). Item numbering follows arXiv v3.arXivDOI
  7. L. H. Kauffman, D. S. Silver and S. G. Williams, The Penrose-Kauffman Polynomial , arXiv: 2604.16635v1 (https://arxiv.org/abs/2604.16635v1), 17 April 2026.arXiv
  8. R. Penrose, Applications of Negative Dimensional Tensors , in D. J. A. Welsh (ed.), Combinatorial Mathematics and its Applications , Academic Press (1971), 221--244.
  9. D. S. Silver and S. G. Williams, On the component number of links from plane graphs , Journal of Knot Theory and Its Ramifications 24 (2015), 1520002. doi:10.1142/S0218216515200023 (https://doi.org/10.1142/S0218216515200023). arXiv: 1408.6815 (https://arxiv.org/abs/1408.6815).arXivDOI
  10. H. Whitney, Non-separable and planar graphs , Transactions of the American Mathematical Society 34 (1932), 339--362. doi:10.1090/S0002-9947-1932-1501641-2 (https://doi.org/10.1090/S0002-9947-1932-1501641-2).DOI

Version history

  1. v1 · 16 pagesSubmitted by Yair LaviThe supplement cited in the text (supplement-v7.tar.gz: an exact verifier in Python 3.10+, its saved output and a README) is archived with the paper in the Zenodo record https://doi.org/10.5281/zenodo.24351582.CurrentNov 18, 2026