Topological complexity of generic hyperplane arrangements
Abstract
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of n hyperplanes in an r-dimensional linear space is min\n+1,2r\.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.