Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.