Balanced generalized lower bound inequality for simplicial polytopes
Combinatorics
2015-03-24 v1 Commutative Algebra
Abstract
A remarkable and important property of face numbers of simplicial polytopes is the generalized lower bound inequality, which says that the -numbers of any simplicial polytope are unimodal. Recently, for balanced simplicial -polytopes, that is simplicial -polytopes whose underlying graphs are -colorable, Klee and Novik proposed a balanced analogue of this inequality, that is stronger than just unimodality. The aim of this article is to prove this conjecture of Klee and Novik. For this, we also show a Lefschetz property for rank-selected subcomplexes of balanced simplicial polytopes and thereby obtain new inequalities for their -numbers.
Keywords
Cite
@article{arxiv.1503.06430,
title = {Balanced generalized lower bound inequality for simplicial polytopes},
author = {Martina Juhnke-Kubitzke and Satoshi Murai},
journal= {arXiv preprint arXiv:1503.06430},
year = {2015}
}
Comments
11 pages