Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials
- 43 Downloads
Any symmetric polynomial f∈R[X1, …, Xn] has a unique representation f = p(σ1, …, σn) with p∈R[X1, …, Xn] in the elementary symmetric polynomials σ1, …, σn. This paper investigates higher order symmetric polynomials; these are symmetric polynomials with a representation p, which is also symmetric. We present rewriting techniques for higher order symmetric polynomials and exact degree bounds for the generators of the corresponding invariant rings. Moreover, we point out how algorithms and degree bounds for these polynomials are related to Pascals triangle, Fibonacci numbers, Chebyshev polynomials, and cardinalities of finite distributive lattices of semi-ideals.
Unable to display preview. Download preview PDF.