2000 character limit reached
Segal's multisimplicial spaces
Published 15 Jul 2014 in math.AT | (1407.3914v10)
Abstract: Some sufficient conditions on a simplicial space $X$ guaranteeing that $X_1\simeq \Omega|X|$ were given by Segal. We give a generalization of this result for multisimplicial spaces. This generalization is appropriate for the reduced bar construction, providing an $n$-fold delooping of the classifying space of a category.
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.