Related papers: Characteristics of graph braid groups

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…

An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…

Homology of braid groups and Artin groups can be related to the study of spaces of curves. We completely calculate the integral homology of the family of smooth curves of genus $g$ with one boundary component, that are double coverings of…

A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed…

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…

Let G be the fundamental group of the complement of a K(G,1) hyperplane arrangement (such as Artin's pure braid group) or more generally a homologically toroidal group (as defined in the paper). The subgroup of elements in the complex…

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2…

We study the first uniformly finite homology group of Block and Weinberger for uniformly locally finite graphs, with coefficients in $\mathbb{Z}$ and $\mathbb{Z}_2$. When the graph is a tree, or coefficients are in $\mathbb{Z}_2$, a…

We consider the class of finitely generated groups whose relators are powers of commutators of the generators. This class contains as a small subclass graph groups (also called RAAGs), namely if all powers are one. Graph groups are the only…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between…

We investigate the rational cohomology of the quotient of (generalized) braid groups by the commutator subgroup of the pure braid groups. We provide a combinatorial description of it using isomorphism classes of certain families of graphs.…

Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…

The present paper is the first one in the sequence of papers about a simple class of {\em framed $4$-graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em…

We first show that the braid group over a graph topologically containing no $\Theta$-shape subgraph has a presentation related only by commutators. Then using discrete Morse theory and triple Massey products, we prove that a graph…

We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one,…

We show that diagram groups can be viewed as fundamental groups of spaces of positive paths on directed 2-complexes (these spaces of paths turn out to be classifying spaces). Thus diagram groups are analogs of second homotopy groups,…