Search arXivSearch

arXiv · 2609.06096

Ehrhart $h^*$-polynomials of $(132,213)$-avoiding permutation polytopes: A repair cone and eventual real-rootedness

Abstract

Let $P_d(132,213)$ be the convex hull of the permutations in $S_d$ that avoid $132$ and $213$, and let $H_d(t)$ be its Ehrhart $h^*$-polynomial, defined by $\sum_{m\ge0}|mP_d(132,213)\cap\mathbb{Z}^d|t^m=\frac{H_d(t)}{(1-t)^d}$. We give an explicit lattice equivalence between this polytope, a path-Laplacian deficit polytope, and twice a translated chain-poset permutahedron. The resulting face description and triangulation give a self-contained proof of Davis and Sagan's cubicality and volume conjecture, with normalized volume $2^{d-1}d^{d-3}$ for $d\ge2$. For $d\ge3$, the coefficient of $t^{d-1}$ in $H_d(t)$ counts strong tournament score sequences. The refined Eulerian expansion of $H_d(t)$ has a negative coordinate already at $d=7$. We construct a compatible cone of adjacent signed differences that accommodates this obstruction. Its largest uniform repair parameter is $2-\sqrt{3}$, and membership reduces to explicit geometric-tail inequalities. An exact dataset and reconstruction algorithm verify these inequalities through $d=1000$. A marked-component identity, discrete smoothing, and Darroch's mode theorem (Ann. Math. Statist. 35 (1964), 1317--1321, Theorem 4) prove them for every $d\ge2^{72}$. Thus $H_d(t)$ has only negative real zeros for $3\le d\le1000$ and for $d\ge2^{72}$, while $H_1(t)=H_2(t)=1$. Uniform real-rootedness in the intervening range remains open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pedro M. M. de Castro. 2026-09-05. Ehrhart $h^*$-polynomials of $(132,213)$-avoiding permutation polytopes: A repair cone and eventual real-rootedness. https://arxiv.org/abs/2609.06096

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