Related papers: The Minimum Period of the Ehrhart Quasi-polynomial…

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…

A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Let $P_{\lambda\Sigma_n}$ be the Ehrhart polynomial associated to an intergal multiple $\lambda$ of the standard symplex $\Sigma_n \subset \mathbb{R}^n$. In this paper we prove that if $(M, L)$ is an $n$-dimensional polarized toric manifold…

Let $S=\{x^2+c_1, x^2+c_2,\dots, x^2+c_s\}$ be a set of quadratic polynomials with rational coefficients, and let $P$ be a rational basepoint. We classify the pairs $(S,P)$ for which $P$ has finite orbit for $S$, assuming that the maximum…

We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…

Every equivelar abstract polytope of type $\{p_1, \ldots, p_{n-1}\}$ has at least $2p_1 \cdots p_{n-1}$ flags. Polytopes that attain this lower bound are called tight. Here we investigate the question of under what conditions there is a…

We introduce the definition of an Ehrhart limit, that is, a formal power series with integer coefficients that is the limit in the ring of formal power series of a sequence of Ehrhart $h^*$-polynomials. We identify a variety of examples of…

Let $S$ be a compact infinite set in the complex plane with $0\notin{S}$, and let $R_n$ be the minimal residual polynomial on $S$, i.e., the minimal polynomial of degree at most $n$ on $S$ with respect to the supremum norm provided that…

We present an algorithm for growing the denominator $r$ polygons containing a fixed number of lattice points and enumerate such polygons containing few lattice points for small $r$. We describe the Ehrhart quasi-polynomial of a rational…

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

We provide a formula for the Ehrhart polynomial of the connected matroid of size $n$ and rank $k$ with the least number of bases, also known as a minimal matroid. We prove that their polytopes are Ehrhart positive and $h^*$-real-rooted (and…

This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…

Every polynomial $P(X)\in \mathbb Z[X]$ satisfies the congruences $P(n+m)\equiv P(n) \mod m$ for all integers $n, m\ge 0$. An integer valued sequence $(a_n)_{n\ge 0}$ is called a pseudo-polynomial when it satisfies these congruences. Hall…

We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the…

The type A_n full root polytope is the convex hull in R^{n+1} of the origin and the points e_i-e_j for 1<= i<j <= n+1. Given a tree T on the vertex set [n+1], the associated root polytope P(T) is the intersection of the full root polytope…

The Euclidean Steiner Minimal Tree problem takes as input a set $\mathcal P$ of points in the Euclidean plane and finds the minimum length network interconnecting all the points of $\mathcal P$. In this paper, in continuation to the works…

Let $p$ be a homogeneous polynomial of degree $n$ in $n$ variables, $p(z_1,...,z_n) = p(Z)$, $Z \in C^{n}$. We call such a polynomial $p$ {\bf H-Stable} if $p(z_1,...,z_n) \neq 0$ provided the real parts $Re(z_i) > 0, 1 \leq i \leq n$. This…

A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…

The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…