pith. sign in

arxiv: 2605.05601 · v1 · submitted 2026-05-07 · 🧮 math.CO

Twist polynomial interpolation for binary delta-matroids

Zhao Zhao , Qi Yan This is my paper

Pith reviewed 2026-05-08 08:28 UTC · model grok-4.3

classification 🧮 math.CO
keywords twist polynomialbinary delta-matroideven polynomialodd polynomialpartial-dual polynomialribbon graphinterpolationdelta-matroid
0
0 comments X

The pith

The twist polynomial of any binary delta-matroid is even, odd, or both even- and odd-interpolating.

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

The paper shows that binary delta-matroids always produce twist polynomials that are even, odd, or interpolating for both even and odd values. The argument works by translating the problem into the setting of delta-matroids and using their binary representation properties. The same conclusion applies directly to the partial-dual polynomials of ribbon graphs. A reader cares because the result settles an open question on when these polynomials exhibit simple parity or interpolation behavior.

Core claim

We prove that the twist polynomial of any binary delta-matroid is either an even polynomial, an odd polynomial, or both even-interpolating and odd-interpolating. Applying this to ribbon graphs, we deduce that the partial-dual polynomial of any ribbon graph satisfies the same conclusion.

What carries the argument

The twist polynomial of a delta-matroid, whose coefficients record the number of twists of each size and whose parity or interpolation properties are controlled by the binary character of the delta-matroid.

Load-bearing premise

The delta-matroid must be binary.

What would settle it

A single binary delta-matroid whose twist polynomial has terms of both even and odd degree yet fails to be even-interpolating and fails to be odd-interpolating.

read the original abstract

Gross, Mansour and Tucker introduced the partial-dual polynomial of a ribbon graph and asked under what conditions such a polynomial is even-interpolating, odd-interpolating, or both. In this paper, we provide an answer to this open problem.Using the framework of delta-matroids, we prove that the twist polynomial of any binary delta-matroid is either an even polynomial, an odd polynomial, or both even-interpolating and odd-interpolating. Applying this to ribbon graphs, we deduce that the partial-dual polynomial of any ribbon graph satisfies the same conclusion.

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.

Referee Report

0 major / 3 minor

Summary. The paper proves that the twist polynomial of any binary delta-matroid is either an even polynomial, an odd polynomial, or both even-interpolating and odd-interpolating. It then transfers the result via the known correspondence between ribbon graphs and binary delta-matroids to conclude that the partial-dual polynomial of any ribbon graph satisfies the same trichotomy, thereby answering an open question of Gross, Mansour, and Tucker.

Significance. If the central derivation holds, the result supplies a complete answer to the interpolation question for partial-dual polynomials of ribbon graphs. The delta-matroid framework yields a uniform proof that covers all ribbon graphs without additional case analysis, and the explicit restriction to the binary case is correctly observed. The manuscript therefore strengthens the link between delta-matroid theory and topological graph polynomials.

minor comments (3)
  1. The definitions of even-interpolating and odd-interpolating polynomials (and the precise meaning of 'both') should be restated in §2 or §3 with a short example, rather than relying solely on the citation to Gross-Mansour-Tucker, to improve readability for readers outside the immediate subfield.
  2. In the statement of the main theorem on binary delta-matroids, clarify whether the even/odd property is with respect to the variable x or a shifted variable; the current wording leaves a minor ambiguity that affects how the ribbon-graph corollary is phrased.
  3. A brief remark on whether the result extends to non-binary delta-matroids (even if only to note that it fails) would help delineate the boundary of the theorem.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive and accurate summary of our manuscript, which correctly identifies that we resolve the open interpolation question for partial-dual polynomials of ribbon graphs by establishing the corresponding trichotomy for twist polynomials of binary delta-matroids. We appreciate the recommendation for minor revision.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper proves a theorem on twist polynomials of binary delta-matroids via their established framework and then deduces the corresponding property for partial-dual polynomials of ribbon graphs. No load-bearing steps reduce by construction to the inputs: there are no self-definitional equations, fitted parameters renamed as predictions, or self-citation chains that justify the central claim. The binary restriction is explicitly scoped as the domain of the result, and the application to ribbon graphs is a straightforward transfer rather than an internal loop. The derivation relies on independent properties of binary delta-matroids and external citations (e.g., Gross-Mansour-Tucker) without circular reduction.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the algebraic definition and representation properties of binary delta-matroids; no free parameters or new entities are introduced in the abstract.

axioms (1)
  • domain assumption Binary delta-matroids admit a linear representation over GF(2) that controls the parity behavior of the twist polynomial.
    Invoked to establish the even/odd interpolation property.

pith-pipeline@v0.9.0 · 5377 in / 1113 out tokens · 25199 ms · 2026-05-08T08:28:59.278586+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

23 extracted references · 23 canonical work pages

  1. [1]

    Bollobás, O

    B. Bollobás, O. Riordan, A polynomial invariant of graphs on orientable surfaces,Proc. London Math. Soc.83(2001) 513–531

    work page 2001

  2. [2]

    Bollobás, O

    B. Bollobás, O. Riordan, A polynomial of graphs on surfaces,Math. Ann. 323(2002) 81–96

    work page 2002

  3. [3]

    Bonin, C

    J.E. Bonin, C. Chun, S.D. Noble, Delta-matroids as subsystems of se- quences of Higgs lifts,Adv. Appl. Math.126(2021) 101910

    work page 2021

  4. [4]

    Bouchet, Greedy algorithm and symmetric matroids,Math

    A. Bouchet, Greedy algorithm and symmetric matroids,Math. Program. 38(1987) 147–159. 14

    work page 1987

  5. [5]

    Bouchet, Representability of∆-matroids,Colloq

    A. Bouchet, Representability of∆-matroids,Colloq. Math. Soc. J´anos Bolyai52(1987) 167–182

    work page 1987

  6. [6]

    Bouchet, A

    A. Bouchet, A. Duchamp, Representability of delta-matroids overGF(2), Linear Algebra Appl.146(1991) 67–78

    work page 1991

  7. [7]

    Brijder, H

    R. Brijder, H. Hoogeboom, Nullity and loop complementation for delta- matroids,SIAM J. Discrete Math.27(2013) 492–506

    work page 2013

  8. [8]

    Chen, J.L

    Y. Chen, J.L. Gross, T.W. Tucker, The maximum partial-dual genus of a ribbon graph,J. Algebraic Combin.63 (2026) 13

    work page 2026

  9. [9]

    Cheng, Partial-dual genus polynomial of graphs,European J

    Z.Y. Cheng, Partial-dual genus polynomial of graphs,European J. Com- bin.130(2025) 104221

    work page 2025

  10. [10]

    Chmutov, Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial,J

    S. Chmutov, Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial,J. Comb. Theory, Ser. B99(2009) 617– 638

    work page 2009

  11. [11]

    Chmutov, I

    S. Chmutov, I. Pak, The Kauffman bracket of virtual links and the Bollobás-Riordan polynomial,Moscow Math. J.7(2007) 409–418

    work page 2007

  12. [12]

    Chmutov, F

    S. Chmutov, F. Vignes-Tourneret, On a conjecture of Gross, Mansour and Tucker,European J. Combin.97(2021) 103368

    work page 2021

  13. [13]

    C. Chun, I. Moffatt, S.D. Noble, R. Rueckriemen, On the interplay between embedded graphs and dalta-matroids,Proc. London Math. Soc 118(2019) 675–700

    work page 2019

  14. [14]

    C. Chun, I. Moffatt, S.D. Noble, R. Rueckriemen, Matroids, delta- matroids and embedded graphs,J. Comb. Theory, Ser. A167(2019) 7–59

    work page 2019

  15. [15]

    Q. Deng, X. Jin, Q. Yan, Twist polynomial as a weight system for set systems,Fund. Math.270(2025) 159–175

    work page 2025

  16. [16]

    Ellis-Monaghan, I

    J.A. Ellis-Monaghan, I. Moffatt, Twisted duality for embedded graphs, Trans. Amer. Math. Soc.364(2012) 1529–1569

    work page 2012

  17. [17]

    Ellis-Monaghan, I

    J.A. Ellis-Monaghan, I. Moffatt, Graphs on Surfaces, Springer, New York, 2013. 15

    work page 2013

  18. [18]

    Gross, T

    J.L. Gross, T. Mansour, T.W. Tucker, Partial duality for ribbon graphs, I: Distributions,European J. Combin.86(2020) 103084

    work page 2020

  19. [19]

    Kauffman, State models and the Jones polynomial,Topology26 (1987) 395–407

    L.H. Kauffman, State models and the Jones polynomial,Topology26 (1987) 395–407

    work page 1987

  20. [20]

    Moffatt, Delta-matroids for graph theorists, in: Surveys in Combina- torics, 2019, in: London Math

    I. Moffatt, Delta-matroids for graph theorists, in: Surveys in Combina- torics, 2019, in: London Math. Soc. Lecture Note Ser., Cambridge Univ. Press, Cambridge456(2019) 167–220

    work page 2019

  21. [21]

    Q. Yan, X. Jin, Partial-dual polynomials and signed intersection graphs, Forum Math. Sigma10(2022) e69

    work page 2022

  22. [22]

    Q. Yan, X. Jin, Twist polynomials of delte-matroids,Adv. Appl. Math. 139(2022) 102363

    work page 2022

  23. [23]

    Q. Yan, X. Jin, Partial-twuality polynomials of delta-matroids,Adv. Appl. Math.153(2024) 102623. 16

    work page 2024