Back to Search
Start Over
Computing quotients by connected solvable groups.
- Source :
-
Journal of Symbolic Computation . Mar2022, Vol. 109, p426-440. 15p. - Publication Year :
- 2022
-
Abstract
- Consider an action of a connected solvable group G on an affine variety X. This paper presents an algorithm that constructs a semi-invariant f ∈ K [ X ] = : R and computes the invariant ring (R f) G together with a presentation. The morphism X f → Spec ((R f) G) obtained from the algorithm is a universal geometric quotient. In fact, it is even better than that: a so-called excellent quotient. If R is a polynomial ring, the algorithm requires no Gröbner basis computations. If R is a complete intersection, then so is (R f) G. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GROBNER bases
*POLYNOMIAL rings
*ALGORITHMS
*MORPHISMS (Mathematics)
Subjects
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 109
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 152557013
- Full Text :
- https://doi.org/10.1016/j.jsc.2020.07.014