Related papers: Inequalities and Ehrhart $\delta$-Vectors

Let A be a subspace arrangement and let chi(A,t) be the characteristic polynomial of its intersection lattice L(A). We show that if the subspaces in A are taken from L(B_n), where B_n is the type B Weyl arrangement, then chi(A,t) counts a…

We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…

Matrix polynomials with unitary/doubly stochastic coefficients form the subject matter of this manuscript. We prove that if $P(\lambda)$ is a quadratic matrix polynomial whose coefficients are either unitary matrices or doubly stochastic…

We generalize a semi-norm for the Alexander polynomial of a connected, compact, oriented 3-manifold on its first cohomology group to a semi-norm for an arbitrary Laurent polynomial f on the dual vector space to the space of exponents of f.…

A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…

Lattice results, kinematical constraints and QCD dispersion relations are combined for the first time to derive model-independent bounds for QCD form factors and corresponding rates. To take into account the error bars on the lattice…

Let M be a rational homology sphere plumbed 3-manifold associated with a connected negative definite plumbing graph. We show that its Seiberg-Witten invariants equal certain coefficients of an equivariant multivariable Ehrhart polynomial.…

We give a combinatorial formula for the Ehrhart coefficients of a certain class of weighted multi-hypersimplices. In a special case, where these polytopes coincide with the base polytope of the panhandle matroid $\textrm{Pan}_{k,n-2,n}$, we…

The fractional stable set polytope ${\rm FRAC}(G)$ of a simple graph $G$ with $d$ vertices is a rational polytope that is the set of nonnegative vectors $(x_1,\ldots,x_d)$ satisfying $x_i+x_j\le 1$ for every edge $(i,j)$ of $G$. In this…

Let $A \in Z^{m \times n}$, $rank(A) = n$, $b \in Z^m$, and $P$ be an $n$-dimensional polyhedron, induced by the system $A x \leq b$. It is a known fact that if $F$ is a $k$-face of $P$, then there exist at least $n-k$ linearly independent…

We investigate generalizations of the Charlier and the Meixner polynomials on the lattice N and on the shifted lattice N+1-\beta. We combine both lattices to obtain the bi-lattice N \cup (N+1-\beta) and show that the orthogonal polynomials…

The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently,…

This article considers some q-analogues of classical results concerning the Ehrhart polynomials of Gorenstein polytopes, namely properties of their q-Ehrhart polynomial with respect to a good linear form. Another theme is a specific linear…

Consider a polynomial $f$ with a convenient Newton polytope $P$ and generic complex coefficients. By the global version of the Kouchnirenko formula, the hypersurface $\{f = 0\} \subset \mathbb{C}^n$ has the homotopy type of a bouquet of…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

The type A_n full root polytope is the convex hull in R^{n+1} of the origin and the points e_i-e_j for 1<= i<j <= n+1. Given a tree T on the vertex set [n+1], the associated root polytope P(T) is the intersection of the full root polytope…

Describing the equality conditions of the Alexandrov--Fenchel inequality has been a major open problem for decades. We prove that in the case of convex polytopes, this description is not in the polynomial hierarchy unless the polynomial…

Let $p$ be a polynomial in the non-commuting variables $(a,x)=(a_1,...,a_{g_a},x_1,...,x_{g_x})$. If $p$ is convex in the variables $x$, then $p$ has degree two in $x$ and moreover, $p$ has the form $p = L + \Lambda ^T \Lambda,$ where $L$…

In this paper we study polynomial maps of vector spaces and their eigenvectors and eigenvalues. The new quantity called complanart is defined. Complanarts determine complanarity of solution vectors of systems of polynomial equations.…

A comprehensive overview of lattice rules and polynomial lattice rules is given for function spaces based on $\ell_p$ semi-norms. Good lattice rules and polynomial lattice rules are defined as those obtaining worst-case errors bounded by…