Related papers: Weighted Ehrhart Theory: Extending Stanley's nonne…

We consider versions of the Penrose singularity theorem and the Hawking horizon topology theorem in weighted spacetimes that contain weighted versions of trapped surfaces, for arbitrary spacetime dimension and synthetic dimension. We find…

A classical fact in ergodic theory is that ergodicity is equivalent to almost everywhere divergence of ergodic sums of all nonnegative integrable functions which are not identically zero. We show two methods, one in the measure preserving…

The famous Bernstein conjecture about optimal node systems in classical polynomial Lagrange interpolation, standing unresolved for about half a century, was solved by T. Kilgore in 1978. Immediately following him, also the additional…

We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…

We generalise Milnor-Thurston's kneading theory to the setting of piecewise continuous and monotone interval maps with weights. We define a weighted kneading determinant ${\cal D}(t)$ and establish combinatorially two kneading identities,…

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

We prove that for any generic polynomial $f$ in two variables of degree $(d_1,d_2)$ over the rationals, for $p$ large enough the Newton slopes of the character power series $C_f^*(\chi_m,s)$ of $f$ at $p$ is independent of the choice of the…

We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

We establish Liouville type theorems for elliptic systems with various classes of non-linearities on $\mathbb{R}^N$. We show among other things, that a system has no semi-stable solution in any dimension, whenever the infimum of the…

Nicaise--Ottem introduced the notion of (stably) rational polytopes and studied this using a combinatorial description of the motivic volume. In this framework, we ask whether being non-stably rational is preserved under inclusions. We…

Given a rational polytope $P \subset \mathbb R^d$, the numerical function counting lattice points in the integral dilations of $P$ is known to become a quasi-polynomial, called the Ehrhart quasi-polynomial $\mathrm{ehr}_P$ of $P$. In this…

We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…

Let $E_k$ be the normalized Eisenstein series of weight $k$ on $\mathrm{SL}_{2}(\mathbb{Z})$. Let $\varphi_k$ be the polynomial that encodes the $j$-invariants of non-elliptic zeros of $E_k$. In 2001, Gekeler observed that the polynomials…

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…

Demazure characters, also known as key polynomials, generalize the classical Schur polynomials. In particular, when all variables are set equal to $1$, these polynomials count the number of integer points in a certain class of…

We consider the large-$N$ asymptotics of a system of discrete orthogonal polynomials on an infinite regular lattice of mesh $\frac{1}{N}$, with weight $e^{-NV(x)}$, where $V(x)$ is a real analytic function with sufficient growth at…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…