Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T21:15:55.435Z Has data issue: false hasContentIssue false

Redfield's Theorems and Multilinear Algebra

Published online by Cambridge University Press:  20 November 2018

Dennis E. White*
Affiliation:
University of California, San Diego, La Jolla, California ; University of Minnesota, Minneapolis, Minnesota
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

1. Introduction. The remarkable 1927 paper by J. H. Redfield [13] which anticipated many recent combinatorial results in Polya counting theory and, in fact, predated Polya's theorem by ten years has been discussed at length by Harary and Palmer [8], Foulkes [5; 6], Sheehan [15; 16] and Read [12], not to mention de Bruijn [3] and others. We shall, in this paper, demonstrate how multilinear techniques may be used in this context. The Redfield superposition theorem and decomposition theorem turn out to be statements about a group acting on finite function spaces, and may thus be dealt with in multilinear terms. We shall prove Redfield's results and an extension due to Foulkes [5].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1975