论文标题
建造堆盖的数据
Building Data for Stacky Covers
论文作者
论文摘要
我们以帕迪尼精神定义了堆积盖的堆积建筑数据，并在堆积封面类别和堆栈建筑数据的类别之间给出了（2,1） - 类别的等效性。我们表明，从奥尔森（Olsson）和伯恩（Borne）的意义上讲，每个二叠纪盖都是平坦的根堆叠 - vistoli，并将其作为使用堆栈建筑物数据的根堆栈提供了固有的描述。当基本方案s在一个字段上定义时，我们为何时来自有限的阿贝尔小组方案的驯服覆盖范围何时给出了标准，从而概括了biswas-borne的结果。
We define stacky building data for stacky covers in the spirit of Pardini and give an equivalence of (2,1)-categories between the category of stacky covers and the category of stacky building data. We show that every stacky cover is a flat root stack in the sense of Olsson and Borne--Vistoli and give an intrinsic description of it as a root stack using stacky building data. When the base scheme S is defined over a field, we give a criterion for when a birational building datum comes from a tamely ramified cover for a finite abelian group scheme, generalizing a result of Biswas--Borne.
