Evaluation properties of symmetric polynomials - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Algebra and Computation Year : 2006

Evaluation properties of symmetric polynomials

Abstract

By the fundamental theorem of symmetric polynomials, if $P \in \Q[X_1,\dots,X_n]$ is symmetric, then it can be written $P=Q(\sigma_1,\dots,\sigma_n)$, where $\sigma_1,\dots,\sigma_n$ are the elementary symmetric polynomials in $n$ variables, and $Q$ is in $\Q[S_1,\dots,S_n]$. We investigate the complexity properties of this construction in the straight-line program model, showing that the complexity of evaluation of $Q$ depends only on $n$ and on the complexity of evaluation of $P$. Similar results are given for the decomposition of a general polynomial in a basis of $\Q[X_1,\dots,X_n]$ seen as a module over the ring of symmetric polynomials, as well as for the computation of the Reynolds operator.
Fichier principal
Vignette du fichier
sym.pdf (205.42 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00000629 , version 1 (10-11-2005)

Identifiers

Cite

Pierrick Gaudry, Eric Schost, Nicolas M. Thiéry. Evaluation properties of symmetric polynomials. International Journal of Algebra and Computation, 2006, 16 (3), pp.505 - 523. ⟨10.1142/S0218196706003128⟩. ⟨inria-00000629⟩
191 View
1431 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More