English
Related papers

Related papers: The depth of a reflexive polytope

200 papers

We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)^d vertices such that every pair of non-antipodal vertices of P spans…

Metric Geometry · Mathematics 2011-11-21 Alexander Barvinok , Seung Jin Lee , Isabella Novik

The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…

Combinatorics · Mathematics 2016-07-26 João Gouveia , Kanstanstin Pashkovich , Richard Z. Robinson , Rekha R. Thomas

A minimum depth d^I(S --> R) is assigned to a ring homomorphism S --> R and a R-R-bimodule I. The recent notion of depth of a subring d(S,R)in a paper by Boltje-Danz-Kuelshammer is recovered when I = R and S --> R is the inclusion mapping.…

Rings and Algebras · Mathematics 2010-12-09 Lars Kadison

For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in…

K-Theory and Homology · Mathematics 2017-05-24 J. -F. Lafont , B. A. Magurn , I. J. Ortiz

In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…

Algebraic Geometry · Mathematics 2007-05-23 Alessandra Sarti

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…

Metric Geometry · Mathematics 2007-09-14 Gennadiy Averkov , Martin Henk

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

Metric Geometry · Mathematics 2009-01-22 Károly J. Böröczky , Rolf Schneider

Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite…

Combinatorics · Mathematics 2020-09-08 Takayuki Hibi , Akiyoshi Tsuchiya

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

Any integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional toric variety $X_P$ and an ample divisor $D_P$ on this variety. This paper gives an explicit construction of the algebraic geometric error-correcting code on…

Algebraic Geometry · Mathematics 2021-02-08 Jade Nardi

Let $P\subset\R^d$ be a $d$-dimensional polytope. The {\em realization space} of~$P$ is the space of all polytopes $P'\subset\R^d$ that are combinatorially equivalent to~$P$, modulo affine transformations. We report on work by the first…

Metric Geometry · Mathematics 2016-09-06 Jürgen Richter-Gebert , Günter M. Ziegler

Let K and L be compact convex sets in R^n. The following two statements are shown to be equivalent: (i) For every polytope Q inside K having at most n+1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 <= d <=…

Metric Geometry · Mathematics 2010-10-25 Daniel A. Klain

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

Combinatorics · Mathematics 2008-09-29 Benjamin Nill

This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…

Metric Geometry · Mathematics 2007-05-23 Anna Felikson , Pavel Tumarkin

We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…

Group Theory · Mathematics 2016-10-11 Gabe Cunningham , Mark Mixer

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak

A two-step model for generating random polytopes is considered. For parameters $d$, $m$, and $p$, the first step is to generate a simple polytope $P$ whose facets are given by $m$ uniform random hyperplanes tangent to the unit sphere in…

Combinatorics · Mathematics 2021-08-16 Andrew Newman

We investigate the sign patterns of coefficients in the Ehrhart polynomial of the Cartesian product between the $r$-th pyramid over the Reeve tetrahedron and the hypercube $[0, n]^n$. This investigation yields partial results on the sign…

Combinatorics · Mathematics 2025-12-01 Feihu Liu , Sihao Tao , Guoce Xin

In this paper we show that the diameter of a d-dimensional lattice polytope in [0,k]^n is at most (k - 1/2) d. This result implies that the diameter of a d-dimensional half-integral polytope is at most 3/2 d. We also show that for…

Computational Geometry · Computer Science 2015-12-25 Alberto Del Pia , Carla Michini

In this paper, we show that Oda's question holds for $n$-dimensional simplicial reflexive polytope $P$ and lattice polytope $Q$ containing the origin, when the vertex of $Q$ is either a vertex of $P$ or the origin, provided that $P$ has no…

Combinatorics · Mathematics 2025-11-07 Binnan Tu