Some conjectures concerning complexity of PL subdivisions

DOI10.1016/J.ENTCS.2012.05.009MaRDI QIDQ5179024zbMATH OpenOpenAlexWikidataFDO

Authors Dmitry N. Kozlov

Publication date 18 March 2015

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.entcs.2012.05.009

zbMATH Keywords

barycentric subdivisioncombinatorial algebraic topologygeometric simplicial complexPL topologystellar subdivision

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Simplicial sets and complexes in algebraic topology (55U10) General topology of complexes (57Q05)

Recommendations

• Derived subdivisions make every PL sphere polytopal
• The Charney-Davis conjecture for certain subdivisions of spheres
• Geometry and the simplex: results, questions and ideas
• \(f\)-vectors of barycentric subdivisions
• Barycentric subdivisions of convex complexes are collapsible

Cites work

• Combinatorial algebraic topology
• Hardness of embedding simplicial complexes in R^d
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 3337454 (Why is no real title available?)
• Komplexe in euklidischen Räumen
• Stellar discriminants and equipartitions

Cited in

(3)

• Finiteness of conical algorithms with \(\omega\)-subdivisions
• Stellar discriminants and equipartitions
• Derived subdivisions make every PL sphere polytopal

This page was built for publication: Some conjectures concerning complexity of PL subdivisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5179024)