Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Symmetric functions, $m$-sets, and Galois groups
HTML articles powered by AMS MathViewer

by David Casperson and John McKay PDF
Math. Comp. 63 (1994), 749-757 Request permission

Abstract:

Given the elementary symmetric functions in $\{ {r_i}\} \;(i = 1, \ldots ,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.
References
Similar Articles
Additional Information
  • © Copyright 1994 American Mathematical Society
  • Journal: Math. Comp. 63 (1994), 749-757
  • MSC: Primary 12-04; Secondary 05-04, 05E15, 12F10
  • DOI: https://doi.org/10.1090/S0025-5718-1994-1234424-5
  • MathSciNet review: 1234424