Related papers: Explicit Construction of Polytopes whose Ehrhart P…
The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…
The Hardy-Littlewood majorant problem has a positive answer only for expo- nents p which are even integers, while there are counterexamples for all p =2 2N. Montgomery conjectured that there exist counterexamples even among idempotent…
The {\em sign pattern} defined by the real polynomial $Q:=\Sigma _{j=0}^da_jx^j$, $a_j\neq 0$, is the string $\sigma (Q):=({\rm sgn(}a_d{\rm )},\ldots ,{\rm sgn(}a_0{\rm )})$. The quantities $pos$ and $neg$ of positive and negative roots of…
Counting lattice points and triangulating polytopes is a prominent subject in discrete geometry, yet proving Ehrhart positivity or existence of unimodular triangulations remain of utmost difficulty in general, even for ``easy'' simplices.…
The Hardy-Littlewood majorant problem was raised in the 30's and it can be formulated as the question whether $\int |f|^p\ge \int|g|^p$ whenever $\hat{f}\ge|\hat g|$. It has a positive answer only for exponents $p$ which are even integers.…
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…
For a lattice polytope P, define A_P(t) as the sum of the solid angles of all the integer points in the dilate tP. Ehrhart and Macdonald proved that A_P(t) is a polynomial in the positive integer variable t. We study the numerator…
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…
The famous Descartes' rule of signs from 1637 giving an upper bound on the number of positive roots of a real univariate polynomials in terms of the number of sign changes of its coefficients, has been an indispensable source of inspiration…
A polynomial $f(x)$ of degree $d$ is said to be magic positive if all the coefficients are non-negative when $f(x)$ is expanded with respect to the basis $\{x^i(x+1)^{d-i}\}_{i=0}^d$. It is known that if $f(x)$ is magic positive, then the…
Given a real univariate degree $d$ polynomial $P$, the numbers $pos_k$ and $neg_k$ of positive and negative roots of $P^{(k)}$, $k=0$, $\ldots$, $d-1$, must be admissible, i.e. they must satisfy certain inequalities resulting from Rolle's…
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…
In this paper, we investigate the solubility of homogeneous polynomial equations. The work of Browning, Le boudec, Sawin [3] shows that almost all homogeneous equations of degree $d\geq 4$ in $d+1$ or more variables satisfy the Hasse…
If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…
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…
Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…
The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…
Let $P(k,n)$ be the set of products of $k$ factors from the set $\{1,\ldots , n\}.$ In 1955, Erd\H{o}s posed the problem of determining the order of magnitude of $|P (2, n)|$ and proved that $|P (2, n)| = o(n^2 )$ for $n \to\infty$. In…
We show that when integral polytopes are deformed while keeping the same facet normal vectors, the coefficients of weighted Ehrhart and $h^*$-polynomials are piecewise polynomial functions in the ``right hand sides'' of the linear…
In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…