Topological complexity of generic hyperplane arrangements
classification
🧮 math.GT
math.CO
keywords
complexitygenerichyperplanetopologicalalgorithmarrangementarrangementscomplement
read the original 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\}$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.