2000 character limit reached
2-Segal sets and the Waldhausen construction (1609.02853v3)
Published 9 Sep 2016 in math.AT, math.CT, and math.KT
Abstract: It is known by results of Dyckerhoff-Kapranov and of G\'alvez--Carrillo-Kock-Tonks that the output of the Waldhausen S.-construction has a unital 2-Segal structure. Here, we prove that a certain S.-functor defines an equivalence between the category of augmented stable double categories and the category of unital 2-Segal sets. The inverse equivalence is described explicitly by a path construction. We illustrate the equivalence for the known examples of partial monoids, cobordism categories with genus constraints and graph coalgebras.
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.