Topological complexity of generic hyperplane arrangements
英文摘要:
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\}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。