Showing math.ATShow all
2 papers · 1 filter
math.AT2020
Farber's conjecture for planar graphs
Ben Knudsen
We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument e…
math.AT2018
Configuration spaces in algebraic topology
Ben Knudsen
These expository notes are dedicated to the study of the topology of configuration spaces of manifolds. We give detailed computations of many invariants, including the fundamental…