English
Related papers

Related papers: A note on palindromic $\delta$-vectors for certain…

200 papers

The Ehrhart quasi-polynomial of a rational polytope $P$ is a fundamental invariant counting lattice points in integer dilates of $P$. The quasi-period of this quasi-polynomial divides the denominator of $P$ but is not always equal to it:…

Combinatorics · Mathematics 2018-10-31 Alexander M. Kasprzyk , Ben Wormleighton

We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and "local contributions" of the links of its…

Combinatorics · Mathematics 2008-12-07 Sam Payne

An interesting open problem in Ehrhart theory is to classify those lattice polytopes having a unimodal $h^*$-vector. Although various sufficient conditions have been found, necessary conditions remain a challenge. In this paper, we consider…

Combinatorics · Mathematics 2014-08-28 Benjamin Braun , Robert Davis

In this paper, we show the existence of universal inequalities for the $h^*$-vector of a lattice polytope P, that is, we show that there are relations among the coefficients of the $h^*$-polynomial which are independent of both the…

Combinatorics · Mathematics 2017-03-29 Gabriele Balletti , Akihiro Higashitani

We prove the unimodality of the Ehrhart $\delta$-polynomial of the chain polytope of the zig-zag poset, which was conjectured by Kirillov. First, based on a result due to Stanley, we show that this polynomial coincides with the…

Combinatorics · Mathematics 2016-03-29 Herman Z. Q. Chen , Philip B. Zhang

Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…

Combinatorics · Mathematics 2017-11-30 Benjamin Braun

The Ehrhart polynomial of a lattice polygon P is completely determined by the pair (b(P),i(P)) where b(P) equals the number of lattice points on the boundary and i(P) equals the number of interior lattice points. All possible pairs…

Combinatorics · Mathematics 2020-02-11 Johannes Hofscheier , Benjamin Nill , Dennis Öberg

A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…

Algebraic Topology · Mathematics 2014-02-26 Suyoung Choi , Taras Panov , Dong Youp Suh

Given a rational polytope $P \subset \mathbb R^d$, the numerical function counting lattice points in the integral dilations of $P$ is known to become a quasi-polynomial, called the Ehrhart quasi-polynomial $\mathrm{ehr}_P$ of $P$. In this…

Combinatorics · Mathematics 2024-11-01 Akihiro Higashitani , Satoshi Murai , Masahiko Yoshinaga

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Combinatorics · Mathematics 2018-02-21 Akihiro Higashitani , Mikiya Masuda

The Ehrhart polynomial of a lattice polytope $P$ encodes information about the number of integer lattice points in positive integral dilates of $P$. The $h^\ast$-polynomial of $P$ is the numerator polynomial of the generating function of…

Combinatorics · Mathematics 2019-03-06 Matthias Beck , Katharina Jochemko , Emily McCullough

First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…

Combinatorics · Mathematics 2011-11-07 Eugen J. Ionascu

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

Combinatorics · Mathematics 2018-06-04 Benjamin Braun , Robert Davis , Liam Solus

Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…

Commutative Algebra · Mathematics 2013-07-31 Viviana Ene , Ayesha Asloob Qureshi , Asia Rauf

Let $\mathcal{L}$ be a finite distributive lattice and $S=K[x_\alpha: \alpha \in \mathcal{L}]$ be a polynomial ring over a field $K$ and $I=\langle x_\alpha x_\beta - x_{\alpha\vee \beta} x_{\alpha\wedge\beta} : \alpha \nsim…

Commutative Algebra · Mathematics 2025-08-05 Priya Das , Himadri Mukherjee

A synaptic algebra $A$ is a generalization of the self-adjoint part of a von Neumann algebra. We study a linear subspace $V$ of $A$ in regard to the question of when $V$ is a vector lattice. Our main theorem states that if $V$ contains the…

Rings and Algebras · Mathematics 2016-05-24 David J. Foulis , Anna Jencova , Sylvia Pulmannova

Let $\Delta \subset \R^n$ be an $n$-dimensional lattice polytope. It is well-known that $h_{\Delta}^*(t) := (1-t)^{n+1} \sum_{k \geq 0} |k\Delta \cap \Z^n| t^k $ is a polynomial of degree $d \leq n$ with nonnegative integral coefficients.…

Combinatorics · Mathematics 2007-05-23 Victor Batyrev

Let $M$ be an uniformizable Anderson $t$-motive of rank $r$, $L$ its lattice and $l_*:=\{l_1,\dots, l_r\}$ its basis. We define a map $\delta$ from the set of these bases to a flag variety (the present text gives the definition of $\delta$…

Number Theory · Mathematics 2025-04-29 A. Grishkov , D. Logachev

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

Combinatorics · Mathematics 2016-11-21 Nima Amini

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