The Use of S-Functions in Combinatorial Analysis
Author:
- Ronald C. ReadRRRonald C. Read
- 1 January 1968
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 20, 808-841
Abstract
The aim of this paper is to present a unified treatment of certain theorems in Combinatorial Analysis (particularly in enumerative graph theory), and their relations to various results concerning symmetric functions and the characters of the symmetric groups. In particular, it treats of the simplification that is achieved by working with S-functions in preference to other symmetric functions when dealing with combinatorial problems. In this way it helps to draw closer together the two subjects of Combinatorial Analysis and the theory of Finite Groups. The paper is mainly expository; it contains little that is really new, though it displays several old results in a new setting.Keywords
This publication has 1 reference indexed in Scilit:
- Improved Methods to Calculate the Characters of the Symmetric GroupMathematics of Computation, 1960