Search arXivSearch

arXiv · 2607.02740

Monotone maximum partial-twuality widths of vf-safe delta-matroids

Abstract

For a delta-matroid, the maximum twist width theorem states that the maximum width over all twists can be reached along a non-decreasing sequence of intermediate twist widths. In this paper we study analogous monotone maximum width sequences for partial twualities generated by twist and loop complementation. We prove that, for each non-twist partial-twuality operation on a vf-safe delta-matroid, there exists a subset attaining the corresponding maximum partial-twuality width whose elements can be ordered so that the successive intermediate widths are non-decreasing. Together with the known twist case, this gives a monotone maximum width theorem for all five nontrivial partial-twuality operations on vf-safe delta-matroids. We also prove feasible-set attainment results for the operations $\ast\times$ and $\ast\times\ast$. Finally, we translate these results to ribbon graphs, obtaining monotone sequences for maximum partial-twuality Euler genera and spanning quasi-tree attainment results for the corresponding ribbon graph operations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Qi Yan, Zhao Zhao. 2026-07-02. Monotone maximum partial-twuality widths of vf-safe delta-matroids. https://arxiv.org/abs/2607.02740

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