Totally normal cellular stratified spaces and applications to the configuration space of graphs (Q519447): Difference between revisions

This is a very interesting and well written paper. The authors use the technique of totally normal cellular stratified spaces to construct new combinatorial models for configuration spaces of graphs. Their approach has numerous advantages compared to the standard one (based on discrete configuration spaces). It allows an equivariant approximation (taking into account the group of permutations of the particles), it gives a simplified proof of R. Ghrist's theorem about an upper bound for the homotopical dimension, and, besides, the authors' approach is helpful for computing fundamental groups of configuration spaces of graphs.