2019
DOI: 10.1016/j.matpur.2019.04.006
|View full text |Cite
|
Sign up to set email alerts
|

Białynicki-Birula decomposition for reductive groups

Abstract: We generalize the Białynicki-Birula decomposition from actions of G m on smooth varieties to actions of linearly reductive group G on finite type schemes and algebraic spaces. We also provide a relative version and briefly discuss the case of algebraic stacks.We define the Białynicki-Birula decomposition functorially: for a fixed G-scheme X and a monoid G which partially compactifies G, the BB decomposition parameterizes G-schemes over X for which the G-action extends to the G-action. The freedom of choice of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
19
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 20 publications
(20 citation statements)
references
References 29 publications
1
19
0
Order By: Relevance
“…See [3] for the original exposition. A vast generalization of this result, which is also valid for singular varieties, can be found in a recent paper [19] and references therein.…”
Section: Remarkmentioning
confidence: 67%
“…See [3] for the original exposition. A vast generalization of this result, which is also valid for singular varieties, can be found in a recent paper [19] and references therein.…”
Section: Remarkmentioning
confidence: 67%
“…Remark Representability of the functor prefixHilb pt +false(double-struckAfalse) follows also from [, Proposition 5.3] as the Hilbert scheme has a covering by Gm‐stable affine open subschemes [, Chapter 18]. However, the embedding ι is crucial for constructing obstruction theories for prefixHilb pt +false(double-struckAfalse) in Section 4.…”
Section: The Białynicki–birula Decompositionmentioning
confidence: 96%
“…Upon completion of this work, we learned that the Białynicki–Birula decomposition for algebraic spaces was constructed earlier by Drinfeld , by an entirely different method. His method was extended to actions of groups other than Gm. While this paper was in review, a preprint appeared, which in particular claims to answer Question .…”
Section: Introductionmentioning
confidence: 99%
“…The Białynicki–Birula decomposition was studied recently by Drinfeld and Gaitsgory [23] with an application to derived categories. In their construction, the functorial properties of the stable and unstable sets for a Gm–action play a crucial role, see also [35]. We need the functorial properties of the Białynicki–Birula decomposition to control the asymptotic behavior of the motivic Chern classes.…”
Section: Newton Polytope Properties Of Motivic Chern Classes Of Subvamentioning
confidence: 99%