35 citations · 133 across the 18 of their papers we have counts for
4 papers · 1 filter
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…
On the second homology of planar graph braid groups
Byung Hee An, Ben Knudsen
We show that the second homology of the configuration spaces of a planar graph is generated under the operations of embedding, disjoint union, and edge stabilization by three atomi…
Embedding calculus and smooth structures
Ben Knudsen, Alexander Kupers
We study the dependence of the embedding calculus Taylor tower on the smooth structures of the source and target. We prove that embedding calculus does not distinguish exotic smoot…
Asymptotic homology of graph braid groups
Byung Hee An, Gabriel C. Drummond-Cole, Ben Knudsen
We give explicit formulas for the asymptotic Betti numbers of the unordered configuration spaces of an arbitrary finite graph over an arbitrary field.