Related papers: On sequential versions of various parametrized inv…
We introduce the concept of parametrized homotopic distance, extending the classical notion of homotopic distance to the fibrewise setting. We establish its correspondence with the fibrewise sectional category of a specific fibrewise…
Parametrized topological complexity is a homotopy invariant that represents the degree of instability of motion planning problem that involves external constraints. We consider the parametrized topological complexity in the case of…
Sequential parametrized topological complexity is a numerical homotopy invariant of a fibration, which arose in the robot motion planning problem with external constraints. In this paper, we study sequential parametrized topological…
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…
In this paper, we define and study an equivariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity. We show that several results in the non-equivariant case can be extended to the equivariant case. For example,…
Three aspects of applying homotopy continuation, which is commonly used to solve parameterized systems of polynomial equations, are investigated. First, for parameterized systems which are homogeneous, we investigate options for performing…
In this note we introduce parameterized Gromov-Witten invariants for symplectic fiber bundles and study the topology of the symplectomorphism group. We also give sample applications showing the non-triviality of certain homotopy groups of…
We establish a stable homotopy-theoretic version of a recent result of Farber and Weinberger on the fibrewise topological complexity of sphere bundles and prove, by closely parallel methods, a similar result for real, complex and…
Multiparameter persistence module can capture more topological differences across data instances compared to using a single parameter, where the well-studied matching distance investigates the distance along a straight line in the…
Persistent Topology studies topological features of shapes by analyzing the lower level sets of suitable functions, called filtering functions, and encoding the arising information in a parameterized version of the Betti numbers, i.e. the…
We introduce and study the proper topological complexity of a given configuration space, a version of the classical invariant for which we require that the algorithm controlling the motion is able to avoid any possible choice of ``unsafe''…
General invariants of a geometric mapping of a symmetric affine connection space are obtained in this paper. These invariants are generalizations of the previous obtained basic invariants (see [16]). Moreover, these invariants are related…
In this paper, we review a method for computing and parameterizing the set of homotopy classes of chain maps between two chain complexes. This is then applied to finding topologically meaningful maps between simplicial complexes, which in…
We give rigorous foundations for parametrized homotopy theory in this monograph. After preliminaries on point-set topology, base change functors, and proper actions of non-compact Lie groups, we develop the homotopy theory of equivariant…
The notion of parametrized topological complexity, introduced by Cohen, Farber and Weinberger, is extended to fibrewise spaces which are not necessarily Hurewicz fibrations. After exploring some formal properties of this extension we also…
Motivated by amplitude calculations in string theory we establish basic properties of homotopy invariant iterated integrals on affine curves.
Parametrized motion planning algorithms \cite{CFW} have a high degree of universality and flexibility; they generate the motion of a robotic system under a variety of external conditions. The latter are viewed as parameters and constitute…
We set the foundations for a new approach to Topological Data Analysis (TDA) based on homotopical methods at chain complexes level. We present the category of tame parametrised chain complexes as a comprehensive environment that includes…
We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…