English

Obstructions to weak decomposability for simplicial polytopes

Combinatorics 2023-11-14 v1

Abstract

Provan and Billera introduced notions of (weak) decomposability of simplicial complexes as a means of attempting to prove polynomial upper bounds on the diameter of the facet-ridge graph of a simplicial polytope. Recently, De Loera and Klee provided the first examples of simplicial polytopes that are not weakly vertex-decomposable. These polytopes are polar to certain simple transportation polytopes. In this paper, we refine their analysis to prove that these dd-dimensional polytopes are not even weakly O(d)O(\sqrt{d})-decomposable. As a consequence, (weak) decomposability cannot be used to prove a polynomial version of the Hirsch conjecture.

Keywords

Cite

@article{arxiv.1206.6143,
  title  = {Obstructions to weak decomposability for simplicial polytopes},
  author = {Nicolai Hähnle and Steven Klee and Vincent Pilaud},
  journal= {arXiv preprint arXiv:1206.6143},
  year   = {2023}
}
R2 v1 2026-06-21T21:26:06.355Z