Topological complexity of generic hyperplane arrangements

Simple item page
dc.creatorYuzvinsky, Sergey
dc.date2007-01-16
dc.date.accessioned2026-07-07T07:41:18Z
dc.date.available2026-07-07T07:41:18Z
dc.descriptionWe 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\}$.
dc.identifierhttps://arxiv.org/abs/math/0701445
dc.identifierhttp://arxiv.org/abs/math/0701445
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122056
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject52C35, 55R80
dc.titleTopological complexity of generic hyperplane arrangements
dc.typetext

Files

Collections

arXiv