English

The Sign Pattern Problem for Ehrhart Polynomials

Combinatorics 2025-12-01 v2

Abstract

We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the rr-th pyramid over the Reeve tetrahedron and the hypercube [0,n]n[0, n]^n. This investigation yields partial results on the sign pattern problem for Ehrhart polynomials. Moreover, we show that for each dimension d4d \geq 4, there exists a dd-dimensional integral polytope P\mathcal{P} such that arbitrarily many of the low-degree coefficients in the Ehrhart polynomial i(P,t)i(\mathcal{P}, t) are negative, while all higher-degree coefficients are positive. Finally, we establish five embedding theorems that enable the sign pattern of a lower-dimensional integral polytope to be embedded into a higher-dimensional integral polytope in various ways. As an application, we completely resolve the Ehrhart coefficient sign pattern problem for dimensions d=7,8,9d = 7, 8, 9.

Keywords

Cite

@article{arxiv.2509.17714,
  title  = {The Sign Pattern Problem for Ehrhart Polynomials},
  author = {Feihu Liu and Sihao Tao and Guoce Xin},
  journal= {arXiv preprint arXiv:2509.17714},
  year   = {2025}
}

Comments

24 pages

R2 v1 2026-07-01T05:49:29.739Z