9 citations · 12 across the 4 of their papers we have counts for
Showing math.ATShow all
3 papers · 1 filter
math.AT2021
Relative Topological Complexity and Configuration Spaces
Bryan Boehnke, Steven Scheirer, Shuhang Xue
Given a space , the topological complexity of , denoted by , can be viewed as the minimum number of "continuous rules" needed to describe how to move between any two p…
math.AT2019★ 3 cited
Topological complexity of unordered configuration spaces of certain graphs
Steven Scheirer
The unordered configuration space of points on a graph denoted here by can be viewed as the space of all configurations of unlabeled robots on a system of o…
math.AT2016★ 9 cited
Topological complexity of n points on a tree
Steven Scheirer
The topological complexity of a path-connected space denoted can be thought of as the minimum number of continuous rules needed to describe how to move from one point…