2014Modeling and Analysis of Information SystemsOpen access

Perfect Prismatoids are Lattice Delaunay Polytopes

M. A. Kozachok, Alexander Magazinov

Open full text 0 citations

Abstract

A perfect prismatoid is a convex polytope P such that for every its facet F there exists a supporting hyperplane α k F such that any vertex of P belongs to either F or α. Perfect prismatoids concern with Kalai conjecture, that any centrally symmetric dpolytope P has at least 3 d non-empty faces and any polytope with exactly 3 d non-empty faces is a Hanner polytope. Any Hanner polytope is a perfect prismatoid (but not vice versa). A 0/1-polytope is a convex hull of some vertices of the d-dimensional unit cube. We prove that every perfect prismatoid is affinely equivalent to some 0/1-polytope of the same dimension. (And therefore every perfect prismatoid is a lattice polytope.) Let Λ be a lattice in R d and D be a polytope inscribed in a sphere B. Denote a boundary of B by ∂B and an interior of B by int B. The polytope D is a lattice Delaunay polytope if Λ∩int B = ∅ and D is a convex hull of Λ∩∂B. We prove that every perfect prismatoid is affinely equivalent to some lattice Delaunay polytope.

Open-access reader

About this research paper

What this paper is about

A perfect prismatoid is a convex polytope P such that for every its facet F there exists a supporting hyperplane α k F such that any vertex of P belongs to either F or α. Perfect prismatoids concern with Kalai conjecture, that any centrally symmetric dpolytope P has at least 3 d non-empty faces and any polytope with exactly 3 d non-empty faces is a Hanner polytope. Any Hanner polytope is a perfect prismatoid (but not vice versa). A 0/1-polytope is a convex hull of some vertices of the d-dimensional unit cube. We prove that every perfect prismatoid is affinely equivalent to some 0/1-polytope of the same dimension. (And therefore every perfect prismatoid is a lattice polytope.) Let Λ be a lattice in R d and D be a polytope inscribed in a sphere B. Denote a boundary of B by ∂B and an interior of B by int B. The polytope D is a lattice Delaunay polytope if Λ∩int B = ∅ and D is a convex hull of Λ∩∂B. We prove that every perfect prismatoid is affinely equivalent to some lattice Delaunay polytope.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A perfect prismatoid is a convex polytope P such that for every its facet F there exists a supporting hyperplane α k F such that any vertex of P belongs to either F or α. Perfect prismatoids concern with Kalai conjecture, that any centrally symmetric dpolytope P has at least 3 d non-empty faces and any polytope with exactly 3 d non-empty faces is a Hanner polytope. Any Hanner polytope is a perfect prismatoid (but not vice versa). A 0/1-polytope is a convex hull of some vertices of the d-dimensional unit cube. We prove that every perfect prismatoid is affinely equivalent to some 0/1-polytope of the same dimension. (And therefore every perfect prismatoid is a lattice polytope.) Let Λ be a lattice in R d and D be a polytope inscribed in a sphere B. Denote a boundary of B by ∂B and an interior of B by int B. The polytope D is a lattice Delaunay polytope if Λ∩int B = ∅ and D is a convex hull of Λ∩∂B. We prove that every perfect prismatoid is affinely equivalent to some lattice Delaunay polytope.

Key concepts: Combinatorics, Uniform k 21 polytope, Birkhoff polytope, Mathematics, Polytope, Convex polytope, Convex hull, Delaunay triangulation

Related papers

Back to paper searchBrowse research topicsOriginal source
Perfect Prismatoids are Lattice Delaunay Polytopes — Research Paper | ScholarLens