Lattice slices, Ehrhart polynomials, and magic positivity of generalized parking-function polytopes
Abstract
For $\mathbf{b}=(b_1,\dots,b_n)\in\mathbb{Z}_{>0}^n$, a $\mathbf{b}$-parking function is a sequence $(\beta_1,\dots,\beta_n)$ of positive integers whose nondecreasing rearrangement $\beta_1'\le\beta_2'\le\cdots\le\beta_n'$ satisfies $\beta_i'\le b_1+\cdots+b_i$.
The $\mathbf{b}$-parking-function polytope $\mathfrak{X}_n(\mathbf{b})$ is the convex hull of all $\mathbf{b}$-parking functions of length $n$ in $\mathbb{R}^n$.
We prove that every lattice slice of $\mathfrak{X}_n(\mathbf{b})$, obtained by fixing one coordinate at an integer value, is itself a $\mathbf{b}'$-parking-function polytope of one dimension less, with an explicit parameter vector $\mathbf{b}'$; this yields a recursion for the number of lattice points of $\mathfrak{X}_n(\mathbf{b})$.
We further show that every dilate of a $\mathbf{b}$-parking-function polytope is a translate of another such polytope, that the number of lattice points is a polynomial function of $\mathbf{b}$, and we deduce an explicit formula for the Ehrhart polynomial of $\mathfrak{X}_n(\mathbf{b})$ for arbitrary $\mathbf{b}$ as a finite sum indexed by draconian sequences, resolving a problem of Hanada, Lentfer, and Vindas-Meléndez; an equivalent formula was recently obtained, independently, by Liu and Thawinrak in a closely related setting.
In the special case $\mathbf{b}=(a,b,\dots,b)$, we obtain an explicit closed form and a generating function for the Ehrhart polynomial.
As an application, we classify magic positivity in the two-parameter family $\mathfrak{X}_n(a,b)=\mathfrak{X}_n(a,b,\dots,b)$: the polytope $\mathfrak{X}_n(a,b)$ is magic positive if and only if $(n,a,b)\ne(2,1,1)$.
Thus, we answer a problem posed by Ferroni and Higashitani for $\mathfrak{X}_n(a,b)$.
Our result extends recent work of Liu and Zhang on partial permutahedra and leads us to conjecture that magic positivity holds for every $\mathfrak{X}_n(\mathbf{b})$ with $n\ge3$.
이 뉴스, 어떠셨어요?
탭 한 번으로 반응 · 로그인 불필요