2000 character limit reached
The "Galois Correspondence" for n-Stacks (2408.00281v4)
Published 1 Aug 2024 in math.AT and math.AG
Abstract: We prove an essentially surjective Galois-correspondence-like functor for $n$-stacks. More specifically, it gives an essentially surjective functor from the $\infty$-category of $n$-stacks of finite sets with an action of the fundamental group of $X$ to the $\infty$-category of Deligne-Mumford $n$-stacks finite \'etale over a connected scheme $X$.
Sponsor
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.