pith. sign in

arxiv: 1203.1676 · v1 · pith:TKE2NTRQnew · submitted 2012-03-08 · 🧮 math.CO · math.OC

Not all simplicial polytopes are weakly vertex-decomposable

classification 🧮 math.CO math.OC
keywords simplicialdecomposableweaklycomplexesdeltadimensionnumberpolytopes
0
0 comments X
read the original 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 $\Delta$ is bounded above by a polynomial function of the number of $k$-faces in $\Delta$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.