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.
Let $p$ be an odd prime and let $H_{p^3}=\operatorname{UT}_3(\mathbb{F}_p)$ be the Heisenberg group of order $p^3$ and exponent $p$. We prove $\mathsf{d}(H_{p^3})=3p-3$. The main ingredient of the proof is an order-value growth theorem. If $B$ is a noncollinear zero-sum sequence of $n$ nonzero vectors in $\mathbb{F}_p^...
Let $R$ be a commutative ring and $f(a_1, \ldots, a_n) = \sum_{i=1}^k r_{i1}^{a_1} \cdots r_{in}^{a_n} m_i$ be a linear-exponential map over an $R$-module $M$. Dong and Shafrir (2026) showed that, when $\ell M = 0$ for some $\ell \in \mathbb{N}_{>0}$, the zero set of $f$ is the intersection of effectively computable $p...
For a fixed digraph $F$, let $\operatorname{ex}_2^+(n,F)$ be the maximum of $\sum_{v\in V(D)}d_D^+(v)^2$ over all $n$-vertex $F$-free digraphs. Ai et al. [arXiv:2606.03520, 2026] asked for which self-converse tournament $F$ one can determine $\operatorname{ex}_2^+(n,F)$. Let $TT_r$ denote a transitive tournament on $r$...
For a simple graph $G$ with $n$ vertices, write its chromatic polynomial in the rising factorial basis as $$ \chi_G(x)=\sum_{i=0}^{n}(-1)^{n-i}c_i(G)\langle x\rangle_i,$$ where $ \langle x\rangle_i=x(x+1)\cdots(x+i-1).$ The associated $\tau$-polynomial $$ \tau_G(x)=\sum_{i=0}^{n}c_i(G)x^i $$ was defined and systematica...
Ming-Yang Kang, Zhi-Xin Liu, Sophie C. C. Sun et al.· 0 citations
Let $P$ be a finite nonempty poset with $n$ elements, let $f:P\to\{1,\ldots,n\}$ be a uniformly random order-preserving bijection, and put $h_P(x)=\mathbb{E}[f(x)]$. Aires and Kahn (2025) introduced $\operatorname{gap}(P)$ as the largest difference between consecutive values in the ordered list consisting of $0$, $n+1$...
For a nonempty acyclic oriented graph $H$, let $p(H)$ be the order of a longest directed path and let $\tau(H)$ be the least positive integer $n$ such that $H$ admits a homomorphism to every tournament of order $n$. For all $p\ge3$ and $g\ge1$, we construct a connected acyclic oriented graph $H$ with underlying girth g...
Zhenhua Lyu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.