Computing bases for rings of permutation-invariant polynomials (Q1897551)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing bases for rings of permutation-invariant polynomials |
scientific article; zbMATH DE number 792833
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing bases for rings of permutation-invariant polynomials |
scientific article; zbMATH DE number 792833 |
Statements
Computing bases for rings of permutation-invariant polynomials (English)
0 references
20 February 1996
0 references
Let \(R[X_1, \ldots, X_n]\) be the polynomial ring in \(X_1, \ldots, X_n\) where \(R\) is a unitary commutative ring. Given any subgroup \(G\) of the group of permutations of the set \(\{X_1, \ldots, X_n\}\), call \(S : = R[X_1, \ldots, X_n]^G\) the \(R\)-algebra of \(G\)-invariant polynomials. In this paper it is showed how to obtain a basis \(B\) for the \(R\)-algebra \(S\) and it is given an algorithm which allows to represent any element of \(S\) as a linear combination of elements of \(B\) with coefficients in \(R [\sigma_1, \ldots, \sigma_n]\) (where \(\sigma_1, \ldots, \sigma_n\) are the elementary symmetric polynomials). Moreover it is proved that the elements of \(B\) are polynomials of degree bounded by \(\max \{n, n(n - 1)/2\}\). The construction given is independent of the ground ring \(R\).
0 references
basis for the algebra of invariant polynomials
0 references
algorithm
0 references