## Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

# Symmetric Functions, m-Sets, and Galois Groups

David Casperson and John McKay
Mathematics of Computation
Vol. 63, No. 208 (Oct., 1994), pp. 749-757
DOI: 10.2307/2153295
Stable URL: http://www.jstor.org/stable/2153295
Page Count: 9
Preview not available

## Abstract

Given the elementary symmetric functions in {ri} (i = 1, ..., n) we describe algorithms to compute the elementary symmetric functions in the products $\{r_{i_1} r_{i_2} \cdots r_{i_m}\} (1 \leq i_1 < \cdots < i_m \leq n)$ and in the sums $\{r_{i_1} + r_{i_2} + \cdots + r_{i_m}\} (1 \leq i_1 < \cdots < i_m \leq n)$. The computation is performed over the coefficient ring generated by the elementary symmetric functions. We apply FFT multiplication of series to reduce the complexity of the algorithm for sums. An application to computing Galois groups is given.

• 749
• 750
• 751
• 752
• 753
• 754
• 755
• 756
• 757