Papers
Topics
Authors
Recent
Search
2000 character limit reached

The $n$-fold reduced bar construction

Published 24 Sep 2013 in math.CT | (1309.6209v8)

Abstract: This paper is about a correspondence between monoidal structures in categories and $n$-fold loop spaces. We develop a new syntactical technique whose role is to substitute the coherence results, which were the main ingredients in the proofs that the Segal-Thomason bar construction provides an appropriate simplicial space. The results we present here enable more common categories to enter this delooping machine. For example, such is the category of finite sets with two monoidal structures brought by the disjoint union and Cartesian product.

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.