Hostname: page-component-84b7d79bbc-g7rbq Total loading time: 0 Render date: 2024-07-28T20:33:01.631Z Has data issue: false hasContentIssue false
  • English
  • Français

On Redfield's Group Reduction Functions

Published online by Cambridge University Press:  20 November 2018

H. O. Foulkes
H. O. Foulkes*
Affiliation:
University College Swansea, Great Britain
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.

In 1927, J. H. Redfield (12), discussed some of the links between combinatorial analysis and permutation groups, including such topics as group transitivity, the enumeration of certain geometrical configurations, and the construction of various permutation isomorphs of a given group. Except for a revision of Redfield's treatment of transitivity by D. E. Littlewood (6), this 1927 paper appears to have been overlooked. However, it has recently been described (5) as a remarkable pioneering paper which appears to contain or anticipate virtually all of the enumeration results for graphs which have been discovered and developed during the last thirty years.

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 15 , 1963 , pp. 272 - 284
Copyright
Copyright © Canadian Mathematical Society 1963

References

1. Burnside, W., Theory of groups of finite order, 2nd. ed. (Cambridge, 1911).Google Scholar
2. Foulkes, H. O., Differential operators associated with S-functions, J. London Math. Soc, 24 (1949), 136–143.Google Scholar
3. Hall, P., Cambridge lectures (unpublished).Google Scholar
4. Hall, M. Jr. , Theory of groups (New York, 1959).Google Scholar
5. Harary, F., Publ. Hung. Acad. Sci. 5 (1960), 92–93.Google Scholar
6. Littlewood, D. E., The theory of group characters and matrix representations of groups, 2nd ed. (Oxford, 1950).Google Scholar
7. MacMahon, P. A., Combinatory analysis I (Cambridge, 1915).Google Scholar
8. Murnaghan, F. D., The theory of group representations (Baltimore, 1938).Google Scholar
9. Pôlya, G., Kombinatorische Anzahlbestimmungen fur Gruppen, Graphen und chemische Verbindungen, Acta Math., 68 (1937), 145–254.Google Scholar
10. Read, R. C., The enumeration of locally restricted graphs, I, J. London Math. Soc. 84 (1959), 417–436.Google Scholar
11. Read, R. C. II, J. London Math. Soc, 85 (1960), 344–351.Google Scholar
12. Redfield, J. H., The theory of group reduced distributions, Amer. J. Math., 49 (1927), 433– 455.Google Scholar
13. Riordan, J., An introduction to combinatorial analysis (New York, 1958).Google Scholar
14. de, G. Robinson, B., Representation theory of the symmetric group (Edinburgh, 1961).Google Scholar