English
Related papers

Related papers: Restricted Birkhoff polytopes and Ehrhart period c…

200 papers

The characterization of lattice polytopes based upon information about their Ehrhart $h^*$-polynomials is a difficult open problem. In this paper, we finish the classification of lattice polytopes whose $h^*$-polynomials satisfy two…

Combinatorics · Mathematics 2015-03-20 Akihiro Higashitani , Benjamin Nill , Akiyoshi Tsuchiya

In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…

Combinatorics · Mathematics 2024-04-03 Max Kölbl

We determine lattice polytopes of smallest volume with a given number of interior lattice points. We show that the Ehrhart polynomials of those with one interior lattice point have largest roots with norm of order n^2, where n is the…

Metric Geometry · Mathematics 2007-05-23 Christian Bey , Martin Henk , Joerg M. Wills

We introduce several classes of polytopes contained in $[0,1]^n$ and cut out by inequalities involving sums of consecutive coordinates. We show that the normalized volumes of these polytopes enumerate circular extensions of certain partial…

Combinatorics · Mathematics 2020-07-10 Arvind Ayyer , Matthieu Josuat-Vergès , Sanjay Ramassamy

We investigate the Ehrhart polynomial for the class of 0-symmetric convex lattice polytopes in Euclidean $n$-space $\mathbb{R}^n$. It turns out that the roots of the Ehrhart polynomial and Minkowski's successive minima are closely related…

Metric Geometry · Mathematics 2011-10-20 Martin Henk , Achill Schuermann , Joerg M. Wills

We present examples of smooth lattice polytopes in dimensions 3 and higher where each coefficient of their Ehrhart polynomials that can potentially be negative is indeed negative. This answers a question by Bruns. We also discuss…

Combinatorics · Mathematics 2018-06-21 Federico Castillo , Fu Liu , Benjamin Nill , Andreas Paffenholz

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

Combinatorics · Mathematics 2021-07-21 Gil Kalai , Leonard J. Schulman

The Ehrhart polynomial and Ehrhart series count lattice points in integer dilations of a lattice polytope. We introduce and study a $q$-deformation of the Ehrhart series, based on the notions of harmonic spaces and Macaulay's inverse…

Combinatorics · Mathematics 2024-09-25 Victor Reiner , Brendon Rhoades

In a recent paper, Ayyer and Behrend present for a wide class of partitions factorizations of Schur polynomials with an even number of variables where half of the variables are the reciprocals of the others into symplectic and/or orthogonal…

Combinatorics · Mathematics 2020-03-31 Arvind Ayyer , Ilse Fischer

We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…

Combinatorics · Mathematics 2018-11-20 Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We prove quasi-polynomiality for monotone and strictly monotone orbifold Hurwitz numbers. The second enumerative problem is also known as enumeration of a special kind of Grothendieck's dessins d'enfants or $r$-hypermaps. These statements…

Combinatorics · Mathematics 2019-07-15 Reinier Kramer , Danilo Lewanski , Sergey Shadrin

The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely integrability close to the boundary, and prove…

Dynamical Systems · Mathematics 2018-02-19 Guan Huang , Vadim Kaloshin , Alfonso Sorrentino

We give integral formulas to approximate solutions of Dirichlet and Neumann problems for Helmholtz equation at high frequencies. These approximations are valid in the complementary of a union of convex compact obstacles. The first step of…

Analysis of PDEs · Mathematics 2014-02-18 François Cuvelier

In this paper, we define what is called a quasi-Reinhardt domain and study biholomorphisms between such domains. We show that all biholomorphisms between two bounded quasi-Reinhardt domains fixing the origin are polynomial mappings, and we…

Complex Variables · Mathematics 2016-09-16 Fusheng Deng , Feng Rong

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

Combinatorics · Mathematics 2025-12-10 Krishna Menon , Emil Verkama

We consider certain correspondences on a Riemann surface, and show that they admit a weak form of hyperbolicity: sufficiently long loops get shorter under lifting at a fixed point and closing. In terms of their algebraic encoding by bisets,…

Dynamical Systems · Mathematics 2025-10-16 Laurent Bartholdi , Dzmitry Dudko , Kevin M. Pilgrim

In this paper we calculate the Ehrhart's polynomial associated with a 2-dimensional regular polytope (i.e. equilateral triangles) in $\mathbb Z^3$. The polynomial takes a relatively simple form in terms of the coordinates of the vertices of…

Number Theory · Mathematics 2011-07-12 Eugen J. Ionascu

In this paper we give lower bounds for the representation of real univariate polynomials as sums of powers of degree 1 polynomials. We present two families of polynomials of degree d such that the number of powers that are required in such…

Computational Complexity · Computer Science 2015-07-09 Ignacio Garcia-Marco , Pascal Koiran

Ehrhart's conjecture proposes a sharp upper bound on the volume of a convex body whose barycenter is its only interior lattice point. Recently, Berman and Berndtsson proved this conjecture for a class of rational polytopes including…

Combinatorics · Mathematics 2013-02-19 Benjamin Nill , Andreas Paffenholz

The Ehrhart polynomial $ehr_P (n)$ of a lattice polytope $P$ gives the number of integer lattice points in the $n$-th dilate of $P$ for all integers $n\geq 0$. The degree of $P$ is defined as the degree of its $h^\ast$-polynomial, a…

Combinatorics · Mathematics 2024-09-24 Matthias Beck , Ellinor Janssen , Katharina Jochemko