Papers
Topics
Authors
Recent
Search
2000 character limit reached

Descent for algebraic stacks

Published 18 Apr 2025 in math.AG and math.NT | (2504.13642v1)

Abstract: We prove that algebraic stacks satisfy 2-descent for fppf coverings. We generalize Galois descent for schemes to stacks, by considering the case where the fppf covering is a finite Galois covering and reformulating 2-descent data for stacks in terms of group actions on the stack.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Olivier de Gaay Fortman 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up