Shellability Is Hard Even for Balls
Pavel Paták, Martin Tancer
Abstract
The main goal of this paper is to show that shellability is NP-hard for triangulated d-balls (this also gives hardness for triangulated d-manifolds/d-pseudomanifolds with boundary) as soon as d ≥ 3. This extends our earlier work with Goaoc, Patáková and Wagner on hardness of shellability of 2-complexes and answers some questions implicitly raised by Danaraj and Klee in 1978 and explicitly mentioned by Santamaría-Galvis and Woodroofe. Together with the main goal, we also prove that collapsibility is NP-hard for 3-complexes embeddable in 3-space, extending an earlier work of the second author and answering an open question mentioned by Cohen, Fasy, Miller, Nayyeri, Peng and Walkington; and that shellability is NP-hard for 2-complexes embeddable in 3-space, answering another question of Santamaría-Galvis and Woodroofe (in a slightly stronger form than what is given by the main result).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Embeddability of Simplicial Complexes is UndecidableMarek Filakovský, Uli Wagner, Stephan ZhechevSODA 2020 · 7 citations
- Partial Coloring Complex, Vertex Decomposability and Tverberg's Theorem with ConstraintsSharareh Alipour, Amir Jafari, Mohammad Hassan Mazidi, Seyed Abolfazl NajafianSODA 2024
- Computational Topology in a Collapsing Universe: Laplacians, Homology, CohomologyMitchell Black, William Maxwell, Amir Nayyeri, Eli WinkelmanSODA 2022 · 5 citations
- Improved hardness for H-colourings of G-colourable graphsMarcin Wrochna, Stanislav ZivnýSODA 2020 · 19 citations
- Unlinking, splitting, and some other NP-hard problems in knot theoryDale Koenig, Anastasiia TsvietkovaSODA 2021 · 1 citation
