Related papers: Higher topological complexity of a map

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…

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…

Shape inference is classically ill-posed, because it involves a map from the (2D) image domain to the (3D) world. Standard approaches regularize this problem by either assuming a prior on lighting and rendering or restricting the domain,…

Fields exhibit a variety of topological properties, like different topological charges, when field space in the continuum is composed by more than one topological sector. Lattice treatments usually encounter difficulties describing those…

The ability to autonomously navigate in unknown environments is important for mobile robots. The map is the core component to achieve this. Most map representations rely on drift-free state estimation and provide a global metric map to…

This work presents a new path classification criterion to distinguish paths geometrically and topologically from the workspace, which is divided through cell decomposition, generating a medial-axis-like skeleton structure. We use this…

Let $X$ be a closed oriented connected topological manifold of dimension $n\geq 5$. The structure group of $X$ is the abelian group of equivalence classes of all pairs $(f, M)$ such that $M$ is a closed oriented manifold and $f\colon M \to…

The Lusternik-Schnirelmann category of a space was introduced to obtain a lower bound on the number of critical points of a $C^1$-function on a given manifold. Related to Lusternik-Schnirelmann category and motivated by topological…

We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…

Motivated by the interest in computing explicit formulas for resultants and discriminants initiated by B\'ezout, Cayley and Sylvester in the eighteenth and nineteenth centuries, and emphasized in the latest years due to the increase 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…

Topologists are sometimes interested in space-valued diagrams over a given index category, but it is tricky to say what such a diagram even is if we look for a notion that is stable under equivalence. The same happens in (homotopy) type…

For a tree $T$, we show that for many positive integer values of $n$, and an integer $s \geq 2$, the higher topological complexity $TC_s$ of the unordered configuration spaces of trees $U\mathcal{C}^nT$, is maximal. In other words, we prove…

We introduce a novel class of explicit feature maps based on topological indices that represent each graph by a compact feature vector, enabling fast and interpretable graph classification. Using radial basis function kernels on these…

The aim of this work is to proceed with the development of a model of topological electromagnetism in empty space, proposed by one of us some time ago and based on the existence of a topological structure associated with the radiation…

The paper surveys topological problems relevant to the motion planning problem of robotics and includes some new results and constructions. First we analyse the notion of topological complexity of configuration spaces which is responsible…

Topology in photonics comes in two distinct flavors: global and local. Global topology considers invariants that are obtained by integrating over the energy band, whereas local topology considers defects, typically vortices, in the…

Conventional algorithms in autonomous exploration face challenges due to their inability to accurately and efficiently identify the spatial distribution of convex regions in the real-time map. These methods often prioritize navigation…

How hard is it to program $n$ robots to move about a long narrow aisle while making a series of $r-2$ intermediate stops, provided only $w$ of the robots can fit across the width of the aisle? In this paper, we answer this question by…

An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…