A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Symmetric functions, $m$-sets, and Galois groups

1994
*
Mathematics of Computation
*

Given the elementary symmetric functions in {r,} (i = 1, ..., n), we describe algorithms to compute the elementary symmetric functions in the products {fyr¡2 ■■•r¡m} (1 < ix < ••• < im < n) and in the sums {ri{ + r¡2 + ■ ■ ■ + rim] (1 < i] < • • • < i'm < 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.

doi:10.1090/s0025-5718-1994-1234424-5
fatcat:6ahim2hjxjabtl3slw2tm6as2i