Presentations of graph braid groups-Reference-Cited by-同舟云学术

Presentations of graph braid groups

Published:2012-06-29 Issue:4 Volume:24 Page:827-859
ISSN:1435-5337
Container-title:Forum Mathematicum
language:en
Short-container-title:

Author:

Farley Daniel¹,Sabalka Lucas²

Affiliation:

1. Department of Mathematics, Miami University, Oxford, OH 45056, USA

2. Department of Mathematical Sciences, Binghamton University, Binghamton, NY 13902, USA

Abstract

Abstract. Let be a graph. The (unlabeled) configuration space of n points on is the space of n-element subsets of . The n-strand braid group of , denoted , is the fundamental group of . This paper applies the methods of discrete Morse theory to the spaces . We describe how to compute presentations for , where n is an arbitrary natural number and is an arbitrary finite connected graph. Particular attention is paid to the case , and many examples are given.

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,General Mathematics

Link

https://www.degruyter.com/document/doi/10.1515/form.2011.086/pdf

Reference9 articles.

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

2. Topological Complexity of Motion Planning

3. Instabilities of robot motion

4. Discrete Morse theory and graph braid groups

5. On the cohomology rings of tree braid groups

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph of groups decompositions of graph braid groups;International Journal of Algebra and Computation;2023-09-12

2. Homological Algebra and Its Application: A Descriptive Study;Integrated Journal for Research in Arts and Humanities;2022-01-31

3. Novel quantum phases on graphs using abelian gauge theory;Journal of Statistical Mechanics: Theory and Experiment;2021-10-01

4. Farley–Sabalka’s Morse-Theory Model and the Higher Topological Complexity of Ordered Configuration Spaces on Trees;Discrete & Computational Geometry;2021-06-25

5. Geometric Presentations of Braid Groups for Particles on a Graph;Communications in Mathematical Physics;2021-04-28