Papers
Topics
Authors
Recent
Search
2000 character limit reached

Roots of the Ehrhart polynomial of hypersimplices

Published 29 Apr 2013 in math.CO | (1304.7587v2)

Abstract: The Ehrhart polynomial of the $d$-th hypersimplex $\Delta(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 $\Delta(d,n)$ is negative and larger than $- \frac{n}{d}$ if $n \geq 2d$. In this paper, we show that the conjecture is true when $d=3$ and that every root $a$ of the Ehrhart polynomial of $\Delta(d,n)$ satisfies $-\frac{n}{d} < {\rm Re} (a) < 1$ if $4 \leq d \ll n$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.