This volume offers mathematicians and students an account of the theorems employed in combinatory analysis, showing their connections and bringing them together as parts of a general doctrine. Combinatory analysis as considered in this work occupies the ground between algebra and the higher arithmetic; the methods used here are distinctly algebraic and not arithmetic.
The first section shows that the general theory of combination is essentially involved in the algebra of monomial symmetric functions. The following section extends the simple theory of symmetric functions, making the point of departure no longer an integer, but the partition of an integer; thus, students deal not with the partitions of a number, but with the separations of a partition. This extension is important to the theory of distributions, and it enables the intuitive derivation of many theorems of algebraic reciprocity.
The third section is devoted to certain points in the theory of permutations that are of value in theories of combination or distribution, and the fourth section is entirely concerned with the compositions of numbers. The final sections deal with the perfect partitions of numbers as a necessary preliminary to the discussion of arrangements on a chessboard, and with the direct application of the theory of distributions to the enumeration of the partitions of multipartite numbers.