Topological complexity of generic hyperplane arrangements

Details Topological complexity of generic hyperplane arrangements Topological complexity of generic hyperplane arrangements

2007-01-16

arxiv.org/abs/math/0701445v1

Mathematics

Geometric Topology

Scientific paper

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\}$.

Affiliated with

Also associated with

No associations

Rating

Topological complexity of generic hyperplane arrangements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Topological complexity of generic hyperplane arrangements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Topological complexity of generic hyperplane arrangements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-189086