5 papers
On the Sequential topological complexity of directed (parametrized) motion planning algorithms
Navnath Daundkar, Abhishek Sarkar, Ankur Sarkar
We introduce sequential analogues of directed (parametrized) topological complexity, in the context of motion planning problems requiring a system to traverse a prescribed sequence…
Discrete version of topological complexity of maps
Sutirtha Datta, Navnath Daundkar, Abhishek Sarkar +1
We introduce and study discrete analogs of Scott's and Murillo-Wu's topological complexity of maps. We prove that these discrete analogs are contiguity invariants and are, in fact,…
On sequential versions of various parametrized invariants
Navnath Daundkar, Abhishek Sarkar, Ankur Sarkar
In this paper, we introduce and study sequential versions of several fibrewise homotopy invariants, including parametrized topological complexity, parametrized (subspace) homotopic…
On the topological complexity of directed parametrized motion planning
Sutirtha Datta, Navnath Daundkar, Abhishek Sarkar
We introduce and study a parametrized analogue of the directed topological complexity, originally developed by Goubault, Farber, and Sagnier. We establish the fibrewise basic dihom…
Higher topological complexity of planar polygon spaces having small genetic codes
Sutirtha Datta, Navnath Daundkar, Abhishek Sarkar
We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension …