Related papers: Computing parametric weighted Ehrhart polynomials …
Let $\mathcal{A}$ be a Weyl arrangement. We introduce and study the notion of $\mathcal{A}$-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of $\mathcal{A}$. This polynomial together with shift operator…
It is well-known that every non-negative univariate real polynomial can be written as the sum of two polynomial squares with real coefficients. When one allows a weighted sum of finitely many squares instead of a sum of two squares, then…
We consider orthogonal polynomials on the unit circle with respect to a weight which is a quotient of $q$-gamma functions. We show that the Verblunsky coefficients of these polynomials satisfy discrete Painlev\'e equations, in a Lax form,…
A generic orthotope is an orthogonal polytope whose tangent cones are described by read-once Boolean functions. The purpose of this note is to develop a theory ofEhrhart polynomials for integral generic orthotopes. The most remarkable part…
Laguerre and Laguerre-type polynomials are orthogonal polynomials on the interval $[0,\infty)$ with respect to a weight function of the form $w(x) = x^{\alpha} e^{-Q(x)}, Q(x) = \sum_{k=0}^m q_k x^k, \alpha > -1, q_m > 0$. The classical…
We study a class of bivariate deformed Hermite polynomials and some of their properties using classical analytic techniques and the Wigner map. We also prove the positivity of certain determinants formed by the deformed polynomials. Along…
We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…
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 prove a sharp H\"older estimate for solutions of linear two-dimensional, divergence form elliptic equations with measurable coefficients, such that the matrix of the coefficients is symmetric and has {\em unit determinant}. Our result…
We develop a numerical method for computing with orthogonal polynomials that are orthogonal on multiple, disjoint intervals for which analytical formulae are currently unknown. Our approach exploits the Fokas--Its--Kitaev Riemann--Hilbert…
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…
Ehrhart polynomials are extensively-studied structures that interpolate the discrete volume of the dilations of integral $n$-polytopes. The coefficients of Ehrhart polynomials, however, are still not fully understood, and it is not known…
We compute explicitly the equivariant Hirzebruch $\chi_y$-characteristic of an equivariant complex line bundle over a toric manifold and state a weighted version of the quantization commutes with reduction principle in symplectic geometry.…
V. Golyshev conjectured that for any smooth polytope P of dimension at most five, the roots $z\in\C$ of the Ehrhart polynomial for P have real part equal to -1/2. An elementary proof is given, and in each dimension the roots are described…
We give a cohomological and geometrical interpretation for the weighted Ehrhart theory of a full-dimensional lattice polytope $P$, with Laurent polynomial weights of geometric origin. For this purpose, we calculate the motivic Chern and…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Let $\mu$ be a non-trivial probability measure on the unit circle $\partial\bbD$, $w$ the density of its absolutely continuous part, $\alpha_n$ its Verblunsky coefficients, and $\Phi_n$ its monic orthogonal polynomials. In this paper we…
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 present lower bounds for the coefficients of Ehrhart polynomials of convex lattice polytopes in terms of their volume. Concerning the coefficients of the Ehrhart series of a lattice polytope we show that Hibi's lower bound is not true…
Motivated by representation theory and geometry, we introduce and develop an equivariant generalization of Ehrhart theory, the study of lattice points in dilations of lattice polytopes. We prove representation-theoretic analogues of…