Related papers: Topological complexity and efficiency of motion pl…
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…
We show the existence of an MA-complete homology problem for a certain subclass of simplicial complexes. The problem is defined through a new concept of orientability of simplicial complexes that we call a "uniform orientable filtration",…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
Weighted cup-length calculations in singular cohomology led Farber and Grant in 2008 to general lower bounds for the topological complexity of lens spaces. We replace singular cohomology by K-theory, and weighted cup-length arguments by…
In this extended abstract, we report on ongoing work towards an approximate multimodal optimization algorithm with asymptotic guarantees. Multimodal optimization is the problem of finding all local optimal solutions (modes) to a path…
Many machine learning applications are naturally formulated as optimization problems on Riemannian manifolds. The main idea behind Riemannian optimization is to maintain the feasibility of the variables while moving along a descent…
Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general…
Optimization with orthogonality constraints frequently arises in various fields such as machine learning. Riemannian optimization offers a powerful framework for solving these problems by equipping the constraint set with a Riemannian…
In this work we construct a variety of new complex-valued proper biharmonic maps and (2,1)-harmonic morphisms on Riemannian manifolds with non-trivial geometry. These are solutions to a non-linear system of partial differential equations…
Given a compact Riemannian manifold together with a group of isometries, we discuss MCF of the orbits and some applications: eg, finding minimal orbits. We then specialize to Lagrangian orbits in Kaehler manifolds. In particular, in the…
We consider the speed planning problem for a robotic manipulator. In particular, we present an algorithm for finding the time-optimal speed law along an assigned path that satisfies velocity and acceleration constraints and respects the…
The Turaev-Viro invariants are a powerful family of topological invariants for distinguishing between different 3-manifolds. They are invaluable for mathematical software, but current algorithms to compute them require exponential time. The…
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 (arXiv:2501.15657), we discused…
Constrained motion planning is a challenging field of research, aiming for computationally efficient methods that can find a collision-free path on the constraint manifolds between a given start and goal configuration. These planning…
We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these problems involve planning the coordinated motion of a collection of agents…
Recently it has been shown that the complexity of SU($n$) operator is determined by the geodesic length in a bi-invariant Finsler geometry, which is constrained by some symmetries of quantum field theory. It is based on three axioms and one…
Multi-Agent Path Finding (MAPF) is a fundamental motion coordination problem arising in multi-agent systems with a wide range of applications. The problem's intractability has led to extensive research on improving the scalability of…
We use topological methods to study complexity of deep computations and limit computations. We use topology of function spaces, specifically, the classification Rosenthal compacta, to identify new complexity classes. We use the language of…
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 a motion of the system which is required to visit a…
This article addresses regularity of optimal transport maps for cost="squared distance" on Riemannian manifolds that are products of arbitrarily many round spheres with arbitrary sizes and dimensions. Such manifolds are known to be…