Papers
Topics
Authors
Recent
Search
2000 character limit reached

Białynicki-Birula decomposition for reductive groups

Published 29 May 2018 in math.AG and math.RT | (1805.11558v3)

Abstract: We generalize the Bia{\l}ynicki-Birula decomposition from actions of GmG_m on smooth varieties to actions of linearly reductive group G{\bf 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{\l}ynicki-Birula decomposition functorially: for a fixed G{\bf G}-scheme XX and a monoid G\overline{\bf G} which partially compactifies G{\bf G}, the BB decomposition parameterizes G{\bf G}-schemes over XX for which the G{\bf G}-action extends to the G\overline{\bf G}-action. The freedom of choice of G\overline{\bf G} makes the theory richer than the GmG_m-case.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

Open Problems

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

Continue Learning

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