Abstract
A polynomial f(x 1,…,xn) is called symmetric if, for any permutation σ ∈ S n, we have
The main examples of symmetric polynomials are the elementary symmetric polynomials
where 1 ≤ k ≤ n. It is convenient to set σ0 = 1 and σk(x,..., x n ) = 0 for k > n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Prasolov, V.V. (2004). Polynomials of a Particular Form. In: Polynomials. Algorithms and Computation in Mathematics, vol 11. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03980-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-03980-5_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03979-9
Online ISBN: 978-3-642-03980-5
eBook Packages: Springer Book Archive