Shellability is hard even for balls

11/15/2022
by   Pavel Paták, et al.
0

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 is at least 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 the 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 the 3-space, answering another question of Santamaría-Galvis and Woodroofe (in a slightly stronger form than what is given by the main result).

READ FULL TEXT

page 9

page 12

page 14

page 15

page 26

page 28

page 30

page 38

research
08/07/2019

A hardness of approximation result in metric geometry

We show that it is NP-hard to approximate the hyperspherical radius of a...
research
10/26/2019

On the Hardness of Energy Minimisation for Crystal Structure Prediction

Crystal Structure Prediction (csp) is one of the central and most challe...
research
02/09/2023

Hardness of monadic second-order formulae over succinct graphs

Our main result is a succinct counterpoint to Courcelle's meta-theorem a...
research
11/14/2019

Hardness of Learning DNFs using Halfspaces

The problem of learning t-term DNF formulas (for t = O(1)) has been stud...
research
11/20/2018

Minimum Guesswork with an Unreliable Oracle

We study a guessing game where Alice holds a discrete random variable X,...
research
02/08/2019

Detecting mixed-unitary quantum channels is NP-hard

A quantum channel is said to be a mixed-unitary channel if it can be exp...
research
10/07/2021

Bad-Policy Density: A Measure of Reinforcement Learning Hardness

Reinforcement learning is hard in general. Yet, in many specific environ...

Please sign up or login with your details

Forgot password? Click here to reset