当前位置:
X-MOL 学术
›
J. Symb. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Computing quotients by connected solvable groups
Journal of Symbolic Computation ( IF 0.7 ) Pub Date : 2020-07-08 , DOI: 10.1016/j.jsc.2020.07.014 Gregor Kemper
中文翻译:
通过连接的可解群计算商
更新日期:2020-07-08
Journal of Symbolic Computation ( IF 0.7 ) Pub Date : 2020-07-08 , DOI: 10.1016/j.jsc.2020.07.014 Gregor Kemper
Consider an action of a connected solvable group G on an affine variety X. This paper presents an algorithm that constructs a semi-invariant and computes the invariant ring together with a presentation. The morphism 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 .
中文翻译:
通过连接的可解群计算商
考虑一个连通可解群G对仿射变体X 的动作。本文提出了一种构造半不变量的算法 并计算不变环 连同演示文稿。态射从算法中获得的是一个通用几何商。事实上,它甚至比这更好:一个所谓的优商。如果R是多项式环,则该算法不需要 Gröbner 基计算。如果R是完全交集,那么也是.