Computation of invariants for reductive groups

被引：37
作者：
Derksen, H [1 ]
机构：
[1] Northeastern Univ, Dept Math, Boston, MA 02155 USA
来源：
ADVANCES IN MATHEMATICS | 1999年 / 141卷 / 02期
关键词：
D O I：
10.1006/aima.1998.1787
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We will give an algorithm for computing generators of the invariant ring for a given representation of a linearly reductive group. The algorithm basically consists of a single Grobner basis computation. We will also show a connection between some open conjectures in commutative algebra and finding good degree bounds for generating invariants. (C) 1999 Academic Press.
引用
收藏
页码：366 / 384
页数：19
相关论文
共 44 条
[1]  
Adams W.W., 1994, GRADUATE STUDIES MAT, V3
[2]  
[Anonymous], 1995, GRADUATE TEXTS MATH
[3]  
[Anonymous], 1987, FUNKTSIONAL ANAL PRI
[4]   PICARD GROUP AND EIGENVALUES OF SPHERICAL MANIFOLDS [J].
BRION, M .
DUKE MATHEMATICAL JOURNAL, 1989, 58 (02) :397-424
[5]  
COX D, 1992, IDEALS VARIETIES ALG
[6]  
DERKSEN H, 1997, THESIS U BASEL
[7]  
DERKSEN H, IN PRESS C SEMINAIRE
[8]  
DERKSEN H, 1997, POLYNOMIAL BOUNDS IN
[9]   LINEAR FREE RESOLUTIONS AND MINIMAL MULTIPLICITY [J].
EISENBUD, D ;
GOTO, S .
JOURNAL OF ALGEBRA, 1984, 88 (01) :89-133
[10]  
Fulton W., 2013, INTERSECTION THEORY, DOI DOI 10.1007/978-3-662-02421-8
12345