The number of k-faces of a simple d-polytope

From MaRDI portal
Publication:1283733

DOI10.1007/PL00009403zbMATH Open0935.52010arXivmath/9612218MaRDI QIDQ1283733FDOQ1283733


Authors: Anders Bjoerner, Svante Linusson Edit this on Wikidata


Publication date: 4 May 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Consider the question: Given integers k<d<n, does there exist a simple d-polytope with n faces of dimension k? We show that there exist numbers G(d,k) and N(d,k) such that for n>N(d,k) the answer is yes if and only if nequiv0quadpmodG(d,k). Furthermore, a formula for G(d,k) is given, showing that e.g. G(d,k)=1 if kgeleftlfloorfracd+12ightfloor or if both d and k are even, and also in some other cases (meaning that all numbers beyond N(d,k) occur as the number of k-faces of some simple d-polytope). This question has previously been studied only for the case of vertices (k=0), where Lee cite{Le} proved the existence of N(d,0) (with G(d,0)=1 or 2 depending on whether d is even or odd), and Prabhu cite{P2} showed that N(d,0)lecdsqrtd. We show here that asymptotically the true value of Prabhu's constant is c=sqrt2 if d is even, and c=1 if d is odd.


Full work available at URL: https://arxiv.org/abs/math/9612218




Recommendations





Cited In (9)





This page was built for publication: The number of \(k\)-faces of a simple \(d\)-polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283733)