2000 character limit reached
Topological complexity of collision-free multi-tasking motion planning on orientable surfaces
Published 26 Jul 2016 in math.AT | (1607.07667v1)
Abstract: We compute the higher topological complexity of ordered configuration spaces of orientable surfaces, thus extending Cohen-Farber's description of the ordinary topological complexity of those spaces.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.