Flag vectors of multiplicial polytopes
Margaret M. Bayer
Abstract
Bisztriczky introduced the multiplex as a generalization of the simplex. A polytope is multiplicial if all its faces are multiplexes. In this paper it is proved that the flag vectors of multiplicial polytopes depend only on their face vectors. A special class of multiplicial polytopes, also discovered by Bisztriczky, is comprised of the ordinary polytopes. These are a natural generalization of the cyclic polytopes. The flag vectors of ordinary polytopes are determined. This is used to give a surprisingly simple formula for the h-vector of the ordinary d-polytope with n+1 vertices and characteristic k: hi=binomk-d+ii+(n-k)binomk-d+i-1i-1, for i at most d/2. In addition, a construction is given for 4-dimensional multiplicial polytopes having two-thirds of their vertices on a single facet, answering a question of Bisztriczky.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.