Related papers: Equivariant topological complexities
Lie derivatives of various geometrical and physical quantities define symmetries and conformal symmetries in general relativity. Thus we obtain motions, collineations, conformal motions and conformal collineations. These symmetries are used…
We define and study an equivariant version of Farber's topological complexity for spaces with a given compact group action. This is a special case of the equivariant sectional category of an equivariant map, also defined in this paper. The…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
For a $G$-equivariant fibration $p \colon E\to B$, we introduce and study the invariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity, called the invariant parametrized topological complexity. This notion…
Farber and Rudyak introduced topological complexity $\mathbf{TC}(X)$ of motion planning and its higher analogs $\mathbf{TC}_n(X)$ to measure the complexity of assigning paths to point tuples. Motivated by motion planning where a robotic…
Symmetries and isomorphisms play similar conceptual roles when we consider how models represent physical situations, but they are formally distinct, as two models related by symmetries are not typically isomorphic. I offer a rigorous…
We compute the topological complexity of Eilenberg-Mac Lane spaces associated to the group of automorphisms of a finitely generated free group which act by conjugation on a given basis, and to certain subgroups.
The aim of this article is to review different generalizations of the the notion of topological complexity to the equivariant setting. In particular, we review the relation (or non-relation) between these notions and the topological…
We study an elementary problem of the topological robotics: collective motion of a set of $n$ distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in…
Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…
We present upper and lower bounds for symmetrized topological complexity $TC^\Sigma(X)$ in the sense of Basabe-Gonz\'alez-Rudyak-Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of…
We investigate global properties of the mappings entering the description of symmetries of integrable spin and vertex models, by exploiting their nature of birational transformations of projective spaces. We give an algorithmic analysis of…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
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.
We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…
Physical theories grounded in mathematical symmetries are an essential component of our understanding of a wide range of properties of the universe. Similarly, in the domain of machine learning, an awareness of symmetries such as rotation…
We study a generalized motion planning problem involving multiple autonomous robots navigating in a $d$-dimensional Euclidean space in the presence of a set of obstacles whose positions are unknown a priori. Each robot is required to visit…
In this paper we study the complexity of the motion planning problem for control-affine systems. Such complexities are already defined and rather well-understood in the particular case of nonholonomic (or sub-Riemannian) systems. Our aim is…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
Complexity one spaces are an important class of examples in symplectic geometry. Karshon and Tolman classify them in terms of combinatorial and topological data. In this paper, we compute the equivariant cohomology for any complexity one…