Related papers: Ehrhart polynomial and Successive Minima

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…

We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…

New bispectral polynomials orthogonal on a quadratic bi-lattice are obtained from a truncation of Wilson polynomials. Recurrence relation and difference equation are provided. The recurrence coefficients can be encoded in a perturbed…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Alcoved polytopes are convex polytopes, which are the closure of a union of alcoves in an affine Coxeter arrangement. They are rational polytopes and, therefore, have Ehrhart quasipolynomials. Here we describe a method for computing the…

We give bounds on the successive minima of an $o$-symmetric convex body under the restriction that the lattice points realizing the successive minima are not contained in a collection of forbidden sublattices. Our investigations extend…

We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…

We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest…

Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…

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…

We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…

In this article Ehrhart quasi-polynomials of simplices are employed to determine isospectral lens spaces in terms of a finite set of numbers. Using the natural lattice associated with a lens space the associated toric variety of a lens…

We study asymptotic clustering of zeros of random polynomials, and show that the expected discrepancy of roots of a polynomial of degree $n$, with not necessarily independent coefficients, decays like $\sqrt{\log n/n}$. Our proofs rely on…

We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…

The Lecture Hall cone is a simplicial cone whose lattice points naturally correspond to Lecture Hall partitions. The celebrated Lecture Hall Theorem of Bousquet-M\'elou and Eriksson states that a particular specialization of its…

We prove expressions for the inequalities in Hermite's theorem which are conditions for a real polynomial to have real zeros. These expressions generalize the discriminant of a quadratic polynomial and the expression of J. Mar\'ik for a…

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,…

The Eulerian polynomials and derangement polynomials are two well-studied generating functions that frequently arise in combinatorics, algebra, and geometry. When one makes an appearance, the other often does so as well, and their…

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

The Ehrhart polynomial $\text{ehr}_P(n)$ of a lattice polytope $P$ counts the number of integer points in the $n$-th integral dilate of $P$. The $f^*$-vector of $P$, introduced by Felix Breuer in 2012, is the vector of coefficients of…