2000 character limit reached
Topological Complexity of H-Spaces
Published 17 Jun 2011 in math.AT | (1106.3399v1)
Abstract: Let X be a (not-necessarily homotopy-associative) H-space. We show that TC_{n+1}(X) = cat(Xn), for n >= 1, where TC_{n+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 TC_{n+1}(X), in the setting of a space Y acting on X.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.