Related papers: Spaces with high topological complexity

We survey results on the topological complexity of classical configuration spaces of distinct ordered points in orientable surfaces and related spaces, including certain orbit configuration spaces and Eilenberg-Mac Lane spaces associated to…

In theories with large extra dimensions, constraints from cosmology lead to non-trivial lower bounds on the fundamental scale M_F, corresponding to upper bounds on the radii of the compact extra dimensions. These constraints are especially…

This paper is concerned with "nice" compactifications of manifolds. Siebenmann's iconic dissertation characterized open manifolds M^m (m>5) compactifiable by addition of a manifold boundary. His theorem extends easily to cases where M^m is…

We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

We give necessary and sufficient conditions for certain pushouts of topological spaces in the category of Cech's closure spaces to agree with their pushout in the category of topological spaces. We prove that in these two categories, the…

Let $X$ be the prime spectrum of a ring. In [arXiv:0707.1525] the authors define a topology on $X$ by using ultrafilters and they show that this topology is precisely the constructible topology. In this paper we generalize the construction…

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…

The unordered configuration space of $n$ points on a graph $\Gamma,$ denoted here by $UC^n(\Gamma),$ can be viewed as the space of all configurations of $n$ unlabeled robots on a system of one-dimensional tracks, which is interpreted as a…

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

This work is motivated by the question of whether there are spaces $X$ for which the Farber-Grant symmetric topological complexity $TC^S(X)$ differs from the Basabe-Gonz\'alez-Rudyak-Tamaki symmetric topological complexity $TC^\Sigma(X)$.…

For a topological space $X$ its reflection in a class $\mathsf T$ of topological spaces is a pair $(\mathsf T X,i_X)$ consisting of a space $\mathsf T X\in\mathsf T$ and continuous map $i_X:X\to \mathsf T X$ such that for any continuous map…

For every finite closure space $X$ one can define a finite topological space $\operatorname{Top} X$ together with a natural projection $\operatorname{Top} X\longrightarrow X$. This could allow to apply the techniques of topological…

We prove that the space of free boundary CMC surfaces of bounded topology, bounded area and bounded boundary length is compact in the $C^k$ graphical sense away from a finite set of points. This is a CMC version of a result for minimal…

We determine the topological complexity of unordered configuration spaces on almost all punctured surfaces (both orientable and non-orientable). We also give improved bounds for the topological complexity of unordered configuration spaces…

In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…

The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a $k$-element node set $C$ that maximizes the probability of detecting communication between a pair of nodes $s$ and $t$ chosen uniformly at…

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…

Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…