2000 character limit reached
Analog category and complexity (2401.15667v2)
Published 28 Jan 2024 in math.AT and math.GT
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.
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.