Computational problems in š¯‘†-function theory
P. A. Morris Ā· Mathematics of Computation Ā· 1973
In this paper we discuss some computational problems associated with Schur-functions. A well-known algorithm for the ordinary product is described and adapted for a computer. A theorem of Todd is discussed in the same way, and these methods are combined to produce a general program for the plethysm (wreath product) of two S -functions.