Admissible orders and linear forms
ACM SIGSAM Bulletin
Gro¨bner bases: a computational approach to commutative algebra
Gro¨bner bases: a computational approach to commutative algebra
Computing bases for rings of permutation-invariant polynomials
Journal of Symbolic Computation
A constructive description of SAGBI bases for polynomial invariants of permutations groups
Journal of Symbolic Computation
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Hi-index | 0.00 |
It is well-known, that the ring C[X1,..., Xn]An of polynomial invariants of the alternating group An has no finite SAGBI basis with respect to the lexicographical order for any number of variables n ≥ 3. This note proves the existence of a nonsingular matrix δn ∈ GL(n, C) such that the ring of polynomial invariants C[X1,..., Xn]Anδn, where Anδn denotes the conjugate of An with respect to δn, has a finite SAGBI basis for any n ≥ 3.