Partial-twuality polynomial interpolation for binary delta-matroids

Abstract

Gross, Mansour and Tucker introduced the partial-twuality polynomials for ribbon graphs and investigated the interpolation property of these polynomials. The ribbon group generated by δ and τ acts on set systems as twist and loop complementation ×, yielding five nontrivial twuality operators: \,×,× ,× ,× \. Yan and Jin extended partial-twuality polynomials to set systems, yielding partial- polynomials with ∈\,×,× ,× ,×\. For partial- polynomials, Zhao and Yan proved that this polynomial is either even, odd, or both even-interpolating and odd-interpolating for every binary delta-matroid. In this paper, we extend this interpolation property to all the remaining nontrivial partial-twualities of binary delta-matroids. Consequently, for every binary delta-matroid and every ∈\,×, × ,× , × \, the partial- polynomial is either even, odd, or both even-interpolating and odd-interpolating. We also provide examples to show that the binary assumption is essential.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…