Related papers: Tensor valuations on lattice polytopes
A complete classification of unimodular valuations on the set of lattice polygons with values in the spaces of polynomials and formal power series, respectively, is established. The valuations are classified in terms of their behaviour with…
The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…
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…
We use the residue theorem to derive an expression for the number of lattice oints in a dilated n-dimensional tetrahedron with vertices at lattice points on each coordinate axis and the origin. This expression is known as the Ehrhart…
Ehrhart theory is the study of the enumeration of lattice points in lattice polytopes. Equivariant Ehrhart theory is a generalization of Ehrhart theory that takes into account the action of a finite group acting via affine transformations…
Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…
We introduce the notion of a weighted $\delta$-vector of a lattice polytope. Although the definition is motivated by motivic integration, we study weighted $\delta$-vectors from a combinatorial perspective. We present a version of Ehrhart…
Equivariant Ehrhart theory generalizes the study of lattice point enumeration to also account for the symmetries of a polytope under a linear group action. We present a catalogue of techniques with applications in this field, including…
We introduce the notion of combinatorial positivity of translation-invariant valuations on convex polytopes that extends the nonnegativity of Ehrhart h*-vectors. We give a surprisingly simple characterization of combinatorially positive…
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…
We introduce a powerful connection between Ehrhart theory and additive number theory, and use it to produce infinitely many new classes of inequalities between the coefficients of the $h^*$-polynomial of a lattice polytope. This greatly…
In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…
We classify translatively exponential and GL(2,Z) covariant valuations on lattice polygons valued at measurable real functions. A typical example of such valuations is induced by the Laplace transform, but as it turns out there are many…
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…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
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,…
For a given lattice polytope, two fundamental problems within the field of Ehrhart theory are to (1) determine if its (Ehrhart) $h^\ast$-polynomial is unimodal and (2) to determine if its Ehrhart polynomial has only positive coefficients.…
One considers weighted sums over points of lattice polytopes, where the weight of a point v is the monomial q^f(v) for some linear form f. One proposes a q-analogue of the classical theory of Ehrhart series and Ehrhart polynomials,…
Finding the rank of a tensor is a problem that has many applications. Unfortunately it is often very difficult to determine the rank of a given tensor. Inspired by the heuristics of convex relaxation, we consider the nuclear norm instead of…