Abrams's stable equivalence for graph braid groups
classification
🧮 math.GT
keywords
leastverticeslengthpathabramsconfigurationdistinctedges
read the original abstract
In his PhD thesis, Abrams proved that, for a natural number n and a graph G with at least n vertices, the n-strand configuration space of G deformation retracts to a compact subspace, the discretized n-strand configuration space, provided G satisfies two conditions: each path between distinct essential vertices (vertices of degree not equal to 2) is of length at least n+1 edges, and each path from a vertex to itself which is not nullhomotopic is of length at least n+1 edges. Using Forman's discrete Morse theory for CW-complexes, we show the first condition can be relaxed to require only that each path between distinct essential vertices is of length at least n-1.
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.