A comparison theorem for f-vectors of simplicial polytopes
Anders Björner
Abstract
Let fi(P) denote the number of i-dimensional faces of a convex polytope P. Furthermore, let S(n,d) and C(n,d) denote, respectively, the stacked and the cyclic d-dimensional polytopes on n vertices. Our main result is that for every simplicial d-polytope P, if fr(S(n1,d)) fr(P) fr(C(n2,d)) for some integers n1, n2 and r, then fs(S(n1,d)) fs(P) fs(C(n2,d)) for all s such that r<s. For r=0 these inequalities are the well-known lower and upper bound theorems for simplicial polytopes. The result is implied by a certain ``comparison theorem'' for f-vectors, formulated in Section 4. Among its other consequences is a similar lower bound theorem for centrally-symmetric simplicial polytopes.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.