Presentations of Graph Braid Groups
classification
🧮 math.GR
keywords
graphbraidspaceconfigurationgroupgroupspresentationscalled
read the original abstract
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 to compute presentations of all graph braid groups, for all finite connected graphs G and all natural numbers n.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.