On rigidity and the isomorphism problem for tree braid groups. (Q838401)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    On rigidity and the isomorphism problem for tree braid groups.
    scientific article

      Statements

      On rigidity and the isomorphism problem for tree braid groups. (English)
      0 references
      0 references
      25 August 2009
      0 references
      Summary: We solve the isomorphism problem for braid groups on trees with \(n=4\) or \(5\) strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations using the cohomology of tree braid groups, couching our discussion in the language of differential forms. Second, we show that, given a tree braid group \(B_nT\) on \(n=4\) or \(5\) strands, \(H^*(B_nT)\) is an exterior face algebra. Finally, we prove that one may reconstruct the tree \(T\) from a tree braid group \(B_nT\) for \(n=4\) or \(5\). Among other corollaries, this third step shows that, when \(n=4\) or \(5\), tree braid groups \(B_nT\) and trees \(T\) (up to homeomorphism) are in bijective correspondence. That such a bijection exists is not true for higher dimensional spaces, and is an artifact of the 1-dimensionality of trees. We end by stating the results for right-angled Artin groups corresponding to the main theorems, some of which do not yet appear in the literature.
      0 references
      tree braid groups
      0 references
      configuration spaces
      0 references
      isomorphism problem
      0 references
      exterior face algebras
      0 references
      discrete Morse theory
      0 references
      group cohomology
      0 references
      right-angled Artin groups
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references