McMullen's conditions and some lower bounds for general convex polytopes
type: Item
instance of: scholarly article
title: McMullen's conditions and some lower bounds for general convex polytopes
zbMATH Open document ID: 0811.52004
DOI: 10.1007/BF01263604
author: Antoine Deza
author: Komei Fukuda
published in: Geometriae Dedicata
publication date: 1995-05-02T00:00:00Z
review text: In the combinatorial theory of convex polytopes an important question is the connection between the numbers of the \(i\)-faces of a \(d\)-dimensional polytope \((i = 0,1,\dots, d-1)\). In particular 0-faces, 1-faces and \((d - 1)\)-faces are respectively called vertices, edges and facets of a \(d\)- dimensional polytope; \(f_ i(P)\) denotes the number of the \(i\)-faces of a polytope \(P\). Especially upper and lower bounds of these numbers \(f_ i(P)\) for \(P\) with a given number of \(k\)-faces are considered. Furthermore, one wants to know which classes of polytopes attain such bounds. \textit{P. McMullen's} upper bound theorem [Mathematika, London 17, 179-184 (1970; Zbl 0217.467)] gives upper bounds for the numbers \(f_ i(P)\) \((i = 0,1, \dots, d-1)\) for the set of all \(d\)-dimensional polytopes \(P\) with \(m\) vertices. These bounds are attained for special simplicial polytopes. \textit{D. Barnette's} lower bound theorem [Pac. J. Math. 46, 349-354 (1973; Zbl 0264.52006)] concerns sharp lower bounds of the numbers \(f_ i (P)\) (\(i = 0,1, \dots, d-1\)) only for \(d\)-dimensional simplicial polytopes \(P\) with \(m\) vertices. In this note the authors present lower bounds \(\ell^ d_ i (m)\) of \(f_ 0 (P)\) for a general \(d\)-dimensional polytope \(P\) with \(M\) \(i\)- faces \((i = 0,1, \dots, \lfloor d/2\rfloor - 1)\). These bounds are attained for special simplicial polytopes and are a sort of inverse functions of McMullen's bounds. The authors mention the asymptotical representation \(\ell^ d_ i (m) = O(\root{i+1} \of {m}\)). To show that \(\ell^ d_ i(m)\) is a lower bound the authors use Barnette's results. For tightness of these bounds McMullen's conditions are utilized.
Mathematics Subject Classification ID: 52B05
Mathematics Subject Classification ID: 52B11
zbMATH DE Number: 679539
zbMATH Keywords: \(n\)-dimensional polytopes
zbMATH Keywords: combinatorial properties
zbMATH Keywords: number of vertices
zbMATH Keywords: lower bounds
zbMATH Keywords: simplicial polytopes
reviewed by: Johannes Böhm
MaRDI profile type: Publication
cites work: The minimum number of vertices of a simple polytope
cites work: A proof of the lower bound conjecture for convex polytopes
cites work: Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopes
cites work: A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
cites work: Q4747150
cites work: The maximum numbers of faces of a convex polytope
cites work: The numbers of faces of simplicial polytopes
cites work: Q5621733
cites work: Underpolynomials and infrapolynomials
cites work: The number of faces of a simplicial convex polytope
Recommended article: Q4313881
Recommended article: The upper bound theorem for polytopes: An easy proof of its asymptotic version
Recommended article: Remarks on missing faces and generalized lower bounds on face numbers
Recommended article: Facets with fewest vertices
Recommended article: The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices
Recommended article: A lower bound theorem for polytope pairs
Recommended article: Lower bound for the maximal number of facets of a 0/1 polytope
Recommended article: The convex hull of a uniform sample from the interior of a simple d-polytope
Recommended article: On the Maximal Number of Facets of 0/1 Polytopes
Recommended article: Q4283511
description: scientific article; zbMATH DE number 679539