The Use of S-Functions in Combinatorial Analysis
The Use of S-Functions in Combinatorial Analysis
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 …