Search arXivSearch

arXiv · 2601.17314

Equivariant inverse $Z$-polynomials of matroids

Abstract

Motivated by the notion of the inverse $Z$-polynomial introduced by Ferroni, Matherne, Stevens, and Vecchi, we study the equivariant inverse $Z$-polynomial of a matroid equipped with a finite group. We prove that the coefficients of the equivariant inverse $Z$-polynomials are honest representations and that these polynomials are palindromic. Explicit formulas are obtained for uniform matroids equipped with the symmetric group. The corresponding formulas for $q$-niform matroids are derived using the Comparison Theorem for unipotent representations. For arbitrary equivariant paving matroids, explicit expressions are obtained by relating the polynomials of a matroid to those of its relaxation. We show that these polynomials are equivariantly unimodal and strongly inductively log-concave for both uniform and $q$-niform matroids. Motivated by the properties of equivariant $Z$-polynomials, we conjecture that the coefficients of the equivariant inverse $Z$-polynomials are equivariantly unimodal and strongly equivariantly log-concave.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alice L. L. Gao, Yun Li, Matthew H. Y. Xie. 2026-01-24. Equivariant inverse $Z$-polynomials of matroids. https://arxiv.org/abs/2601.17314

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO