9 citations · 12 across the 4 of their papers we have counts for
4 papers
Grouped Stirling complexes
Alessia Revelli, Steven Scheirer
Given a graph , a configuration space of can be thought of as the set of all possible configurations of "robots" which can move throughout , subject to some constraints.…
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…
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…
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…