Iterated chromatic subdivisions are collapsible
From MaRDI portal
Publication:891921
DOI10.1007/s10485-014-9383-6zbMath1344.55006MaRDI QIDQ891921
Samuel Mimram, Christine Tasson, Eric Goubault
Publication date: 18 November 2015
Published in: Applied Categorical Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10485-014-9383-6
collapsibility; barycentric subdivision; abstract simplicial complex; colored simplicial complex; iterated subdivision; standard chromatic subdivision
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
55U10: Simplicial sets and complexes in algebraic topology
Related Items
Collapsibility of read/write models using discrete Morse theory, Geometric and combinatorial views on asynchronous computability
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sheaves in geometry and logic: a first introduction to topos theory
- Chromatic subdivision of a simplicial complex
- Joins for (augmented) simplicial sets
- Trace Spaces: An Efficient New Technique for State-Space Reduction
- The topological structure of asynchronous computability
- Impossibility of distributed consensus with one faulty process
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
- New combinatorial topology bounds for renaming
- Simplicial homotopy theory
- Combinatorial algebraic topology