Connectivity at infinity for braid groups on complete graphs. (Q354253)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6189100
Language Label Description Also known as
default for all languages
No label defined
    English
    Connectivity at infinity for braid groups on complete graphs.
    scientific article; zbMATH DE number 6189100

      Statements

      Connectivity at infinity for braid groups on complete graphs. (English)
      0 references
      0 references
      0 references
      18 July 2013
      0 references
      The authors find connectivity at infinity of braid groups of complete graphs. The main theorem of the paper states that the universal cover \(\widetilde{C_m(K_{m+n})}\) of the \(m\)-point discrete configuration space \(C_m(K_{m+n})\) of the complete graph \(K_{m+n}\) on \(n+m\) vertices is \((v_{m,n}-2)\)-connected at infinity but not \((v_{m,n}-1)\)-connected at infinity; here \(v_{m,n}=\min\bigl\{m,n,\bigl\lfloor\frac{m+n+1}{3}\bigr\rfloor\bigr\}\).
      0 references
      braid groups on graphs
      0 references
      connectivity at infinity
      0 references
      discrete configuration spaces
      0 references
      complete graphs
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references