Skip to main content

Higher Topological Complexity of Artin Type Groups

  • Chapter
  • First Online:
Configuration Spaces

Part of the book series: Springer INdAM Series ((SINDAMS,volume 14))

  • 990 Accesses

Abstract

We calculate the higher topological complexity TC s for the complements of reflection arrangements, in other words for the pure Artin type groups of all finite complex reflection groups. In order to do that we introduce a simple combinatorial criterion for arrangements sufficient for the cohomological lower bound for TC s to coincide with the dimensional upper bound.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. V.I. Arnol’d, The cohomology ring of the group of dyed braids. Math. Notes 5, 138–140 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  2. I. Basabe, J. Gonzalez, Y. Rudyak, D. Tamaki, Higher topological complexity and its symmetrization. Algebr. Geom. Topology 14, 2103–2124 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  3. D. Bessis, Finite complex reflection arrangements are K(π, 1) (2006). arXiv:math.GT/0610777

    Google Scholar 

  4. D. Cohen, G. Pruidze, Motion planning in tori. Bull. Lond. Math. Soc. 40, 249–262 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. P. Deligne, Les immeubles des groupes de tresses generalises. Invent. Math. 17, 273–302 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  6. M. Farber, Topological complexity of motion planning. Discrete Comput. Geom. 29, 211–221 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. M. Farber, S. Yuzvinsky, Topological robotics: subspace arrangements and collision free motion planning. Geometry, Topology, and Mathematical Physics. American Mathematical Society Translations Series 2, vol. 212 (American Mathematical Society, Providence, 2000), pp. 145–156

    Google Scholar 

  8. J. Gonzalez, M. Grant, Sequential motion planning of non-colliding particles in Euclidean spaces (2013). arXiv:math1309.4346

    Google Scholar 

  9. P. Orlik, L. Solomon, Unitary reflection groups and cohomology. Invent. Math. 59, 77–94 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  10. P. Orlik, H. Terao, Arrangements of Hyperplanes. Grundlehren der Mathematischen Wissenschaften, vol. 300 (Springer, Berlin/Heidelberg/New York, 1992)

    Google Scholar 

  11. Y. Rudyak, On higher analogs of topological complexity. Topology Appl. 157, 916–920 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  12. A. Shwarz, The genus of a fiber space. AMS Transl. 23 (14), 5339–5354 (1995)

    Google Scholar 

  13. S. Yuzvinsky, Topological complexity of generic hyperplane complements. Contemp. Math. 438, 115–119 (2007)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergey Yuzvinsky .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Yuzvinsky, S. (2016). Higher Topological Complexity of Artin Type Groups. In: Callegaro, F., Cohen, F., De Concini, C., Feichtner, E., Gaiffi, G., Salvetti, M. (eds) Configuration Spaces. Springer INdAM Series, vol 14. Springer, Cham. https://doi.org/10.1007/978-3-319-31580-5_5

Download citation

Publish with us

Policies and ethics