Barycentric Subdivisions of Convex Complexes are Collapsible

Karim Adiprasito; Bruno Benedetti

doi:https://doi.org/10.1007/s00454-019-00137-3

Barycentric Subdivisions of Convex Complexes are Collapsible

Karim Adiprasito, Bruno Benedetti

Einstein Institute of Mathematics

The Hebrew University of Jerusalem

Research output: Contribution to journal › Article › peer-review

Abstract

A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d≤ 3. We solve the problem up to one subdivision, by proving that any linear subdivision of any polytope is simplicially collapsible after at most one barycentric subdivision. Furthermore, we prove that any linear subdivision of any star-shaped polyhedron in R^d is simplicially collapsible after d- 2 derived subdivisions at most. This presents progress on an old question by Goodrick.

Original language	English
Pages (from-to)	608-626
Number of pages	19
Journal	Discrete and Computational Geometry
Volume	64
Issue number	3
DOIs	https://doi.org/10.1007/s00454-019-00137-3
State	Published - 1 Oct 2020

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

https://doi.org/10.1007/s00454-019-00137-3

Cite this

@article{92ec8583a65448f0a5e73c7057999e8c,

title = "Barycentric Subdivisions of Convex Complexes are Collapsible",

abstract = "A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d≤ 3. We solve the problem up to one subdivision, by proving that any linear subdivision of any polytope is simplicially collapsible after at most one barycentric subdivision. Furthermore, we prove that any linear subdivision of any star-shaped polyhedron in Rd is simplicially collapsible after d- 2 derived subdivisions at most. This presents progress on an old question by Goodrick.",

author = "Karim Adiprasito and Bruno Benedetti",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2020",

month = oct,

day = "1",

doi = "https://doi.org/10.1007/s00454-019-00137-3",

language = "الإنجليزيّة",

volume = "64",

pages = "608--626",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Barycentric Subdivisions of Convex Complexes are Collapsible

AU - Adiprasito, Karim

AU - Benedetti, Bruno

PY - 2020/10/1

Y1 - 2020/10/1

N2 - A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d≤ 3. We solve the problem up to one subdivision, by proving that any linear subdivision of any polytope is simplicially collapsible after at most one barycentric subdivision. Furthermore, we prove that any linear subdivision of any star-shaped polyhedron in Rd is simplicially collapsible after d- 2 derived subdivisions at most. This presents progress on an old question by Goodrick.

AB - A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d≤ 3. We solve the problem up to one subdivision, by proving that any linear subdivision of any polytope is simplicially collapsible after at most one barycentric subdivision. Furthermore, we prove that any linear subdivision of any star-shaped polyhedron in Rd is simplicially collapsible after d- 2 derived subdivisions at most. This presents progress on an old question by Goodrick.

UR - http://www.scopus.com/inward/record.url?scp=85075358744&partnerID=8YFLogxK

U2 - https://doi.org/10.1007/s00454-019-00137-3

DO - https://doi.org/10.1007/s00454-019-00137-3

M3 - مقالة

SN - 0179-5376

VL - 64

SP - 608

EP - 626

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 3

ER -

Barycentric Subdivisions of Convex Complexes are Collapsible

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this