Related papers: A Shapley-Folkman lemma for lattice polytopes

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$…

We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear transformation mapping L_1 to L_2. Our main result is an algorithm for this problem…

We prove a sharp version of the Hopf boundary point lemma for Black-Scholes type equations. We also investigate the existence and the regularity of the spatial derivative of the solutions at the spatial boundary.

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

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 are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…

We investigate generalizations of the Charlier polynomials on the lattice $\mathbb{N}$, on the shifted lattice $\mathbb{N}+1-\beta$ and on the bi-lattice $\mathbb{N}\cup (\mathbb{N}+1-\beta)$. We show that the coefficients of the three-term…

We state and prove a Lemma in 1 variable Calculus, that justifies some arguments previously used to ilustrate non-uniqueness of some generalized physical quantities.

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of course, combinatorics. In this article, we review several classes of polytopes that do have unimodular…

We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…

By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…

The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…

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…

Using the theory of Kostka polynomials, we prove an A_{n-1} version of Bailey's lemma at integral level. Exploiting a new, conjectural expansion for Kostka numbers, this is then generalized to fractional levels, leading to a new expression…

We classify general square systems of polynomial equations solvable in radicals. Expectedly, they are almost in a 1-to-1 correspondence with tuples of lattice polytopes of mixed volume not exceeding 4. The proof is based on the computation…

We consider "odd symplectic Lie algebras" defined in terms of maximal rank skew-symmetric forms. We provide FFLV polytopes for these algebras and prove their standard properties. In particular, we obtain a new graded character formula and…

An explicit description of a multidimensional Stokes phenomenon for a Gelfand-Kapranov-Zelevinsky system associated with a lattice of rank one is given.