Title of article :
Computing Bases for Rings of Permutation-invariant Polynomials
Author/Authors :
Manfred Gobel، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Pages :
7
From page :
285
To page :
291
Abstract :
Let R be a commutative ring with 1, let R [X1,…,Xn] be the polynomial ring in X1,…,Xn over R and let G be an arbitrary group of permutations of {X1,…,Xn}. The paper presents an algorithm for computing a small finite basis B of the R-algebra of G-invariant polynomials and a polynomial representation of an arbitrary G-invariant polynomial in R [X1,…,Xn] as a polynomial in the polynomials of the finite basis B. The algorithm works independently of the ground ring R, and the basis B contains only polynomials of total degree ≤ max{n, n(n - 1)/2}, independent of the size of the permutation group G.
Journal title :
Journal of Symbolic Computation
Serial Year :
1995
Journal title :
Journal of Symbolic Computation
Record number :
805063
Link To Document :
بازگشت