pith. sign in

arxiv: 2604.12433 · v1 · submitted 2026-04-14 · 🧮 math.CO

Partial-twuality polynomials of matrices

Qingying Deng , Xian'an Jin , Qi Yan This is my paper

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

classification 🧮 math.CO
keywords partial-twuality polynomialsrank functionsEuler genusbouquetspartial dualityPetrie dualitymatrix pivotingmatrix inversion
0
0 comments X

The pith

A rank function on the adjacency matrix captures the Euler genus of a bouquet under partial-twuality, motivating the definition of a partial-twuality polynomial for any square matrix.

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

The paper observes that applying partial-twuality operations to a bouquet graph changes its Euler genus in a way that matches the rank of a transformed version of its adjacency matrix. This rank-based expression is lifted to define a polynomial for every square matrix over an arbitrary field. The polynomials are then shown to satisfy product formulas, recursion relations, and to have well-behaved degrees and interpolation properties. They remain unchanged under pivoting and display duality when the matrix is inverted. This creates an algebraic theory parallel to the original topological one.

Core claim

By expressing the Euler genus after partial-twuality as a rank function of the adjacency matrix of a bouquet, the authors define a partial-twuality polynomial for an arbitrary square matrix over any field. This polynomial generalizes the topological invariants and is proven to obey product formulas, recursion relations, invariance under pivoting, and duality theorems under inversion.

What carries the argument

The partial-twuality polynomial of a matrix, defined so that its evaluations correspond to rank expressions arising from partial-twuality transformations on the matrix entries.

If this is right

  • The polynomial of a block-diagonal matrix factors as the product of the polynomials of the blocks.
  • Recursion relations allow the polynomial to be computed from smaller submatrices obtained by deleting or contracting entries.
  • The degree of the polynomial is bounded by the dimension of the matrix.
  • Interpolation shows that knowing the polynomial at enough points determines it completely from specific rank evaluations.
  • Invariance under pivoting and duality under inversion mean the polynomial depends only on intrinsic linear dependence properties of the matrix.

Where Pith is reading between the lines

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

  • Since the definition works over any field, the polynomials connect to linear algebra problems in positive characteristic where topological interpretations are unavailable.
  • The same rank-based construction could be applied to other matrix invariants to produce new families of polynomials with similar recursion and duality properties.
  • The open problems posed at the end likely include seeking closed forms or combinatorial interpretations for the polynomials when the input matrix is arbitrary.

Load-bearing premise

The rank-function expression observed for adjacency matrices of bouquets extends naturally and usefully to define a polynomial for arbitrary square matrices that preserves the desired algebraic properties without additional ad-hoc choices.

What would settle it

Take a specific non-graph matrix such as the 3x3 identity matrix over the rationals, compute its partial-twuality polynomial, and check whether it satisfies the product formula when direct-summed with another matrix or remains invariant under pivoting.

Figures

Figures reproduced from arXiv: 2604.12433 by Qingying Deng, Qi Yan, Xian'an Jin.

Figure 1
Figure 1. Figure 1: The actions of δ and τ on an edge e 2.2. The partial-twuality polynomial for bouquets We first recall the definition of the partial-twuality polynomial for a rib￾bon graph. Definition 5 ([23]). For • ∈ {δ, τ, δτ, τ δ, τ δτ}, the partial-• polynomial of a ribbon graph G is defined as the generating function ∂ ε • G(z) := X A⊆E(G) z ε(G•(A) ) that enumerates all partial-• duals of G by Euler genus. A graft (… view at source ↗
Figure 2
Figure 2. Figure 2: Proof of Theorem 8 (3) ε(Bδτ(F) ) = rank A(I(B),S∆F) [F]  + rank A(I(B),S) [F c ]  , (4) ε(Bτδ(F) ) = rank A(I(B),S∆F)  − corank A(I(B),S) [F]  , (5) ε(Bτδτ(F) ) = rank A(I(B),S)  − corank A(I(B),S∆F) [F]  . Proof. We first prove (1) separately, as it follows directly from Proposition 7 ε(B τ(F) ) = rank A(I(B),S∆F)  . Set n = |E(B)|. For the remaining four statements, the proof follows a common pat… view at source ↗
read the original abstract

The study of partial-twuality polynomials originates from the classical operations of geometric duality and Petrie duality on cellularly embedded graphs. These involutions generate the symmetric group $S_3$, and applying them to subsets of edges yields the notions of partial-(geometric) duality, partial-Petriality, and more generally, partial-twuality. In this paper, we generalize this theory of partial-twuality polynomials within the framework of matrix algebra. The key observation that the Euler genus of a bouquet under a partial-twuality can be expressed as a rank function of its adjacency matrix motivates and leads to the definition of a partial-twuality polynomial for an arbitrary square matrix over any field, thereby providing a universal algebraic counterpart to the topological polynomials. We then investigate basic properties of these polynomials, including product formulas, recursion relations, degrees, interpolation behaviors, and invariance and duality theorems under the matrix operations of pivoting and inversion. We conclude by posing some problems for further research.

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 generalizes partial-twuality polynomials from cellularly embedded graphs to arbitrary square matrices over any field. Motivated by the fact that the Euler genus of a bouquet under partial-twuality equals a rank function of its adjacency matrix, the authors define an analogous polynomial for any square matrix and then establish its basic algebraic properties: product formulas, recursion relations, degree and interpolation behavior, and invariance/duality theorems under pivoting and inversion.

Significance. If the stated properties hold, the construction supplies a uniform algebraic lift of a topological invariant that may prove useful for studying matroids, graph embeddings, and linear-algebraic analogues of duality operations. The explicit verification of product formulas, recursions, and pivoting/inversion invariance constitutes a concrete strength, as these are the natural tests for any such generalization.

minor comments (3)
  1. [§2] §2 (definition): the precise formula that lifts the bouquet rank expression to an arbitrary matrix should be displayed as a numbered equation; the current prose description leaves the precise dependence on the matrix entries and the variable x implicit.
  2. [Theorem 4.3] Theorem 4.3 (inversion invariance): the statement claims invariance under matrix inversion, but the proof sketch does not address the case when the matrix is singular; a short remark or separate lemma clarifying the singular case would remove ambiguity.
  3. [§6] The final section lists open problems but does not indicate which of them are expected to be accessible with the new polynomial; a single sentence prioritizing the most immediate questions would help readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript, the assessment of its significance, and the recommendation of minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper's central step is an explicit definition: the observed rank-function expression for Euler genus of bouquets (an external graph-theoretic fact) is used to motivate and directly define an analogous polynomial on arbitrary square matrices over any field. All subsequent results—product formulas, recursion relations, degree and interpolation properties, and invariance under pivoting/inversion—are then verified algebraically from this definition. No equation reduces to itself by construction, no fitted parameter is relabeled as a prediction, and no load-bearing uniqueness theorem or ansatz is imported via self-citation. The derivation chain is therefore self-contained and non-circular.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on extending a rank observation from a special graph class to a general matrix definition; this introduces one new algebraic object whose properties are then explored.

axioms (1)
  • domain assumption Geometric duality and Petrie duality on cellularly embedded graphs generate the symmetric group S3.
    Invoked in the opening sentence as the origin of partial-twuality.
invented entities (1)
  • partial-twuality polynomial of a square matrix no independent evidence
    purpose: To serve as a universal algebraic counterpart to topological partial-twuality polynomials
    Defined by generalizing the rank expression for Euler genus; no independent evidence outside the paper is supplied in the abstract.

pith-pipeline@v0.9.0 · 5455 in / 1432 out tokens · 59504 ms · 2026-05-10T14:50:15.722673+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

34 extracted references · 34 canonical work pages

  1. [1]

    Abrams, J.A

    L. Abrams, J.A. Ellis-Monaghan, New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs, Combin. Probab. Comput.31 (2022) 574–597

    work page 2022

  2. [2]

    Alon, Combinatorial nullstellensatz,Combin

    N. Alon, Combinatorial nullstellensatz,Combin. Probab. Comput.8 (1999) 7–29. 34

    work page 1999

  3. [3]

    Arratia, B

    R. Arratia, B. Bollobás, G. Sorkin, The interlace polynomial of a graph, J. Combin. Theory Ser. B92 (2004) 199–233

    work page 2004

  4. [4]

    Bollobás, O

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

    work page 2002

  5. [5]

    Bouchet, Representability of∆-matroids, Combinatorics (Eger, 1987), Colloq

    A. Bouchet, Representability of∆-matroids, Combinatorics (Eger, 1987), Colloq. Math. Soc. János Bolyai, vol. 52, North-Holland, Amsterdam, 1988, 167–182

    work page 1987

  6. [6]

    Brahana, Systems of circuits on two-dimensional manifolds,Ann

    H.R. Brahana, Systems of circuits on two-dimensional manifolds,Ann. of Math. (2)23 (1921) 144–168

    work page 1921

  7. [7]

    Brijder, H.J

    R. Brijder, H.J. Hoogeboom, Nullity invariance for pivot and the interlace polynomial,Linear Algebra Appl.435 (2011) 277–288

    work page 2011

  8. [8]

    Brijder, H.J

    R. Brijder, H.J. Hoogeboom, The group structure of pivot and loop com- plementation on graphs and set systems,European J. Combin.32 (2011) 1353–1367

    work page 2011

  9. [9]

    Q. Chen, Y. Chen, Parallel edges in ribbon graphs and interpolating behavior of partial-duality polynomials,European J. Combin.102 (2022) 103492

    work page 2022

  10. [10]

    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

  11. [11]

    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. Combin. Theory Ser. B99 (2009) 617– 638

    work page 2009

  12. [12]

    Chmutov, Partial-dual genus polynomial as a weight system,Com- mun

    S. Chmutov, Partial-dual genus polynomial as a weight system,Com- mun. Math.31 (2023) 113–124

    work page 2023

  13. [13]

    Chmutov, I

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

    work page 2007

  14. [14]

    Chmutov, F

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

    work page 2021

  15. [15]

    Chmutov, J

    S. Chmutov, J. Voltz, Thistlethwaite’s theorem for virtual links,J. Knot Theory Ramifications17 (2008) 1189–1198. 35

    work page 2008

  16. [16]

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

    work page 2019

  17. [17]

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

    work page 2019

  18. [18]

    Q. Deng, F. Dong, X. Jin, Q. Yan, Partial-dual polynomial as a framed weight system,Commun. Math.31 (2023) 151–160

    work page 2023

  19. [19]

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

    work page 2025

  20. [20]

    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

  21. [21]

    Ellis-Monaghan, I

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

    work page 2013

  22. [22]

    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

  23. [23]

    Gross, T

    J.L. Gross, T. Mansour, T.W. Tucker, Partial duality for ribbon graphs, II: Partial-twuality polynomials and monodromy computations,European J. Combin.95 (2021) 103329

    work page 2021

  24. [24]

    Lando, On a Hopf algebra in graph theory,J

    S. Lando, On a Hopf algebra in graph theory,J. Combin. Theory Ser. B80 (2000) 104–121

    work page 2000

  25. [25]

    Li, A recursion for the twist polynomial of a one-point join of normal binary delta-matroids, arXiv:2511.09504v1, 2025

    C. Li, A recursion for the twist polynomial of a one-point join of normal binary delta-matroids, arXiv:2511.09504v1, 2025

    work page arXiv 2025

  26. [26]

    Lins, Graph-encoded maps,J

    S. Lins, Graph-encoded maps,J. Combin. Theory Ser. B32 (1982) 171– 181

    work page 1982

  27. [27]

    Moffatt, A characterization of partially dual graphs,J

    I. Moffatt, A characterization of partially dual graphs,J. Graph Theory 67 (2011) 198–217

    work page 2011

  28. [28]

    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., vol. 456, Cam- bridge Univ. Press, Cambridge (2019) 167–220. 36

    work page 2019

  29. [29]

    Tucker, A combinatorial equivalence of matrices, in: Combinato- rial Analysis, in: Proceedings of Symposia in Applied Mathematics, vol

    A.W. Tucker, A combinatorial equivalence of matrices, in: Combinato- rial Analysis, in: Proceedings of Symposia in Applied Mathematics, vol. X, American Mathematical Society, 1960, 129–140

    work page 1960

  30. [30]

    Wilson, Operators over regular maps,Pacific J

    S.E. Wilson, Operators over regular maps,Pacific J. Math.81 (1979) 559–568

    work page 1979

  31. [31]

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

    work page 2022

  32. [32]

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

    work page 2022

  33. [33]

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

    work page 2024

  34. [34]

    Q. Yan, Y. Li, Partial Petrial polynomials for complete graphs and paths,Discrete Appl. Math.375 (2025) 281–289. 37

    work page 2025