Related papers: Topological complexity of the telescope
We prove the formula $TC(G\ast H)=\max\{TC(G), TC(H), cd(G\times H)\}$ for the topological complexity of the free product of discrete groups with cohomological dimension >2.
In this paper we analyze some relationships between the topological complexity of a space $X$ and the category of $C_{\Delta_X},$ the homotopy cofibre of the diagonal map $\Delta_X:X\rightarrow X\times X.$ We establish the equality of the…
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.
We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
We propose some problems on the classification of toric manifolds from the viewpoint of topology and survey related results.
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
In this article we study the higher topological complexity ${\sf TC}_r(X)$ in the case when $X$ is an aspherical space, $X=K(\pi, 1)$ and $r\ge 2$. We give a characterisation of ${\sf TC}_r(K(\pi, 1))$ in terms of classifying spaces for…
We prove that for every $n$-vertex graph $G$, the extension complexity of the correlation polytope of $G$ is $2^{O(\mathrm{tw}(G) + \log n)}$, where $\mathrm{tw}(G)$ is the treewidth of $G$. Our main result is that this bound is tight for…
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…
The cross topology $\gamma$ on a product of topological spaces $X$ and $Y$ is the collection of all sets $G\subseteq X\times Y$ such that the intersection of $G$ with every vertical line and every horizontal line is an open subset of either…
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the…
We show how locally smooth actions of compact Lie groups on a manifold $X$ can be used to obtain new upper bounds for the topological complexity $\TC(X)$, in the sense of Farber. We also obtain new bounds for the topological complexity of…
In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of a closed 3--manifold, as well as a characterisation of manifolds realising our complexity bounds. As an application, we obtain the first…
A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an {\it opportunity…
We study dynamical systems which have bounded complexity with respect to three kinds metrics: the Bowen metric $d_n$, the max-mean metric $\hat{d}_n$ and the mean metric $\bar{d}_n$, both in topological dynamics and ergodic theory. It is…
The space-like hypersurface of the Universe at the present cosmological time is a three-dimensional manifold. A non-trivial global topology of this space-like hypersurface would imply that the apparently observable universe (the sphere of…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
We construct classifying $\infty$-topoi by showing that the $(\infty,2)$-category of topoi has weighted limits. We show that several prestacks of interest have a classifying topos, including the prestack of spectra.