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 on smooth varieties to actions of linearly reductive group 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 -scheme and a monoid which partially compactifies , the BB decomposition parameterizes -schemes over for which the -action extends to the -action. The freedom of choice of makes the theory richer than the -case.
Paper Prompts
Sign up for free to create and run prompts on this paper.