Related papers: The Integer Decomposition Property and Weighted Pr…
A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…
For each integer partition $\mathbf{q}$ with $d$ parts, we denote by $\Delta_{(1,\mathbf{q})}$ the lattice simplex obtained as the convex hull in $\mathbb{R}^d$ of the standard basis vectors along with the vector $-\mathbf{q}$. For…
Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…
Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest. In the present paper, by virtue of the algebraic technique on…
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…
We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…
We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive…
Let $\mathcal{P} \subset \mathbb{R}^N$ be an integral convex polytope of dimension $d$ and write $k \mathcal{P}$, where $k = 1, 2, \ldots$, for dilations of $\mathcal{P}$. We say that $\mathcal{P}$ possesses the integer decomposition…
We show that, if $M$ is a subspace lattice with the property that the rank one subspace of its operator algebra is weak* dense, $L$ is a commutative subspace lattice and $P$ is the lattice of all projections on a separable infinite…
The family of lattice simplices in $\mathbb{R}^n$ formed by the convex hull of the standard basis vectors together with a weakly decreasing vector of negative integers include simplices that play a central role in problems in enumerative…
There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…
We study the integer decomposition property of lattice polytopes associated with the $n$-dimensional smooth complete fans with at most $n+3$ rays. Using the classification of smooth complete fans by Kleinschmidt and Batyrev and a reduction…
We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…
The Ehrhart function $L_P(t)$ of a polytope $P$ is usually defined only for integer dilation arguments $t$. By allowing arbitrary real numbers as arguments we may also detect integer points entering (or leaving) the polytope in fractional…
Lattice polytopes are called IDP polytopes if they have the integer decomposition property, i.e., any lattice point in a $k$th dilation is a sum of $k$ lattice points in the polytope. It is a long-standing conjecture whether the numerator…
We show that, on convex polytopes and two or three dimensions, the finite element Stokes projection is stable on weighted spaces $\mathbf{W}^{1,p}_0(\omega,\Omega) \times L^p(\omega,\Omega)$, where the weight belongs to a certain…
An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal $h^*$-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider…
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,…
We associate to a finite digraph $D$ a lattice polytope $P_D$ whose vertices are the rows of the Laplacian matrix of $D$. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem,…
We present a general classification algorithm for reflexive simplices, which allows us to determine all reflexive simplices in dimensions five and six. In terms of algebraic geometry this means that we classify the Gorenstein fake weighted…