Roots of the Ehrhart polynomial of hypersimplices
Abstract
The Ehrhart polynomial of the d-th hypersimplex (d,n) of order n is studied. By computational experiments and a known result for d=2, we conjecture that the real part of every roots of the Ehrhart polynomial of (d,n) is negative and larger than - nd if n ≥ 2d. In this paper, we show that the conjecture is true when d=3 and that every root a of the Ehrhart polynomial of (d,n) satisfies -nd < Re (a) < 1 if 4 ≤ d n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.