2000 character limit reached
Fundamental pushouts of n-complicial sets
Published 12 May 2020 in math.AT and math.CT | (2005.05844v1)
Abstract: The paper focuses on investigating how certain relations between strict $n$-categories are preserved in a particular implementation of $(\infty,n)$-categories, given by saturated $n$-complicial sets. In this model, we show that the $(\infty,n)$-categorical nerve of $n$-categories is homotopically compatible with $1$-categorical suspension and wedge. As an application, we show that certain pushouts encoding composition in $n$-categories are homotopy pushouts of saturated $n$-complicial sets.
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.