<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2005-07-11 17:31:38Polynomials Computer algebra Algebra Symmetric functions Symmetric polynomial Finite field Irreducible polynomial Elementary symmetric polynomial XTR Resultant Splitting circle method Factorization of polynomials over finite fields |
Add to Reading List |
Fast Computation of Special Resultants ´ Alin Bostan a Philippe Flajolet a Bruno Salvy a Eric Schost b a Algorithms
![SYMMETRIC POLYNOMIALS KEITH CONRAD Let F be a field. A polynomial f (X1 , . . . , Xn ) ∈ F [X1 , . . . , Xn ] is called symmetric if it is unchanged by any permutation of its variables: f (X1 , . . . , Xn ) = f (Xσ(1)](https://www.pdfsearch.io/img/a4c59afb6c9ffcbf43ae8f71688c060f.jpg "SYMMETRIC POLYNOMIALS KEITH CONRAD Let F be a field. A polynomial f (X1 , . . . , Xn ) ∈ F [X1 , . . . , Xn ] is called symmetric if it is unchanged by any permutation of its variables: f (X1 , . . . , Xn ) = f (Xσ(1)")
