Barycentric Subdivisions of Convex Complexes are Collapsible

Karim Adiprasito, Bruno Benedetti

Research output: Contribution to journalArticle


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.

Original languageEnglish (US)
JournalDiscrete and Computational Geometry
StateAccepted/In press - Jan 1 2019


ASJC Scopus subject areas

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

Cite this