Related papers: Configuration Graph Cohomology
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 description of the cohomology algebra of the…
If $G$ is a graph with vertex set $V$, let Conf$_n^{\text{sink}}(G,V)$ be the space of $n$-tuples of points on $G$, which are only allowed to overlap on elements of $V$. We think of Conf$_n^{\text{sink}}(G,V)$ as a configuration space of…
In the theory of configuration spaces, "splitting" usually refers to the phenomenon that the configuration spaces on a manifold and those on its punctured version are closely related cohomologically. We prove a splitting theorem that is…
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. After the geometric embedding is specified, there is an additional step that is often overlooked or ignored:…
We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
This paper is intended to provide concrete examples of concepts discussed elsewhere in this volume, especially splittings of groups and non-positively curved cube complexes but also other things. The idea of the construction (configuration…
We consider, for a finite graph $G$, when the surjective map $\mathrm{Conf}_{n+1}(G) \rightarrow \mathrm{Conf}_n(G)$ of configuration spaces admits a section. We study when the answer depends only on the homotopy type of $G$, and give a…
The configuration space of k points on a manifold carries an action of its diffeomorphism group. The homotopy quotient of this action is equivalent to the classifying space of diffeomorphisms of a punctured manifold, and therefore admits…
These expository notes are dedicated to the study of the topology of configuration spaces of manifolds. We give detailed computations of many invariants, including the fundamental group of the configuration spaces of $\mathbb{R}^2$, the…
We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
We introduce moduli spaces of colored graphs, defined as spaces of non-degenerate metrics on certain families of edge-colored graphs. Apart from fixing the rank and number of legs these families are determined by various conditions on the…
This paper is a survey of the relationship between labelled configuration spaces, mapping class groups with marked points and function spaces. In particular, we collect calculations of the cohomology groups for the mapping class groups of…
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 different classes of one-connected graphs. Our…
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…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed (reconfigured) into the other by changing one color at a time, maintaining an H-coloring…