Related papers: Ehrhart polynomials of matroid polytopes and polym…
A multivariate polynomial is stable if it is non-vanishing whenever all variables have positive imaginary parts. A matroid has the weak half-plane property (WHPP) if there exists a stable polynomial with support equal to the set of bases of…
For positive integers $m$ and $n$, the partial permutohedron $\mathcal{P}(m,n)$ is a certain integral polytope in $\mathbb{R}^m$, which can be defined as the convex hull of the vectors from $\{0,1,\ldots,n\}^m$ whose nonzero entries are…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…
We give a $K$-theoretic and geometric interpretation for a generalized weighted Ehrhart theory of a full-dimensional lattice polytope $P$, depending on a given homogeneous polynomial function $\varphi$ on $P$, and with Laurent polynomial…
We give a new definition of lattice-face polytopes by removing an unnecessary restriction in the paper "Ehrhart polynomials of lattice-face polytopes", and show that with the new definition, the Ehrhart polynomial of a lattice-face polytope…
There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…
We introduce the definition of an Ehrhart limit, that is, a formal power series with integer coefficients that is the limit in the ring of formal power series of a sequence of Ehrhart $h^*$-polynomials. We identify a variety of examples of…
Equivariant Ehrhart theory enumerates the lattice points in a polytope with respect to a group action. Answering a question of Stapledon, we describe the equivariant Ehrhart theory of the permutahedron, and we prove his Effectiveness…
In this paper, we provide an overview of Ehrhart polynomials associated with order polytopes of finite posets, a concept first introduced by Stanley. We focus on their combinatorial interpretations for many sequences listed on the OEIS. We…
We introduce thagomizer matroids and compute the Kazhdan-Lusztig polynomial of a rank $n+1$ thagomizer matroid by showing that the coefficient of $t^k$ is equal to the number of Dyck paths of semilength $n$ with $k$ long ascents. We also…
We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a…
For an $n$-dimensional lattice simplex $\Delta_{(1,\mathbf{q})}$ with vertices given by the standard basis vectors and $-\mathbf{q}$ where $\mathbf{q}$ has positive entries, we investigate when the Ehrhart $h^*$-polynomial for…
The conjecture on roots of Ehrhart polynomials, stated by Matsui et al. \cite[Conjecture 4.10]{MHNOH}, says that all roots $\alpha$ of the Ehrhart polynomial of a Gorenstein Fano polytope of dimension $d$ satisfy $-\frac{d}{2} \leq…
Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
For a class of orthogonal polynomials related to the $q$-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal…
We prove that all lattice path matroids are Ehrhart positive. This unifies and generalizes numerous results on the Ehrhart positivity of matroids developed over the last two decades. We rely on our previous work on the positivity of order…
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…
In this paper, we give a new axioms system based on nonseparable flats with their ranks to define a matroid. We deduce a polynomial time algorithm for deciding if a given matroid (respectively, arbitrary structure) is an uniform matroid.…