2000 character limit reached
Gray tensor product and saturated $N$-complicial sets (2007.01235v1)
Published 2 Jul 2020 in math.AT and math.CT
Abstract: We show that the pretensor and tensor products of simplicial sets with marking are compatible with the homotopy theory of saturated $N$-complicial sets (which are a proposed model of $(\infty,N)$-categories), in the form of a Quillen bifunctor and a homotopical bifunctor, respectively.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.