COMPUTING QUOTIENTS BY CONNECTED SOLVABLE GROUPS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

COMPUTING QUOTIENTS BY CONNECTED SOLVABLE GROUPS

Gregor Kemper
  • Function : Author

Abstract

This paper introduces the notion of an excellent quotient, which is stronger than a universal geometric quotient. The main result is that for an action of a connected solvable group $G$ on an affine scheme Spec$(R)$ there exists a semi-invariant $f$ such that Spec$(R_f) \to$ Spec$((R_f)^G)$ is an excellent quotient. The paper contains an algorithm for computing $f$ and $(R_f)^G$. If $R$ is a polynomial ring over a field, the algorithm requires no Gr\"obner basis computations, and it also computes a presentation of $(R_f)^G$. In this case, $(R_f)^G$ is a complete intersection. The existence of an excellent quotient extends to actions on quasi-affine schemes
Fichier principal
Vignette du fichier
14.pdf (365.43 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02912346 , version 1 (05-08-2020)

Identifiers

  • HAL Id : hal-02912346 , version 1

Cite

Gregor Kemper. COMPUTING QUOTIENTS BY CONNECTED SOLVABLE GROUPS. MEGA 2019 - International Conference on Effective Methods in Algebraic Geometry, Jun 2019, Madrid, Spain. ⟨hal-02912346⟩

Collections

MEGA MEGA2019
49 View
115 Download

Share

Gmail Facebook X LinkedIn More