Papers
Topics
Authors
Recent
Search
2000 character limit reached

Analog category and complexity

Published 28 Jan 2024 in math.AT and math.GT | (2401.15667v2)

Abstract: We study probabilistic variants of the Lusternik--Schnirelmann category and topological complexity, which bound the classical invariants from below. We present a number of computations illustrating both wide agreement and wide disagreement with the classical notions. In the aspherical case, where our invariants are group invariants, we establish a counterpart of the Eilenberg--Ganea theorem in the torsion-free case, as well as a contrasting universal upper bound in the finite case.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

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

Continue Learning

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

Authors (2)

Collections

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

Tweets

Sign up for free to view the 2 tweets with 3 likes about this paper.