Bounds for higher topological complexity of real projective space\n implied by BP Article Swipe
Related Concepts
Topological complexity
Cohomology
Mathematics
Projective test
Topology (electrical circuits)
Projective space
Real projective space
Space (punctuation)
Pure mathematics
Topological space
Discrete mathematics
Complex projective space
Combinatorics
Computer science
Operating system
Donald M. Davis
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1801.06006
· OA: W4300908646
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1801.06006
· OA: W4300908646
We use Brown-Peterson cohomology to obtain lower bounds for the higher\ntopological complexity, TC_k(RP^n), of real projective spaces, which are often\nmuch stronger than those implied by ordinary mod-2 cohomology.\n
Related Topics
Finding more related topics…