Related papers: A Shapley-Folkman lemma for lattice polytopes
Let $(X,T,\mu,d)$ be a metric measure-preserving system for which $3$-fold correlations decay exponentially for Lipschitz continuous observables. Suppose that $(M_k)$ is a sequence satisfying some weak decay conditions and suppose there…
We study the relation between the lattice points of a stacky polytope and a prequantisation of the stack associated to the stacky polytope. We introduce a prequantisation of a Deligne--Mumford stack and discuss the uniqueness and the…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
A univariate polynomial equation is presented. It provides models of the thermal lattice Boltzmann equation. The models can be accurate up to any required level and can be applied to regular lattices, which allow efficient and accurate…
We begin with a short exposition of the theory of lattice varieties. This includes a description of their orbit structure and smooth locus. We construct a flat cover of the lattice variety and show that it is a complete intersection. We…
In convex geometry, the Shapley-Folkman Lemma asserts that the nonconvexity of a Minkowski sum of $n$ dimensional bounded nonconvex sets does not accumulate once the number of summands exceeds the dimension $n$, and thus the sum becomes…
In this article we compare the set of integer points in the homothetic copy $n\Pi$ of a lattice polytope $\Pi\subseteq\R^d$ with the set of all sums $x_1+\cdots+x_n$ with $x_1,...,x_n\in \Pi\cap\Z^d$ and $n\in\N$. We give conditions on the…
We show that the Cappell-Shaneson version of Pick's theorem for simple lattice polytopes is a consequence of a general relation between characteristic numbers of virtual submanifolds dual to the characteristic classes of a stably almost…
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
A composition of birational maps given by Laurent polynomials need not be given by Laurent polynomials; however, sometimes---quite unexpectedly---it does. We suggest a unified treatment of this phenomenon, which covers a large class of…
We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will…
Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
Here we give a reformulation of a key lemma in the paper [2], "Spaces of Topological Complexity One", which is necessary due to an oversight.
We define and study the $(\nu / \lambda)$-partial alternating sign matrix polytope, motivated by connections to the Chan-Robbins-Yuen polytope and the $\nu$-Tamari lattice. We determine the inequality description and show this polytope is a…
The theory of polynomials orthogonal with respect to one inner product is classical. We discuss the extension of this theory to multiple inner products. Examples include the Lam\'e and Heine-Stieltjes polynomials.
Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…
We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…
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…