English
Related papers

Related papers: Gorenstein simplices with a given $\delta$-polynom…

200 papers

There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…

Combinatorics · Mathematics 2007-05-23 Fu Liu

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…

Combinatorics · Mathematics 2021-01-22 Fiona Abney-McPeek , Sanket Biswas , Senjuti Dutta , Yongyuan Huang , Deyuan Li , Nancy Xu

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

This article considers some q-analogues of classical results concerning the Ehrhart polynomials of Gorenstein polytopes, namely properties of their q-Ehrhart polynomial with respect to a good linear form. Another theme is a specific linear…

Quantum Algebra · Mathematics 2014-08-07 Frédéric Chapoton , Driss Essouabri

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…

Combinatorics · Mathematics 2023-09-19 David Richter

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…

Combinatorics · Mathematics 2011-11-09 Victor Batyrev , Benjamin Nill

The local $h^*$-polynomial of a lattice polytope is an important invariant arising in Ehrhart theory. Our focus is on lattice simplices presented in Hermite normal form with a single non-trivial row. We prove that when the off-diagonal…

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

Given a family of lattice polytopes, two common questions in Ehrhart Theory are determining when a polytope has the integer decomposition property and determining when a polytope is reflexive. While these properties are of independent…

Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…

Number Theory · Mathematics 2012-07-30 Pieter Moree

We conduct a systematic study of the Ehrhart theory of certain slices of rectangular prisms. Our polytopes are generalizations of the hypersimplex and are contained in the larger class of polypositroids introduced by Lam and Postnikov;…

Combinatorics · Mathematics 2025-04-30 Luis Ferroni , Daniel McGinnis

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…

Combinatorics · Mathematics 2022-08-01 Robert Davis , Florian Kohl

It is known that if a Gorenstein simplex of dimension \(d\) and degree \(s\) is not a lattice pyramid, then \(d \leq 2s-1\). In this paper, we study the extremal case \(d=2s-1\). More precisely, we characterize Gorenstein simplices of…

Combinatorics · Mathematics 2026-04-29 Akiyoshi Tsuchiya

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

Combinatorics · Mathematics 2017-08-11 Benjamin Nill

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

We initiate the study of subpolytopes of the permutahedron that arise as the convex hulls of stack-sorting on permutations. We primarily focus on $Ln1$ permutations, i.e., permutations of length $n$ whose penultimate and last entries are…

Combinatorics · Mathematics 2025-02-11 Eon Lee , Carson Mitchell , Andrés R. Vindas-Meléndez

We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).

Combinatorics · Mathematics 2009-04-24 Takayuki Hibi , Akihiro Higashitani , Yuuki Nagazawa

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…

Combinatorics · Mathematics 2017-03-31 Raman Sanyal , Christian Stump

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

Number Theory · Mathematics 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

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…

Combinatorics · Mathematics 2020-01-14 Liam Solus