Related papers: The topological complexity of pure graph braid gro…
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…
We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…
In this paper we determine the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results. We do this for two very different classes of graphs: fully…
We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…
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 short note we prove the Borel conjecture for a family of aspherical manifolds that includes higher graph manifolds.
In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…
We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…
Using the ordered analogue of Farley-Sabalka's discrete gradient field on the configuration space of a graph, we unravel a levelwise behavior of the generators of the pure braid group on a tree. This allows us to generalize Farber's…
We find conditions which ensure that the topological complexity of a closed manifold $M$ with abelian fundamental group is nonmaximal, and see through examples that our conditions are sharp. This generalizes results of Costa and Farber on…
We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…
Turaev's shadow can be seen locally as the Stein factorization of a stable map. In this paper, we define the notion of stable map complexity for a compact orientable 3-manifold bounded by (possibly empty) tori counting, with some weights,…
We prove a lower bound for the topological complexity, in the sense of Smale, of the problem of finding a flex point on a cubic plane curve. The key is to bound the Schwarz genus of a cover associated to this problem. We also show that our…
We introduce a version of Farber's topological complexity suitable for investigating mechanical systems whose configuration spaces exhibit symmetries. Our invariant has vastly different properties to the previous approaches of Colman-Grant,…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times…
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We give a proof of the Gromov compactness theorem using the language of stable curves (i.e. cusp-curve of Gromov, or stable maps of Kontsevich and Manin) in general setting: An almost complex structure on a target manifold is only…