Topological complexity of generic hyperplane arrangements
几何拓扑
2007-05-23 v1 组合数学
摘要
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of hyperplanes in an -dimensional linear space is min.
引用
@article{arxiv.math/0701445,
title = {Topological complexity of generic hyperplane arrangements},
author = {Sergey Yuzvinsky},
journal= {arXiv preprint arXiv:math/0701445},
year = {2007}
}