English
Related papers

Related papers: Gorenstein polytopes with trinomial $h^*$-polynomi…

200 papers

We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…

Combinatorics · Mathematics 2018-10-02 Mónica Blanco , Francisco Santos

We classify all convex polyomino ideals which are linearly related or have a linear resolution. Convex stack polyominoes whose ideals are extremal Gorenstein are also classified. In addition, we characterize, in combinatorial terms, the…

Commutative Algebra · Mathematics 2014-03-19 Viviana Ene , Jürgen Herzog , Takayuki Hibi

We show that any smooth lattice polytope P with codegree greater or equal than (dim(P)+3)/2 (or equivalently, with degree smaller than dim(P)/2), defines a dual defective projective toric manifold. This implies that P is Q-normal (in the…

Combinatorics · Mathematics 2010-01-19 Alicia Dickenstein , Benjamin Nill

Stanley introduced two classes of lattice polytopes associated to posets, which are called the order polytope ${\mathcal O}_P$ and the chain polytope ${\mathcal C}_P$ of a poset $P$. It is known that, given a poset $P$, the Ehrhart…

Combinatorics · Mathematics 2022-01-26 Hidefumi Ohsugi , Akiyoshi Tsuchiya

We extend White's classification of empty tetrahedra to the complete classification of lattice $3$-polytopes with five lattice points, showing that, apart from infinitely many of width one, there are exactly nine equivalence classes of them…

Combinatorics · Mathematics 2016-05-13 Mónica Blanco , Francisco Santos

We show that the Ehrhart h-vector of an integer Gorenstein polytope with a regular unimodular triangulation satisfies McMullen's g-theorem; in particular, it is unimodal. This result generalizes a recent theorem of Athanasiadis (conjectured…

Commutative Algebra · Mathematics 2021-05-18 Winfried Bruns , Tim Roemer

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

A toric variety is constructed from a lattice polytope. It is common in algebraic combinatorics to carry this way a notion of an algebraic property from the variety to the polytope. From the combinatorial point of view, one of the most…

Combinatorics · Mathematics 2020-05-19 Michał Lasoń , Mateusz Michałek

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

We study D\'iaz-Dineen's problem for regular homogeneous vector-valued polynomials. In particular, we prove that if $E^*$ and $F^*$ are lattice isomorphic with at least one having order continuous norm, then $\mathcal{P}^r(^n E; G^*)$ and…

Functional Analysis · Mathematics 2026-02-04 Christopher Boyd , Vinícius Miranda

We construct many nonpolytopal nonsimplicial Gorenstein* meet semi-lattices with nonnegative toric g-vector, supporting a conjecture of Stanley. These are formed as Bier spheres over the face posets of multiplexes, polytopes constructed by…

Combinatorics · Mathematics 2012-07-25 Louis J. Billera , Eran Nevo

We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for…

Combinatorics · Mathematics 2016-05-12 Mónica Blanco , Francisco Santos

A beautiful degree formula for the Grothendieck polynomials was recently given by Pechenik, Speyer, and Weigandt (2021). We provide an alternative proof of their degree formula, utilizing the climbing chain model for Grothendieck…

Combinatorics · Mathematics 2022-09-05 Matt Dreyer , Karola Mészáros , Avery St. Dizier

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

Combinatorics · Mathematics 2007-05-23 Nicolas Ressayre , Pierre-Louis Montagard

In this paper, the principal tool to describe transversal polymatroids with Gorenstein base ring is polyhedral geometry, especially the $Danilov-Stanley$ theorem for the characterization of canonical module. Also, we compute the…

Commutative Algebra · Mathematics 2008-01-16 Alin Stefan

A matroid is Gorenstein if its toric variety is. Hibi, Laso\'n, Matsuda, Micha\l{}ek, and Vodi\v{c}ka provided a full graph-theoretic classification of Gorenstein matroids associated to simple graphs. We extend this classification to…

Combinatorics · Mathematics 2020-07-02 Max Kölbl

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

This article provides a comprehensive exposition about inequalities that the coefficients of Ehrhart polynomials and $h^*$-polynomials satisfy under various assumptions. We pay particular attention to the properties of Ehrhart positivity as…

Combinatorics · Mathematics 2024-08-23 Luis Ferroni , Akihiro Higashitani

In this paper, we give a criterion of the nearly Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ with connected components…

Commutative Algebra · Mathematics 2022-01-25 Mitsuhiro Miyazaki

Symmetric Grothendieck polynomials are inhomogeneous versions of Schur polynomials that arise in combinatorial $K$-theory. A polynomial has saturated Newton polytope (SNP) if every lattice point in the polytope is an exponent vector. We…

Combinatorics · Mathematics 2017-10-17 Laura Escobar , Alexander Yong