Computations in rational sectional category
classification
🧮 math.AT
keywords
categoryrationalsectionalcomplexitycomputeformalgivespaces
read the original abstract
We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches its cohomological lower bound and give a method to compute higher topological complexity of formal spaces in terms of their cohomology.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.