Shellability Is Hard Even for Balls

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F23%3A10476103" target="_blank" >RIV/00216208:11320/23:10476103 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21240/23:00371167

Výsledek na webu

<a href="https://doi.org/10.1145/3564246.3585152" target="_blank" >https://doi.org/10.1145/3564246.3585152</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3564246.3585152" target="_blank" >10.1145/3564246.3585152</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Shellability Is Hard Even for Balls

Popis výsledku v původním jazyce

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 &gt;= 3. This extends our earlier work with Goaoc, Patakova 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 Santamaria-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 andWalkington; and that shellability is NP-hard for 2-complexes embeddable in 3-space, answering another question of Santamaria-Galvis andWoodroofe (in a slightly stronger form than what is given by the main result).

Název v anglickém jazyce

Shellability Is Hard Even for Balls

Popis výsledku anglicky

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 &gt;= 3. This extends our earlier work with Goaoc, Patakova 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 Santamaria-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 andWalkington; and that shellability is NP-hard for 2-complexes embeddable in 3-space, answering another question of Santamaria-Galvis andWoodroofe (in a slightly stronger form than what is given by the main result).

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA22-19073S" target="_blank" >GA22-19073S: Kombinatorická a výpočetní složitost v topologii a geometrii</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2023

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023

ISBN

978-1-4503-9913-5

ISSN

—

e-ISSN

—

Počet stran výsledku

14

Strana od-do

1271-1284

Název nakladatele

ASSOC COMPUTING MACHINERY

Místo vydání

NEW YORK

Místo konání akce

Orlando

Datum konání akce

20. 6. 2023

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

001064640700104