Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 226

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Tame stacks in positive characteristic

Open access
Abramovich, Dan, Olsson, Martin, Vistoli, Angelo·2008·Annales de l'Institut Fourier

Abstract

We introduce and study a class of algebraic stacks with finite inertia in positive and mixed characteristic, which we call tame algebraic stacks. They include tame Deligne-Mumford stacks, and are arguably better behaved than general Deligne-Mumford stacks. We also give a complete characterization of finite flat linearly reductive schemes over an arbitrary base. Our main result is that tame algebraic stacks are étale locally quotient by actions of linearly reductive finite group schemes.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.5802/aif.2378

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 226

Metadata

Authors
Abramovich, D., Olsson, M., & Vistoli, A.
Venue
Annales de l'Institut Fourier
Published
2008
Volume
58
Issue
4
Pages
1057-1091
ISSN
  • 0373-0956 (ISSN-L)
  • 1777-5310
OpenAlex
W1678187845
Cited by
226
References
1
FWCI
12.97
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Tame stacks in positive characteristic. https://app.cochat.ai/papers/10.5802/aif.2378
The paper
Abramovich, D., Olsson, M., & Vistoli, A. (2008). Tame stacks in positive characteristic. Annales de l'Institut Fourier. https://doi.org/10.5802/aif.2378

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.