The homology of configuration spaces of trees with loops

  title={The homology of configuration spaces of trees with loops},
  author={Safia Chettih and Daniel Lutgehetmann},
  journal={Algebraic \& Geometric Topology},
We show that the homology of ordered configuration spaces of finite trees with loops is torsion free. We introduce configuration spaces with sinks, which allow for taking quotients of the base space. Furthermore, we give a concrete generating set for all homology groups of configuration spaces of trees with loops and the first homology group of configuration spaces of general finite graphs. An important technique in the paper is the identification of the $E^1$-page and differentials of Mayer… 

Figures from this paper

Functorial invariants of trees and their cones

We study the category whose objects are trees (with or without roots) and whose morphisms are contractions. We show that the corresponding contravariant module categories are locally Noetherian, and

Edge stabilization in the homology of graph braid groups

We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the


. We obtain new calculations of the top weight rational cohomology of the moduli spaces M 2 ,n , equivalently the rational homology of the tropical moduli spaces ∆ 2 ,n , as a representation of S n .

On the second homology of planar graph braid groups

We show that the second homology of the configuration spaces of a planar graph is generated under the operations of embedding, disjoint union, and edge stabilization by three atomic graphs: the cycle

An algorithmic discrete gradient field and the cohomology algebra of configuration spaces of two points on complete graphs

We introduce an algorithm that constructs a discrete gradient field on any simplicial complex. We show that, in all situations, the gradient field is maximal possible and, in a number of cases,

Topological Complexity of Configuration Spaces of Fully Articulated Graphs and Banana Graphs

This paper determines the topological complexity of configuration spaces of graphs which are not necessarily trees, which is a crucial assumption in previous results, and shows that an unordered configuration space on a graph does not always have the same topologically complexity as the corresponding ordered configuration space.

A Model for Random Braiding in Graph Configuration Spaces

We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar

Non-abelian Quantum Statistics on Graphs

We show that non-abelian quantum statistics can be studied using certain topological invariants which are the homology groups of configuration spaces. In particular, we formulate a general framework

Farber’s conjecture for planar graphs

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



Homology groups for particles on one-connected graphs

We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for

Topology of configuration space of two particles on a graph, II

This paper continues the investigation of the configuration space of two distinct points on a graph. We analyze the process of adding an additional edge to the graph and the resulting changes in the

Topology of Configuration Space of Two Particles on a Graph, I

In this paper we study the homology and cohomology of confguration spaces of two distinct particles on a graph. Our main tool is intersection theory for cycles in graphs. We obtain an explicit

Estimates for homological dimension of configuration spaces of graphs

We show that the homological dimension of a configuration space of a graph Γ is estimated from above by the number b of vertices in Γ whose valence is greater than 2. We show that this estimate is

Metric Spaces of Non-Positive Curvature

This book describes the global properties of simply-connected spaces that are non-positively curved in the sense of A. D. Alexandrov, and the structure of groups which act on such spaces by

Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups

We prove by explicit construction that graph braid groups and most surface groups can be embedded in a natural way in right-angled Artin groups, and we point out some consequences of these embedding

Finding Topology in a Factory: Configuration Spaces

A class of topological spaces related to motion-planning on graphs that arise naturally in this very context, arising simultaneously in two seemingly disparate fields are described.