Related papers: Lattice points in vector-dilated polytopes

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

We study the Ehrhart theory of quadratic irrational polytopes that undergo vector dilations. That is, for a given polytope with vertices in $\mathbb{Q}(\sqrt{D})$, and a different dilation factor for each facet, we show that the leading…

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…

We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…

Given a finite set of vectors spanning a lattice and lying in a halfspace of a real vector space, to each vector $a$ in this vector space one can associate a polytope consisting of nonnegative linear combinations of the vectors in the set…

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

Let P be a convex polytope containing the origin, whose dual is a lattice polytope. Hibi's Palindromic Theorem tells us that if P is also a lattice polytope then the Ehrhart $\delta$-vector of P is palindromic. Perhaps less well-known is…

The $k$-tiling problem for a convex polytope $P$ is the problem of covering $\mathbb R^d$ with translates of $P$ using a discrete multiset $\Lambda$ of translation vectors, such that every point in $\mathbb R^d$ is covered exactly $k$…

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

This paper is to study the Ehrhart function $L(P,t)$ of a rational $n$-polytope $P$, defined as the number of lattice points of dilated polytopes $tP$ with real numbers $t\geq 0$. It turns out that $L(P,t)$ is a quasi-polynomial of real…

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…

Let $X$ be a list of vectors that is totally unimodular. In a previous article the author proved that every real-valued function on the set of interior lattice points of the zonotope defined by $X$ can be extended to a function on the whole…

We consider two sequences of orthogonal polynomials $(P_n)_{n\geq 0}$ and $(Q_n)_{n\geq 0}$ with respect regular functionals ${\bf u}$ and ${\bf v}$, respectively. We assume that $$\sum_{j=1} ^{M} a_{j,n}\mathrm{D}_x ^k P_{k+n-j}…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

We prove that, for fixed n there exist only finitely many embeddings of Q-factorial toric varieties X into P^n that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d…

We study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in…

Brion's Formula realizes the Laurent polynomial of lattice points in a lattice polytope P as the sum of rational functions associated to the vertices of P. In this paper, we consider the special case where P is a generalized permutohedron.…

The Minkowski length of a lattice polytope $P$ is a natural generalization of the lattice diameter of $P$. It can be defined as the largest number of lattice segments whose Minkowski sum is contained in $P$. The famous Ehrhart theorem…