Not all simplicial polytopes are weakly vertex-decomposable
Abstract
In 1980 Provan and Billera defined the notion of weak k-decomposability for pure simplicial complexes. They showed the diameter of a weakly k-decomposable simplicial complex is bounded above by a polynomial function of the number of k-faces in and its dimension. For weakly 0-decomposable complexes, this bound is linear in the number of vertices and the dimension. In this paper we exhibit the first examples of non-weakly 0-decomposable simplicial polytopes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.