6 papers
Sequential parametrized topological complexity of sphere bundles
Michael Farber, Amit Kumar Paul
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm \cite{FP22} works under variable external co…
Sequential parametrized motion planning and its complexity, II
Michael Farber, Amit Kumar Paul
This is a continuation of our recent paper in which we developed the theory of sequential parametrized motion planning. A sequential parametrized motion planning algorithm produced…
Sequential Parametrized Motion Planning and its Complexity
Michael Farber, Amit Kumar Paul
In this paper we develop theory of sequential parametrized motion planning which generalises the approach of parametrized motion planning, which was introduced recently in [3]. A s…
Simplicial and combinatorial versions of higher symmetric topological complexity
Amit Kumar Paul, Debasis Sen
In this paper, we introduce higher symmetric simplicial complexity of a simplicial complex and higher symmetric combinatorial complexity of a finite pos…
An upper bound for higher topological complexity and higher strongly equivariant complexity
Amit Kumar Paul, Debasis Sen
We prove an upper bound of higher topological complexity using higher -topological complexity of a space . An intermediate invaria…
Higher analogs of simplicial and combinatorial complexity
Amit Kumar Paul
We introduce higher simplicial complexity of a simplicial complex and higher combinatorial complexity of a finite space (i.e. is a finite poset). We relate higher simpl…