Search arXivSearch

arXiv · 2606.22888

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 $\ast$ and loop complementation $\times$, yielding five nontrivial twuality operators: $ \{\ast,\times,\ast\times ,\times\ast ,\ast\times\ast \}.$ Yan and Jin extended partial-twuality polynomials to set systems, yielding partial-$\bullet$ polynomials with $\bullet\in\{\ast,\times,\ast\times ,\times\ast ,\ast\times\ast\}.$ For partial-$\ast$ 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 $\bullet\in\{\ast,\times,\ast \times ,\times\ast ,\ast \times \ast \}$, the partial-$\bullet$ polynomial is either even, odd, or both even-interpolating and odd-interpolating. We also provide examples to show that the binary assumption is essential.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhuo Li, Qi Yan, Xian'an Jin. 2026-06-22. Partial-twuality polynomial interpolation for binary delta-matroids. https://arxiv.org/abs/2606.22888

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO