Search arXivSearch

arXiv · 2602.10646

Equivariant Kazhdan--Lusztig Polynomials of Thagomizer Matroids with a Hyperoctahedral Group Action

Abstract

The thagomizer matroid, realized as the graphic matroid of the complete tripartite graph $K_{1,1,n}$, has full automorphism group isomorphic to the hyperoctahedral group whenever $n \ge 2$. In the equivariant setting for this action, we compute both the Kazhdan--Lusztig polynomial and the inverse Kazhdan--Lusztig polynomial in the sense of Proudfoot's Kazhdan--Lusztig--Stanley theory, and we show that each coefficient is an honest representation with a multiplicity-free irreducible decomposition. Our main idea is to exploit the palindromicity of the equivariant $Z$-polynomial, reducing the computation to the already established symmetric-group equivariant Kazhdan--Lusztig theory for the graphic matroids of cycle graphs, and then to apply Proudfoot's equivariant Kazhdan--Lusztig--Stanley inversion identity to obtain the inverse polynomial. Passing to dimensions recovers the previously known nonequivariant thagomizer polynomials, while the coefficient formulas admit a natural expression in terms of the wreath product Frobenius characteristic for the hyperoctahedral group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew H. Y. Xie, Philip B. Zhang, Michael X. X. Zhong. 2026-02-11. Equivariant Kazhdan--Lusztig Polynomials of Thagomizer Matroids with a Hyperoctahedral Group Action. https://arxiv.org/abs/2602.10646

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