English
Related papers

Related papers: Semi-reflexive polytopes

200 papers

Given arbitrary integers $d$ and $r$ with $d \geq 4$ and $1 \leq r \leq d + 1$, a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ with ${\rm depth} K[\mathcal{P}] = r$ for which its dual polytope $\mathcal{P}^\vee$ is…

Commutative Algebra · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

Let $\delta(\mathcal{P})$ be the $\delta$-vector of a reflexive polytope $\mathcal{P} \subset \mathbb{R}^d$ of dimension $d$ and $\delta(\mathcal{P} ^\vee)$ the $\delta$-vector of the dual polytope $\mathcal{P}^\vee \subset \mathbb{R}^d$.…

Combinatorics · Mathematics 2020-09-07 Akiyoshi Tsuchiya

The reflexive dimension refldim(P) of a lattice polytope P is the minimal d so that P is the face of some d-dimensional reflexive polytope. We show that refldim(P) is finite for every P, and give bounds for refldim(kP) in terms of…

Combinatorics · Mathematics 2007-05-23 Christian Haase , Ilarion V. Melnikov

To any poset or quasi-poset is attached a lattice polytope, whose Ehrhart polynomial we study from a Hopf-algebraic point of view. We use for this two interacting bialgebras on quasi-posets. The Ehrhart polynomial defines a Hopf algebra…

Rings and Algebras · Mathematics 2016-11-15 Loïc Foissy

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

Let $\mathcal{P} \subseteq \mathbb{R}^{n}$ be a polytope whose vertices have rational coordinates. By a seminal result of E. Ehrhart, the number of integer lattice points in the $k$th dilate of $\mathcal{P}$ ($k$ a positive integer) is a…

Combinatorics · Mathematics 2026-02-04 Tyrrell B. McAllister , Hélène O. Rochais

A half-integral polygon with quasi-period collapse behaves similarly to a lattice polygon in the sense that the number of lattice points in its integer dilates can be calculated as values of a polynomial, its Ehrhart polynomial. As a main…

Combinatorics · Mathematics 2025-07-03 Martin Bohnert

A reflection mapping is a singular holomorphic mapping obtained by restricting the quotient mapping of a complex reflection group. We study the analytic structure of double point spaces of reflection mappings. In the case where the image is…

A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…

Combinatorics · Mathematics 2009-11-12 Fu Liu

Reflexive lattice polytopes play a key role in combinatorics, algebraic geometry, physics, and other areas. One important class of lattice polytopes are lattice simplices defining weighted projective spaces. We investigate the question of…

Combinatorics · Mathematics 2022-11-23 Benjamin Braun , Robert Davis , Derek Hanely , Morgan Lane , Liam Solus

A lattice polytope $\mathcal{P}$ is called reflexive if its dual $\mathcal{P}^\vee$ is a lattice polytope. The property that $\mathcal{P}$ is unimodularly equivalent to $\mathcal{P}^\vee$ does not hold in general, and in fact there are few…

Combinatorics · Mathematics 2017-11-21 Takayuki Hibi , McCabe Olsen , Akiyoshi Tsuchiya

The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…

Combinatorics · Mathematics 2007-05-23 Fu Liu

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

Combinatorics · Mathematics 2023-08-31 Christopher de Vries , Masahiko Yoshinaga

A classification of discrete polymatroids whose independence polytopes are reflexive will be presented.

Combinatorics · Mathematics 2023-02-27 Jürgen Herzog , Takayuki Hibi

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

In this paper we investigate the Ehrhart Theory of the independence matroid polytope of uniform matroids. It is proved that these polytopes have an Ehrhart polynomial with positive coefficients. To do that, we prove that indeed all…

Combinatorics · Mathematics 2021-05-24 Luis Ferroni

Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…

Combinatorics · Mathematics 2016-03-17 Benjamin Braun , Liam Solus

We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…

Combinatorics · Mathematics 2023-12-21 Per Alexandersson , Sam Hopkins , Gjergji Zaimi

We study the question of when 0-1 polytopes are normal or, equivalently, having the integer decomposition property. In particular, we shall associate to each 0-1 polytope a labeled hypergraph, and examine the equality between its Ehrhart…

Commutative Algebra · Mathematics 2014-09-08 Huy Tai Ha , Kuei-Nuan Lin

It is a famous open question whether every integrally closed reflexive polytope has a unimodal Ehrhart delta-vector. We generalize this question to arbitrary integrally closed lattice polytopes and we prove unimodality for the delta-vector…

Combinatorics · Mathematics 2011-10-18 Jan Schepers , Leen Van Langenhoven