Search arXivSearch

arXiv · 2503.06095

Coefficients of univariate Tutte polynomials with one variable fixed

Abstract

It is well known that the 2-variable Tutte polynomial of a graph $G$ includes chromatic polynomial and flow polynomial of $G$, i.e. the cases of $y=0$ and $x=0$. In 2013, Kálmán introduced the interior and exterior polynomials which generalized the cases of $y=1$ and $x=1$ of Tutte polynomials of graphs to hypergraphs, and further polymatroids. There have been some results on coefficients of these polynomials, which motivate us to study uniformly the coefficients of $T_M(x,t)$ and $T_M(t,y)$, where $T_M(x,y)$ denotes the Tutte polynomial of a matroid $M$ and $t$ is a fixed real number. In this paper, we introduce two mutually dual parameters $f_k(M)$ and $g_k(M)$ ($g_1(M)$ is the girth of $M$) for any nonnegative integer $k$, and obtain the following results: (1) Formulas for coefficients of the higher-degree terms (related to $g_2(M)$ and $f_2(M)$, respectively) of $T_M(x,t)$ and $T_M(t,y)$ in terms of circuits and hyperplanes of $M$; (2) when $0\leq t \leq 1$, coefficients of the more higher-degree terms (related to $g_1(M)$ and $f_1(M)$, respectively) of $T_M(x,t)$ and $T_M(t,y)$ are further simplified and characterized; (3) As applications, some known results in the cases $t=0$ and $t=1$ are derived and generalized, and the unimodality of these coefficients in (1) are proved when $t\leq 1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tianlong Ma, Xiaxia Guan, Xian'an Jin, Hong-Jian Lai. 2026-06-21. Coefficients of univariate Tutte polynomials with one variable fixed. https://arxiv.org/abs/2503.06095

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