2000 character limit reached
Discrete homotopy of token configurations
Published 27 May 2020 in math.CO | (2005.13557v1)
Abstract: This paper studies graphical analogs of symmetric products and unordered configuration spaces in topology. We do so from the perspective of the discrete homotopy theory introduced by Barcelo et al. Our first result is a combinatorial version of a theorem of P. A. Smith, which says that the fundamental group of any nontrivial symmetric product of $X$ is isomorphic to $H_1(X)$. Our second result gives conditions under which the n-strand braid group of a graph is isomorphic to its discrete analog.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.