3 papers
math.CO2026
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.…
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
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…