English
Related papers

Related papers: Interlacing Ehrhart Polynomials of Reflexive Polyt…

200 papers

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…

Combinatorics · Mathematics 2014-12-05 Alan Stapledon

We prove nonlinear relation on multiple Hurwitz-Riemann zeta functions. Using analytic continuation of these multiple Hurwitz-Riemann zeta function, we quote at negative integers Euler's nonlinear relation for generalized Bernoulli…

Number Theory · Mathematics 2016-03-15 Abdelmejid Bayad , Takao Komatsu

The Ehrhart polynomial of a convex lattice polytope counts integer points in integral dilates of the polytope. We present new linear inequalities satisfied by the coefficients of Ehrhart polynomials and relate them to known inequalities. We…

Combinatorics · Mathematics 2007-05-23 M. Beck , J. A. De Loera , M. Develin , J. Pfeifle , R. P. Stanley

We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection,…

Combinatorics · Mathematics 2012-12-27 Steven V Sam

We investigate completed interlacing of zeros for pairs of polynomial sequences that fail to interlace by exactly two points. Using a general mixed recurrence relation, we identify a quadratic polynomial whose zeros serve as the two extra…

Classical Analysis and ODEs · Mathematics 2026-04-29 Kerstin Jordaan , Vikash Kumar

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

Combinatorics · Mathematics 2015-03-13 Tetsushi Matsui , Akihiro Higashitani , Yuuki Nagazawa , Hidefumi Ohsugi , Takayuki Hibi

Hibi showed that the polynomial in the numerator of the Ehrhart series of a reflexive polytope is palindromic. We proved that those in the numerator of the Ehrhart series of every graph polytope (defined later) of the bipartite graph is…

Combinatorics · Mathematics 2015-07-24 Daeseok Lee , Hyeong-Kwan Ju

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

Dynamical Systems · Mathematics 2014-09-29 Vitaly Bergelson , Donald Robertson

We describe a wide class of polynomials, which is a natural generalization of Hurwitz stable polynomials. We also give a detailed account of so-called self-interlacing polynomials, which are dual to Hurwitz stable polynomials but have only…

Classical Analysis and ODEs · Mathematics 2010-05-19 Mikhail Tyaglov

In a previous paper (El. J. Combin. 6 (1999), R37), the author generalized Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its…

Combinatorics · Mathematics 2007-05-23 Matthias Beck

The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…

Combinatorics · Mathematics 2023-08-29 Matthias Beck , Sophia Elia , Sophie Rehberg

In the present note we obtain new results on two conjectures by Csordas et al. regarding the interlacing property of zeros of special polynomials. These polynomials came from the Jacobi tau methods for the Sturm-Liouville eigenvalue…

Classical Analysis and ODEs · Mathematics 2016-03-24 Alexander Dyachenko , Galina van Bevern

We approximate the Riemann Zeta-Function by polynomials and Dirichlet polynomials with restricted zeros.

Complex Variables · Mathematics 2018-08-10 P. M. Gauthier

As a discrete analog to Minkowski's theorem on convex bodies, Wills conjectured that the Ehrhart coefficients of a centrally symmetric lattice polytope with exactly one interior lattice point are maximized by those of the cube of side…

Combinatorics · Mathematics 2013-09-04 Matthias Henze

For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…

Combinatorics · Mathematics 2009-09-24 Alan Stapledon

We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…

Combinatorics · Mathematics 2011-05-16 Beifang Chen

It is known that every lattice polytope is unimodularly equivalent to a face of some reflexive polytope. A stronger question is to ask whether every $(0,1)$-polytope is unimodularly equivalent to a facet of some reflexive polytope. A large…

Combinatorics · Mathematics 2020-09-08 Takahiro Nagaoka , Akiyoshi Tsuchiya

A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…

Combinatorics · Mathematics 2025-01-20 Yuhan Jiang

The interior polynomial was originally defined for hypergraphs and later shown to coincide with the Ehrhart polynomial of the root polytope of an associated bipartite graph. In previous work, we derived an alternating cycle recursion…

Combinatorics · Mathematics 2025-06-04 Keiju Kato

Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we…

Combinatorics · Mathematics 2020-02-27 Tsuyoshi Miezaki