Search arXivSearch

arXiv · 2609.25863

Exact Ehrhart Series of Birkhoff Polytopes via Constant Terms and Finite-Field Evaluation

Abstract

The Ehrhart series of the $n$th Birkhoff polytope is $\sum_{r\geq0}H_n(r)z^r$, where $H_n(r)$ counts nonnegative integer $n\times n$ matrices whose row and column sums all equal $r$. We present an exact method for computing this series using constant terms and finite fields. A root filter expresses $H_n(r)$ as a weighted sum of the values $h_r(M)^n$, where $h_r$ is the complete homogeneous symmetric polynomial and $M$ ranges over multisets of $m$th roots of unity with $m=r+1$. Constant-term cancellation reduces the evaluation of $h_r(M)$ to a sum over repeated elements $a$ of $M$. For a particular $a$ of multiplicity $μ_a$, the computation uses a generalized Todd coefficient of degree $μ_a-2$. Sums of $h_r(M)^n$ over selected multiplicity classes are handled using symmetric function techniques. Together with the remaining individual evaluations, this gives $O_n(m^{n-5}+m^4)$ field operations for each admissible prime and fixed $n\geq5$. An explicit bound and the Chinese remainder theorem recover the integer counts, and Ehrhart symmetry determines the full series. The same method applies to the World Cup problem, which counts the same matrices with diagonal entries required to be $0$. We prove correctness and compute complete series for both families through order $12$. The Birkhoff series for orders $10$--$12$ and the World Cup series for orders $9$--$12$ are tabulated in the appendices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xinru Jiang, Guoce Xin, Chen Zhang, Yueming Zhong. 2026-09-22. Exact Ehrhart Series of Birkhoff Polytopes via Constant Terms and Finite-Field Evaluation. https://arxiv.org/abs/2609.25863

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO