Publication

Topological Complexity Of H-Spaces

Jérôme Scherer
2013
Journal Articles

Abstract

Let X be a (not-necessarily homotopy-associative) H-space. We show that TCn+1(X) = cat(X-n), for n >= 1, where TCn+1(-) denotes the so-called higher topological complexity introduced by Rudyak, and cat(-) denotes the Lusternik-Schnirelmann category. We also generalize this equality to an inequality, which gives an upper bound for TCn+1(X), in the setting of a space Y acting on X.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Topological Complexity Of H-Spaces

Chat with Graph Search

Conditional Flatness, Fiberwise Localizations, And Admissible Reflections

Bounded and unbounded cohomology of homeomorphism and diffeomorphism groups

Persistence and the Sheaf-Function Correspondence