Related papers: Topological Complexity of wedges
We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…
We study numerical invariants $d\TC(\Gamma)$ and $d\cat(\Gamma)$ of groups recently introduced in \cite{DJ} and independently in \cite{KW}. We compute $d\TC$ for finite cyclic groups $\mathbb Z_p$ with prime $p$ as well as for nonorientable…
We show that the (normalized) topological complexity of the Klein bottle is $4$. We also show that, for any $g\geq 2$, $TC(N_g)=4$. This completes the recent work by Dranishnikov on the topological complexity of non-orientable surfaces.
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
We develop the theory of the intertwining distributional versions of the LS-category and the sequential topological complexities of a space $X$, denoted by $\mathsf{icat}(X)$ and $\mathsf{iTC}_m(X)$, respectively. We prove that they satisfy…
A cohomology class u of a topological space X is atoroidal if its pullback to the torus vanishes for every map from a torus to X. Furthermore, X is atoroidally symplectic if there is an atoroidal cohomology class $u\in H^2(X;F)$ such that…
In this paper, we provide sufficient conditions for a space $X$ to satisfy the Ganea conjecture for topological complexity. To achieve this, we employ two auxiliary invariants: weak topological complexity in the sense of Berstein-Hilton,…
The geodesic complexity of a Riemannian manifold is a numerical isometry invariant that is determined by the structure of its cut loci. In this article we study decompositions of cut loci over whose components the tangent cut loci fiber in…
The problem of interpreting a set of ${\cal W}$-algebra constraints constructed in terms of an arbitrarily twisted scalar field as the recursion relations of a topological theory is addressed. In this picture, the conventional models of…
We establish upper bounds for the complexity of Seifert fibered manifolds with nonempty boundary. In particular, we obtain potentially sharp bounds on the complexity of torus knot complements.
The status of topology on the lattice is reviewed. Recent results show that the topological susceptibility chi can be unambigously determined. Different methods, if properly implemented, give results consistent with each other. For SU(3)…
We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.
We introduce \emph{local Urysohn width}, a complexity measure for classification problems on metric spaces. Unlike VC dimension, fat-shattering dimension, and Rademacher complexity, which characterize the richness of hypothesis…
We find (completeness type) conditions on topological semilattices $X,Y$ guaranteeing that each continuous homomorphism $h:X\to Y$ has closed image $h(X)$ in $Y$.
We give a parameterized algorithm for weighted vertex cover on graphs with maximum degree 3 whose time complexity is $O^*(1.402^t)$, where $t$ is the minimum size of a vertex cover of the input graph.
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
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…
We give a proof to the following theorem, which is well-known among experts: A connected subcomplex $W$ of a finite dimensional CAT(0) cubed complex $X$ is convex if and only if Lk$(v, W)$ is a full subcomplex of Lk$(v, X)$ for every vertex…
In this study, we delve into the discrete TC of surjective simplicial fibrations, aiming to unravel the interplay between topological complexity, discrete geometric structures, and computational efficiency. Moreover, we examine the…
In various articles, it is said that the class of all soft topologies on a common universe forms a complete lattice, but in this paper, we prove that it is a complete lattice. Some soft topologies are maximal and some are minimal with…