1911 Encyclopædia Britannica/Combinatorial Analysis

COMBINATORIAL ANALYSIS. The Combinatorial Analysis, as it was understood up to the end of the 18th century, was of limited scope and restricted application. P. Nicholson, in his Essays on the Combinatorial Analysis, published in 1818, states that “the Combinatorial Analysis is a branch of mathematics which teaches us to ascertain Historical Introduction. and exhibit all the possible ways in which a given number of things may be associated and mixed together; so that we may be certain that we have not missed any collection or arrangement of these things that has not been enumerated.” Writers on the subject seemed to recognize fully that it was in need of cultivation, that it was of much service in facilitating algebraical operations of all kinds, and that it was the fundamental method of investigation in the theory of Probabilities. Some idea of its scope may be gathered from a statement of the parts of algebra to which it was commonly applied, viz., the expansion of a multinomial, the product of two or more multinomials, the quotient of one multinomial by another, the reversion and conversion of series, the theory of indeterminate equations, &c. Some of the elementary theorems and various particular problems appear in the works of the earliest algebraists, but the true pioneer of modern researches seems to have been Abraham Demoivre, who first published in Phil. Trans. (1697) the law of the general coefficient in the expansion of the series a + bx + cx² + dx³ + . . . raised to any power. (See also Miscellanea Analytica, bk. iv. chap. ii. prob. iv.) His work on Probabilities would naturally lead him to consider questions of this nature. An important work at the time it was published was the De Partitione Numerorum of Leonhard Euler, in which the consideration of the reciprocal of the product (1 − xz) (1 − x²z) (1 − x³z) . . . establishes a fundamental connexion between arithmetic and algebra, arithmetical addition being made to depend upon algebraical multiplication, and a close bond is secured between the theories of discontinuous and continuous quantities. (Cf. Numbers, Partition of.) The multiplication of the two powers xa, xb, viz. xa + xb = xa+b, showed Euler that he could convert arithmetical addition into algebraical multiplication, and in the paper referred to he gives the complete formal solution of the main problems of the partition of numbers. He did not obtain general expressions for the coefficients which arose in the expansion of his generating functions, but he gave the actual values to a high order of the coefficients which arise from the generating functions corresponding to various conditions of partitionment. Other writers who have contributed to the solution of special problems are James Bernoulli, Ruggiero Guiseppe Boscovich, Karl Friedrich Hindenburg (1741–1808), William Emerson (1701–1782), Robert Woodhouse (1773–1827), Thomas Simpson and Peter Barlow. Problems of combination were generally undertaken as they became necessary for the advancement of some particular part of mathematical science: it was not recognized that the theory of combinations is in reality a science by itself, well worth studying for its own sake irrespective of applications to other parts of analysis. There was a total absence of orderly development, and until the first third of the 19th century had passed, Euler’s classical paper remained alike the chief result and the only scientific method of combinatorial analysis.

In 1846 Karl G. J. Jacobi studied the partitions of numbers by means of certain identities involving infinite series that are met with in the theory of elliptic functions. The method employed is essentially that of Euler. Interest in England was aroused, in the first instance, by Augustus De Morgan in 1846, who, in a letter to Henry Warburton, suggested that combinatorial analysis stood in great need of development, and alluded to the theory of partitions. Warburton, to some extent under the guidance of De Morgan, prosecuted researches by the aid of a new instrument, viz. the theory of finite differences. This was a distinct advance, and he was able to obtain expressions for the coefficients in partition series in some of the simplest cases (Trans. Camb. Phil. Soc., 1849). This paper inspired a valuable paper by Sir John Herschel (Phil. Trans. 1850), who, by introducing the idea and notation of the circulating function, was able to present results in advance of those of Warburton. The new idea involved a calculus of the imaginary roots of unity. Shortly afterwards, in 1855, the subject was attacked simultaneously by Arthur Cayley and James Joseph Sylvester, and their combined efforts resulted in the practical solution of the problem that we have to-day. The former added the idea of the prime circulator, and the latter applied Cauchy’s theory of residues to the subject, and invented the arithmetical entity termed a denumerant. The next distinct advance was made by Sylvester, Fabian Franklin, William Pitt Durfee and others, about the year 1882 (Amer. Journ. Math. vol. v.) by the employment of a graphical method. The results obtained were not only valuable in themselves, but also threw considerable light upon the theory of algebraic series. So far it will be seen that researches had for their object the discussion of the partition of numbers. Other branches of combinatorial analysis were, from any general point of view, absolutely neglected. In 1888 P. A. MacMahon investigated the general problem of distribution, of which the partition of a number is a particular case. He introduced the method of symmetric functions and the method of differential operators, applying both methods to the two important subdivisions, the theory of composition and the theory of partition. He introduced the notion of the separation of a partition, and extended all the results so as to include multipartite as well as unipartite numbers. He showed how to introduce zero and negative numbers, unipartite and multipartite, into the general theory; he extended Sylvester’s graphical method to three dimensions; and finally, 1898, he invented the “Partition Analysis” and applied it to the solution of novel questions in arithmetic and algebra. An important paper by G. B. Mathews, which reduces the problem of compound partition to that of simple partition, should also be noticed. This is the problem which was known to Euler and his contemporaries as “The Problem of the Virgins,” or “the Rule of Ceres”; it is only now, nearly 200 years later, that it has been solved.

The most important problem of combinatorial analysis is connected with the distribution of objects into classes. A number n may be regarded as enumerating n similar objects; it is then said to be unipartite. On the other hand, if the objects be not all similar they cannot be effectively enumerated Fundamental problem. by a single integer; we require a succession of integers. If the objects be p in number of one kind, q of a second kind, r of a third, &c., the enumeration is given by the succession pqr . . . which is termed a multipartite number, and written,

pqr . . . ,

where p+q+r+ . . . = n. If the order of magnitude of the numbers p, q, r, . . . is immaterial, it is usual to write them in descending order of magnitude, and the succession may then be termed a partition of the number n, and is written (pqr . . .). The succession of integers thus has a twofold signification: (i.) as a multipartite number it may enumerate objects of different kinds; (ii.) it may be viewed as a partitionment into separate parts of a unipartite number. We may say either that the objects are represented by the multipartite number pqr . . ., or that they are defined by the partition (pqr . . . ) of the unipartite number n. Similarly the classes into which they are distributed may be m in number all similar; or they may be p1 of one kind, q1 of a second, r1 of a third, &c., where p1 + q1 + r1 + . . . = m. We may thus denote the classes either by the multipartite numbers ________
p1q1r1 . . .
, or by the partition (p1q1r1 . . . ) of the unipartite number m. The distributions to be considered are such that any number of objects may be in any one class subject to the restriction that no class is empty. Two cases arise. If the order of the objects in a particular class is immaterial, the class is termed a parcel; if the order is material, the class is termed a group. The distribution into parcels is alone considered here, and the main problem is the enumeration of the distributions of objects defined by the partition (pqr . . . ) of the number n into parcels defined by the partition (p1q1r1 . . . ) of the number m. (See “Symmetric Functions and the Theory of Distributions,” Proc. London Mathematical Society, vol. xix.) Three particular cases are of great importance. Case I. is the “one-to-one distribution,” in which the number of parcels is equal to the number of objects, and one object is distributed in each parcel. Case II. is that in which the parcels are all different, being defined by the partition (1111. . .), conveniently written (1m); this is the theory of the compositions of unipartite and multipartite numbers. Case III. is that in which the parcels are all similar, being defined by the partition (m); this is the theory of the partitions of unipartite and multipartite numbers. Previous to discussing these in detail, it is necessary to describe the method of symmetric functions which will be largely utilized.

Let α, β, γ, . . . be the roots of the equation

xna1xn−1 + a2xn−2 − . . . = 0

The symmetric function Σαpβqγr..., where p + q + r + ... = n is, in the partition notation, written (pqr . . .). Let A(pqr...), (p1q1r1...) denote the number of ways of distributing the n objects defined by the partition (pqr . . .) into the m parcels defined by the partition (p1q1r1 . . . ). The distribution function. The expression

ΣA(pqr. . .), (p1q1r1...) · (pqr. . .),

where the numbers p1, q1, r1 . . . are fixed and assumed to be in descending order of magnitude, the summation being for every partition (pqr. . .) of the number n, is defined to be the distribution function of the objects defined by (pqr. . .) into the parcels defined by (p1q1r1 . . . ). It gives a complete enumeration of n objects of whatever species into parcels of the given species.

1. One-to-One Distribution. Parcels m in number (i.e. m = n).—Let hs be the homogeneous product-sum of degree s of the quantities α, β, γ, . . . so Case I.that

(1 − αx. 1 − βx. 1 − γx. ...)−1 = 1 + h1x + h2x2 + h3x3 + ...

h1 = Σα = (1)
h2 = Σα2 + Σαβ = (2) + (12)
h3 = Σα3 + Σα2β + Σαβγ = (3) + (21) + (13).

Form the product hp1hq1hr1...

Any term in hp1 may be regarded as derived from p1 objects distributed into p1 similar parcels, one object in each parcel, since the order of occurrence of the letters α, β, γ, . . . in any term is immaterial. Moreover, every selection of p1 letters from the letters in αpβqγr . . . will occur in some term of hp1, every further selection of q1 letters will occur in some term of hq1, and so on. Therefore in the product hp1hq1hr1 . . . the term αpβqγr . . ., and therefore also the symmetric function (pqr . . .), will occur as many times as it is possible to distribute objects defined by (pqr . . .) into parcels defined by (p1q1r1 . . .) one object in each parcel. Hence


This theorem is of algebraic importance; for consider the simple particular case of the distribution of objects (43) into parcels (52), and represent objects and parcels by small and capital letters respectively. One distribution is shown by the scheme

a a a a b b b

wherein an object denoted by a small letter is placed in a parcel denoted by the capital letter immediately above it. We may interchange small and capital letters and derive from it a distribution of objects (52) into parcels (43); viz.:—

a a a a a b b.

The process is clearly of general application, and establishes a one-to-one correspondence between the distribution of objects (pqr . . .) into parcels (p1q1r1 . . .) and the distribution of objects (p1q1r1 . . .) into parcels (pqr . . .). It is in fact, in Case I., an intuitive observation that we may either consider an object placed in or attached to a parcel, or a parcel placed in or attached to an object. Analytically we have

Theorem.—“The coefficient of symmetric function (pqr . . .) in the development of the product hp1hq1hr1 . . . is equal to the coefficient of symmetric function (p1q1r1 . . .) in the development of the product hphqhr . . .

The problem of Case I. may be considered when the distributions are subject to various restrictions. If the restriction be to the effect that an aggregate of similar parcels is not to contain more than one object of a kind, we have clearly to deal with the elementary symmetric functions a1, a2, a3, . . . or (1), (12), (13), . . . in lieu of the quantities h1, h2, h3, . . . The distribution function has then the value ap1aq1ar1... or (1p1) (1q1) (1r1) ..., and by interchange of object and parcel we arrive at the well-known theorem of symmetry in symmetric functions, which states that the coefficient of symmetric function (pqr . . .) in the development of the product ap1aq1ar1 . . . in a series of monomial symmetric functions, is equal to the coefficient of the function (p1q1r1 . . .) in the similar development of the product apaqar . . . .

The general result of Case I. may be further analysed with important consequences.


X1 = (1)x1,
X2 = (2)x2 + (12)x2
X3 = (3)x3 + (21)x2x1 + (13)x3


and generally

Xs = Σ(λμν ...) xλ xμ xν . . .

the summation being in regard to every partition of s. Consider the result of the multiplication—

Xp1Xq1Xr1 ... = ΣP

To determine the nature of the symmetric function P a few definitions are necessary.

Definition I.—Of a number n take any partition (λ1λ2λ3 . . . λs) and separate it into component partitions thus:—

(λ1λ2) (λ3λ4λ5) (λ6)...

in any manner. This may be termed a separation of the partition, the numbers occurring in the separation being identical with those which occur in the partition. In the theory of symmetric functions the separation denotes the product of symmetric functions—


The portions (λ1λ2), (λ3λ4λ5), (λ6), . . . are termed separates, and if λ1 + λ2 = p1, λ3 + λ4 + λ5 = q1, λ6 = r1. . . be in descending order of magnitude, the usual arrangement, the separation is said to have a species denoted by the partition (p1q1r1 ...) of the number n.

Definition II.—If in any distribution of n objects into n parcels (one object in each parcel), we write down a number ξ, whenever we observe ξ similar objects in similar parcels we will obtain a succession of numbers ξ1, ξ2, ξ3,. . ., where (ξ1, ξ2, ξ3. . .) is some partition of n. The distribution is then said to have a specification denoted by the partition (ξ1ξ2ξ3. . .).

Now it is clear that P consists of an aggregate of terms, each of which, to a numerical factor près, is a separation of the partition of species (p1q1r1. . .). Further, P is the distribution function of objects into parcels denoted by (p1q1r1. . .), subject to the restriction that the distributions have each of them the specification denoted by the partition Employing a more general notation we may write

... = ΣPxσ1

and then P is the distribution function of objects into parcels (pπ1
...), the distributions being such as to have the specification . Multiplying out P so as to exhibit it as a sum of monomials, we get a result—

... = ΣΣθ (λl1
...) xσ1

indicating that for distributions of specification . there are θ ways of distributing n objects denoted by (λl1
...) amongst n parcels denoted by (pπ11 pπ22 pπ33 ...), one object in each parcel. Now observe that as before we may interchange parcel and object, and that this operation leaves the specification of the distribution unchanged. Hence the number of distributions must be the same, and if

... ... = ... + θ (λl1
...) xσ1
... + ...

then also

Xl1λ1 Xl2λ2 Xl3λ3 ... = ... + θ (pπ11 pπ22 pπ33 ...) xσ1
... + ...

This extensive theorem of algebraic reciprocity includes many known theorems of symmetry in the theory of Symmetric Functions.

The whole of the theory has been extended to include symmetric functions symbolized by partitions which contain as well zero and negative parts.

2. The Compositions of Multipartite Numbers. Parcels denoted by (Im).—There are here no similarities between the parcels.

Case II.

Let (π1 π2 π3) be a partition of m.     

...) a partition of n.

Of the whole number of distributions of the n objects, there will be a certain number such that n1 parcels each contain p1 objects, and in general πs parcels each contain ps objects, where s = 1, 2, 3, ... Consider the product hπ1
... which can be permuted in m!/π1!π2!π3! ... ways. For each of these ways hπ1
... will be a distribution function for distributions of the specified type. Hence, regarding all the permutations, the distribution function is

m! hπ1
π1!π2!π3! ...

and regarding, as well, all the partitions of n into exactly m parts, the desired distribution function is

Σ m! hπ1
...   [Σπ = m, Σπp = n],
π1!π2!π3! ...

that is, it is the coefficient of xn in (h1x + h2x² + h3x³ + ... )m. The value of A(pπ11 pπ22 pπ33 ...), (1m) is the coefficient of (pπ11 pπ22 pπ33 ...)xn in the development of the above expression, and is easily shown to have the value

        ( p1 + m − 1 ) π1 ( p2 + m − 1 ) π2 ( p3 + m − 1 ) π3 ...
  p1   p2   p3  
( m ) ( p1 + m − 2 ) π1 ( p2 + m − 2 ) π2 ( p3 + m − 2 ) π3 ...
1 p1   p2   p3  
+ ( m ) ( p1 + m − 3 ) π1 ( p2 + m − 3 ) π2 ( p3 + m − 3 ) π3 ...
2 p1   p2   p3  
− ... to m terms.

Observe that when p1 = p2 = p3 = ... = π1 = π2 = π3 ... = 1 this expression reduces to the mth divided differences of 0n. The expression gives the compositions of the multipartite number pπ11 pπ22 pπ33 ... into m parts. Summing the distribution function from m = 1 to m = ∞ and putting x = 1, as we may without detriment, we find that the totality of the compositions is given by h1 + h2 + h3 + .../ 1 − h1h2h3 + ... which may be given the form a1a2 + a3 − .../1 − 2(a1a2 + a3 − ...). Adding 1/2 we bring this to the still more convenient form

1/2 1 .
1 − 2(a1a2 + a3 − ...)

Let F (pπ11 pπ22 pπ33 ... ) denote the total number of compositions of the multipartite pπ11 pπ22 pπ33 .... Then 1/2 1/1 − 2a = 1/2 + Σ F(p)αp, and thence F(p) = 2p − 1. Again 1/2 · 1/1 − 2(α + β − αβ) = Σ F(p1p2) αp1βp2, and expanding the left-hand side we easily find

F(p1p2) = 2p1 + p2 − 1 (p1 + p2)! − 2p1 + p2 − 2 (p1 + p2 − 1)! + 2p1 + p2 − 3 (p1 + p2 − 2)! − ...
0! p1! p2! 1! (p1 − 1)! (p2 − 1)! 2! (p1 − 2)! (p2 − 2)!

We have found that the number of compositions of the multipartite p1p2p3 ... ps (p1p2p3 ... ps) or of the single term αp1
... αps
in the development according to ascending powers of the algebraic fraction

1/2 · 1 .
1 − 2 (Σα1Σα1α2 + Σα1α2α3 − ... + (−)s + 1 α1α2α3 ... αs

This result can be thrown into another suggestive form, for it can be proved that this portion of the expanded fraction

1/2 · 1 ,
{1 − t1 (2α1 + α2 + ... + αs)} {1 − t2 (2α1 + 2α2 + ... + αs)} ... {1 − ts (2α1 + 2α2 + ... + 2αs)}

which is composed entirely of powers of

t1α1, t2α2, t3α3, ... tsαs

has the expression

1/2 · 1 ,
1 − 2 (Σt1α1 − Σt1t2α1α2 + Σt1t2t3α1α2α3 − ... + (−)s + 1t1t2 ... tsα1α2 ... αs)

and therefore the coefficient of αp11 αp22 ... αpss  in the latter fraction, when t1, t2, &c., are put equal to unity, is equal to the coefficient of the same term in the product

1/2 (2α1 + α2 + ... + αs)p1 (2α1 + 2α2 + ... + αs)p2 ... (2α1 + 2α2 + ... + 2αs)ps.

This result gives a direct connexion between the number of compositions and the permutations of the letters in the product αp1
... αps
. Selecting any permutation, suppose that the letter ar occurs qr times in the last pr + pr+1 + ... + ps places of the permutation; the coefficient in question may be represented by 1/2 Σ2q1+q2+ ... +qs, the summation being for every permutation, and since q1 = p1 this may be written

2p1−1 Σ2q1+q2+ ... +qs.

Ex. Gr.—For the bipartite 22, p1 = p2 = 2, and we have the following scheme:—

α1 α1 α2 α2 q2 = 2
α1 α2 α1 α2 = 1
α1 α2 α2 α1 = 1
α2 α1 α1 α2 = 1
α2 α1 α2 α1 = 1
α2 α2 α1 α1 = 0


F(22) = 2 (22 + 2 + 2 + 2 + 2 + 20) = 26.

We may regard the fraction

1 ,
1/2 · {1 − t1 (2α1 + α2 + ... + αs)} {1 − t2 (2α1 + 2α2 + ... + αs)} ... {1 − ts (2α1 + 2α2 + ... + 2αs)}

as a redundant generating function, the enumeration of the compositions being given by the coefficient of

(t1α1)p1 (t2α2)p2 ... (tsαs)ps.

The transformation of the pure generating function into a factorized redundant form supplies the key to the solution of a large number of questions in the theory of ordinary permutations, as will be seen later.

[The transformation of the last section involves a comprehensive theory of Permutations, which it is convenient to discuss shortly The theory of permutations.here.

If X1, X2, X3, ... Xn be linear functions given by the matricular relation

(X1, X2, X3, ... Xn) = (a11 a12 ... a1n) (x1, x2, ... xn)
  a21 a22 ... a2n  
  . . ... .  
  . . ... .  
  an1 an2 ... ann  

that portion of the algebraic fraction,

1 ,
(1 − s1X1) (1 − s2X2) ... (1 − snXn)

which is a function of the products s1x1, s2x2, s3x3, ... snxn only is

|(1 − a11s1x1) (1 − a22s2x2) (1 − a33s3x3) ... (1 − annsnxn)|

where the denominator is in a symbolic form and denotes on expansion

1 − Σ |a11|s1x1 + Σ |a11a22|s1s2x1x2 − ... + (–)n |a11a22a33 ... ann|

s1s2 ... snx1x2 ... xn,

where |a11|, |a11a22|, ... |a11a22, ... ann| denote the several co-axial minors of the determinant

|a11a22 ... ann|

of the matrix. (For the proof of this theorem see MacMahon, “A certain Class of Generating Functions in the Theory of Numbers,” Phil. Trans. R. S. vol. clxxxv. A, 1894). It follows that the coefficient of


in the product

(a11x1 + a12x2 + ... + a1nxn)ξ1 (a21x1 + a22x2 + ... + a2nxn)ξ2 ... (an1x1 + an2x2 + ... + annxn)ξn

is equal to the coefficient of the same term in the expansion ascending-wise of the fraction

1/1 − Σ |a11|x1 + Σ |a11a22|x1x2 + (–)n |a11a22 ... | x1x2 ... xn.

If the elements of the determinant be all of them equal to unity, we obtain the functions which enumerate the unrestricted permutations of the letters in

... xξn


(x1 + x2 + ... − xn)ξ1+ξ2+ . . . +ξn


1 − (x1 + x2 + ... + xn)

Suppose that we wish to find the generating function for the enumeration of those permutations of the letters in xξ1
... xξn
which are such that no letter xs is in a position originally occupied by an x3 for all values of s. This is a generalization of the “Problème des rencontres” or of “derangements.” We have merely to put

a11 = a22 = a33 = ... = ann = 0

and the remaining elements equal to unity. The generating product is

(x2 + x2 + ... + xn)ξ1

(x1 + x3 + ... + xn)ξ2 ... (x1 + x2 + ... + xn−1)ξn,

and to obtain the condensed form we have to evaluate the co-axial minors of the invertebrate determinant—

0 1 1 ... 1
1 0 1 ... 1
1 1 0 ... 1
. . . ... .
1 1 1 ... 0

The minors of the 1st, 2nd, 3rd ... nth orders have respectively the values


(−)n−1 (n − 1),

therefore the generating function is

1 − Σ x1x2 − 2Σ x1x2x3 − ... − sΣ x1x2 ... xs+1 − ... − (n − 1) x1x2 ... xn

or writing

(x − x1) (x − x2) ... (xxn) = xna1xn−1 + a2xn−2 − ...,

this is

1 − a2 − 2a3 − 3a4 − ... − (n − 1) an

Again, consider the general problem of “derangements.” We have to find the number of permutations such that exactly m of the letters are in places they originally occupied. We have the particular redundant product

(ax1 + x2 + ... + xn)ξ1 (x1 + ax2 + ... + xn)ξ2 ... (x1 + x2 + ... + axn)ξn

in which the sought number is the coefficient of am xξ11 xξ22 ... xξnn. The true generating function is derived from the determinant

a 1 1 1 . . .
1 a 1 1 . . .
1 1 a 1 . . .
1 1 1 a . . .
. . . .      
. . . .      

and has the form

1 − aΣ x1 + (a − 1) (a + 1)Σ x1x2 − ... + (−)n (a − 1)n−1 (a + n − 1)x1x2 ... xn.

It is clear that a large class of problems in permutations can be solved in a similar manner, viz. by giving special values to the elements of the determinant of the matrix. The redundant product leads uniquely to the real generating function, but the latter has generally more than one representation as a redundant product, in the cases in which it is representable at all. For the existence of a redundant form, the coefficients of x1, x2, ... x1x2 ... in the denominator of the real generating function must satisfy 2nn² + n − 2 conditions, and assuming this to be the case, a redundant form can be constructed which involves n − 1 undetermined quantities. We are thus able to pass from any particular redundant generating function to one equivalent to it, but involving n − 1 undetermined quantities. Assuming these quantities at pleasure we obtain a number of different algebraic products, each of which may have its own meaning in arithmetic, and thus the number of arithmetical correspondences obtainable is subject to no finite limit (cf. MacMahon, loc. cit. pp. 125 et seq.)]

3. The Theory of Partitions. Parcels defined by (m).—When an ordinary unipartite number n is broken up into other numbers, and the order of occurrence of the numbers is immaterial, the collection of numbers is termed a partition of the number n. It is usual to arrange the numbers comprised in the Case III. collection, termed the parts of the partition, in descending order of magnitude, and to indicate repetitions of the same part by the use of exponents. Thus (32111), a partition of 8, is written (321³). Euler’s pioneering work in the subject rests on the observation that the algebraic multiplication

xa × xb × xc × ... xa+b+c+ ...

is equivalent to the arithmetical addition of the exponents a, b, c, ... He showed that the number of ways of composing n with p integers drawn from the series a, b, c, ..., repeated or not, is equal to the coefficient of ζpxn in the ascending expansion of the fraction

1 ,
1 − ζxa. 1 − ζxb. 1 − ζxc. ...

which he termed the generating function of the partitions in question.

If the partitions are to be composed of p, or fewer parts, it is merely necessary to multiply this fraction by 1/(1 − ζ). Similarly, if the parts are to be unrepeated, the generating function is the algebraic product

(1 + ζxa) (1 + ζxb) (1 + ζxc) ...;

if each part may occur at most twice,

(1 + ζxa + ζ2x2a) (1 + ζxb + ζ2x2b) (1 + ζxc + ζ2x2c) ...;

and generally if each part may occur at most k − 1 times it is

1 − ζkxka · 1 − ζkxkb · 1 − ζkxkc · ...
1 − ζxa 1 − ζxb 1 − ζxc

It is thus easy to form generating functions for the partitions of numbers into parts subject to various restrictions. If there be no restriction in regard to the numbers of the parts, the generating function is

1 − xa. 1 − xb. 1 − xc. ...

and the problems of finding the partitions of a number n, and of determining their number, are the same as those of solving and enumerating the solutions of the indeterminate equation in positive integers

ax + by + cz + ... = n.

Euler considered also the question of enumerating the solutions of the indeterminate simultaneous equation in positive integers

ax + by + cz + ... = n
ax + by + cz + ... = n

ax + by + cz + ... = n

which was called by him and those of his time the “Problem of the Virgins.” The enumeration is given by the coefficient of xnynzn ... in the expansion of the fraction

(1 − xaybzc ...) (1 − xaybzc ...) (1 − xaybzc ...) ...

which enumerates the partitions of the multipartite number nnn″ ... into the parts

abc ..., abc′ ..., abc″ ... ....

Sylvester has determined an analytical expression for the coefficient of xn in the expansion of

1 .
(1 − xa) (1 − xb) ... (1 − xi)

To explain this we have two lemmas:—

Lemma 1.—The coefficient of x−1, i.e., after Cauchy, the residue in the ascending expansion of (1 − ex)i, is −1. For when i is unity, it is obviously the case, and

(1 − ex)i−1 = (1 − ex)i + ex(1 − ex)i−1 = (1 − ex)i + d (1 − ex)i · 1 .
dx i

Here the residue of d/dx (1 − ex)i · 1/i is zero, and therefore the residue of (1 − ex)i is unchanged when i is increased by unity, and is therefore always −1 for all values of i.

Lemma 2.—The constant term in any proper algebraical fraction developed in ascending powers of its variable is the same as the residue, with changed sign, of the sum of the fractions obtained by substituting in the given fraction, in lieu of the variable, its exponential multiplied in succession by each of its values (zero excepted, if there be such), which makes the given fraction infinite. For write the proper algebraical fraction

F(x) = ΣΣ cλ, μ + Σ γλ .
(aμx)λ xλ
The constant term is
ΣΣ cλ, μ,

Let aν be a value of x which makes the fraction infinite. The residue of

ΣΣΣ cλ, μ + Σ γλ
(aμaνex)λ aλν eλx

is equal to the residue of

ΣΣΣ cλ, μ ,

and when ν = μ, the residue vanishes, so that we have to consider

ΣΣ cλ, μ ,
aλν (1 – ex)λ

and the residue of this is, by the first lemma,

ΣΣ cλ, μ ,

which proves the lemma.

Take F(x) = 1/xn (1 – xa) (1 – xb) ... (1 – xl) = ƒ(x)/xn, since the sought number is its constant term.

Let ρ be a root of unity which makes ƒ(x) infinite when substituted for x. The function of which we have to take the residue is

Σ ρnenx ƒ(ρex) = Σ ρnenx .
(1 – ρaeax) (1 – ρbebx) ... (1 – ρlelx)

We may divide the calculation up into sections by considering separately that portion of the summation which involves the primitive qth roots of unity, q being a divisor of one of the numbers a, b, ... l. Thus the qth wave is

Σ ρnq enx ,
(1 – ρaq eax) (1 – ρbq ebx) ... (1 – ρlq elx)

which, putting 1/ρq for ρq and ν = 1/2(a + b + ... + l), may be written

Σ ρνq eνx ,
(ρ1/2aq e1/2axρ1/2aq e1/2ax) (ρ1/2bq e1/2bxρ1/2bq e1/2bx) ... (ρ1/2lq e1/2lxρ1/2lq e1/2lx)

and the calculation in simple cases is practicable.

Thus Sylvester finds for the coefficient of xn in

1 – x. 1 – x2. 1 – x3

the expression

ν2  7 1 (−)ν + 1 (ρν3 + ρν3),
12 72 8 9

where ν = n + 3.

Sylvester, Franklin, Durfee, G. S. Ely and others have evolved a constructive theory of partitions, the object of which is the contemplation of the partitions themselves, and the evolution of their properties from a study of their inherent characters. It is concerned Sylvester’s graphical method. for the most part with the partition of a number into parts drawn from the natural series of numbers 1, 2, 3 .... Any partition, say (521) of the number 8, is represented by nodes placed in order at the points of a rectangular lattice,

EB1911 Combinatorial Analysis, Sylvester's graphical method.jpg

when the partition is given by the enumeration of the nodes by lines. If we enumerate by columns we obtain another partition of 8, viz. (3213), which is termed the conjugate of the former. The fact or conjugacy was first pointed out by Norman Macleod Ferrers. If the original partition is one of a number n in i parts, of which the largest is j, the conjugate is one into j parts, of which the largest is i, and we obtain the theorem:— “The number of partitions of any number into i parts
i parts or fewer,
and having the largest part equal to j
equal or less than j,
remains the same when the numbers i and j are interchanged.”

The study of this representation on a lattice (termed by Sylvester the “graph”) yields many theorems similar to that just given, and, moreover, throws considerable light upon the expansion of algebraic series.

The theorem of reciprocity just established shows that the number of partitions of n into; parts or fewer, is the same as the number of ways of composing n with the integers 1, 2, 3, ... j. Hence we can expand 1/(1 – a. 1 – ax. 1 – ax2. 1 – ax3 ... ad inf. in ascending powers of a; for the coefficient of ajxn in the expansion is the number of ways of composing n with j or fewer parts, and this we have seen in the coefficients of xn in the ascending expansion of 1/(1 – x. 1 – x2 ... 1 – xj. Therefore

1 = 1 + a + a2 + ... + aj + ....
1 – a. 1 – ax. 1 – ax2.... 1 – x 1 – x. 1 – x2 1 – x. 1 – x2.... 1 – xj

The coefficient of ajxn in the expansion of

1 – a. 1 – ax. 1 – ax2. ... 1 – axi

denotes the number of ways of composing n with j or fewer parts, none of which are greater than i. The expansion is known to be

Σ 1 – xj+1. 1 – xj+2. ... 1 – xj+i aj.
1 – x. 1 – x2. ... 1 – xi

It has been established by the constructive method by F. Franklin (Amer. Jour. of Math. v. 254), and shows that the generating function for the partitions in question is

1 – xj+1. 1 – xj+2. ... 1 – xj+i ,
1 – x. 1 – x2. ... 1 – xi

which, observe, is unaltered by interchange of i and j.

Franklin has also similarly established the identity of Euler

  j = − ∞
(1 – x)(1 – x2)(1 – x3) ... ad inf. = Σ (−) jx1/2(3j2+j),
  j = + ∞

known as the “pentagonal number theorem,” which on interpretation shows that the number of ways of partitioning n into an even number of unrepeated parts is equal to that into an uneven number, except when n has the pentagonal form 1/2(3j2 + j), j positive or negative, when the difference between the numbers of the partitions is (−)j.

To illustrate an important dissection of the graph we will consider those graphs which read the same by columns as by lines; these are called self-conjugate. Such a graph may be obviously dissected into a square, containing say θ2 nodes, and into two graphs, one lateral and one subjacent, the latter being the conjugate of the former. The former graph is limited to contain not more than θ parts, but is subject to no other condition. Hence the number of self-conjugate partitions of n which are associated with a square of θ2 nodes is clearly equal to the number of partitions of 1/2(nθ2) into θ or few parts, i.e. it is the coefficient of x1/2(nθ2) in

1 ,
1 – x. 1 – x2.1 – x3.... 1 – xθ.

or of xn in

xθ2/1 – x2. 1 – x4. 1 – x6. ... 1 – x2θ,

and the whole generating function is

1 + xθ2 .
1 – x2. 1 – x4. 1 – x6. ... 1 – x2θ

Now the graph is also composed of θ angles of nodes, each angle containing an uneven number of nodes; hence the partition is transformable into one containing θ unequal uneven numbers. In the case depicted this partition is (17, 9, 5, 1). Hence the number of the partitions based upon a square of θ2 nodes is the coefficient of aθxn in the product (1 + ax) (1 + ax3) (1 + ax5) ... (1 + ax2s+1) ..., and thence the coefficient of aθ in this product is xθ2 / (1 – x2. 1 – x4. 1 – x6 ... 1 – x2θ), and we have the expansion

(1 + ax) (1 + ax3) (1 + ax5) ... ad inf. = 1 + x a + x4 a2 + x9 a3 + ...
1 – x2 1 – x2. 1 – x4 1 – x2. 1 – x4. 1 – x6

Again, if we restrict the part magnitude to i, the largest angle of nodes contains at most 2i – 1 nodes, and based upon a square of θ2 nodes we have partitions enumerated by the coefficient of aθxn in the product (1 + ax) (1 + ax3) (1 + ax5) ... (1 + ax2i−1); moreover the same number enumerates the partition of 1/2(nθ2) into θ or fewer parts, of which the largest part is equal to or less than iθ,

and is thus given by the coefficient of x1/2(nθ2) in the expansion of
1 – xiθ+1. 1 – xiθ+2. 1 – xiθ+3. ... 1 – xi ,
1 – x. 1 – x2. 1 – x3. ... 1 – xθ

or of xn in

1 – x2i−2θ+2. 1 – x2i−2θ+4. ... 1 – x2i xθ2;
1 – x2. 1 – x4. 1 – x6. ... 1 – x2θ

hence the expansion

(1 + ax) (1 + ax3) (1 + ax5) ... (1 + ax2i−1) = 1 + Σθ=iθ=1 1 – x2i−2θ+2. 1 – x2i−2θ+4. ... 1 + x2i xθ2 aθ.
1 – x2. 1 – x4. 1 – x6. ... 1 – x2θ

There is no difficulty in extending the graphical method to three dimensions, and we have then a theory of a special kind of partition of multipartite numbers. Of such kind is theExtension to three dimensions. partition

 /(a1a2a3...,  /(b1b2b3...,  /(c1c2c3..., ,  /...)

of the multipartite number

 /(a1 + b1 + c1 + ..., a2 + b2 + c2 + ..., a3 + b3 + c3 + ..., ...)


a1a2a3 ≥ ...; b1b2b3 ≥ ..., ...
a3b3c3 ≥ ...,

for then the graphs of the parts —————
... are superposable, and we have what we may term a regular graph in three dimensions. Thus the partition (643, 632, 411) of the multipartite (16, 8, 6) leads to the graph

EB1911 Combinatorial Analysis, partition graph.jpg

and every such graph is readable in six ways, the axis of z being perpendicular to the plane of the paper.

Ex. Gr.

Plane parallel to xy, direction Ox reads (643, 632, 411)
 ”   ” xy,   ” Oy  ” (333211, 332111, 311100)
 ”   ” yz,   ” Oy  ” (333, 331, 321, 211, 110, 110)
 ”   ” yz,   ” Oz  ” (333, 322, 321, 310, 200, 200)
 ”   ” zx,   ” Oz  ” (333322, 322100, 321000)
 ”   ” zx,   ” Ox  ” (664, 431, 321)

the partitions having reference to the multipartite numbers 16, 8, 6, 976422, 13, 11, 6, which are brought into relation through the medium of the graph. The graph in question is more conveniently represented by a numbered diagram, viz.—

3 3 3 3 2 2
3 2 2 1    
3 2 1      

and then we may evidently regard it as a unipartite partition on the points of a lattice,

EB1911 Combinatorial Analysis, lattice.jpg

the descending order of magnitude of part being maintained along every line of route which proceeds from the origin in the positive directions of the axes.

This brings in view the modern notion of a partition, which has enormously enlarged the scope of the theory. We consider any number of points in plano or in solido connected (or not) by lines in pairs in any desired manner and fix upon any condition, such as is implied by the symbols ≥, >, =, <, ≤, ≷, as affecting any pair of points so connected. Thus in ordinary unipartite partition we have to solve in integers such a system as

α1α2α3 ≥ ... ... ≥ αn

α1 + α2 + α3 + ... + αn = n,

the points being in a straight line. In the simplest example of the three-dimensional graph we have to solve the system

≚ ≙ α1 + α2 + α3 + α4 = n,  

and a system for the general lattice constructed upon the same principle. The system has been discussed by MacMahon, Phil. Trans. vol. clxxxvii. A, 1896, pp. 619-673, with the conclusion that if the numbers of nodes along the axes of x, y, z be limited not to exceed the numbers m, n, l respectively, then writing for brevity 1 – xs = (s), the generating function is given by the product of the factors

 (l + 1) . (l + 2) . . . . (l + m)
(1) (2) (m)
(l + 2) . (l + 3) . . . . (l + m + 1)
(2) (3) (m + 1)
.   . . . . . .
.   . . . . . .
.   . . . . . .
(l + n) . (l + n + 1) . . . . (l + m + n – 1)
(n) (n + 1) (m + n – 1)

one factor appearing at each point of the lattice.

In general, partition problems present themselves which depend upon the solution of a number of simultaneous relations in integers of the form

λ1α1 + λ2α2 + λ3α3 + ... ≥ 0,

the coefficients λ being given positive or negative integers, and in some cases the generating function has been determined in a form which exhibits the fundamental solutions of the problems from which all other solutions are derivable by addition. (See MacMahon, Phil. Trans. vol. cxcii. (1899), pp. 351-401; and Trans. Camb. Phil. Soc. vol. xviii. (1899), pp. 12-34.)

The number of distributions of n objects (p1p2p3 ...) into parcels (m) is the coefficient of bm(p1p2p3 ...)xn in the development of the Method of symmetric functions.fraction

(1 − bαx. 1 − bβx. 1 − bγx ... )
× (1 − bα2x2. 1 − bαβx2. 1 − bβ2x2 ... )
× (1 − bα3x3. 1 − bα2βx3. 1 − bαβγx3 ... )

and if we write the expansion of that portion which involves products of the letters α, β, γ, . . . of degree r in the form

1 + hr1 bxr + hr2 b2x2r + ... ,

we may write the development

r = ∞
Π (1 + hr1 bxr + hr2 b2x2r + ...),
r = 1

and picking out the coefficient of bm xn we find

Σ hτ1hτ2hτ3 ... ,



Στ = m, Στt = n.


The quantities h are symmetric functions of the quantities α, β, γ, . . . which in simple cases can be calculated without difficulty, and then the distribution function can be formed.

Ex. Gr.—Required the enumeration of the partitions of all multipartite numbers (p1p2p3 ...) into exactly two parts. We find

h22 = h4h3h1 + h22
h32 = h6h5h1 + h4h2
h42 = h8h7h1 + h6h2 + h5h3 + h24,

and paying attention to the fact that in the expression of hr2 the term h2
is absent when r is uneven, the law is clear. The generating function is

h2x2 + h2h1x3 + (h4 + h22)x4 + (h4h1 + h3h2)x5 + (h6 + 2h4h2)x6 + (h6h1 + h5h2 + h4h3)x7 + (h8 + 2h6h2 + h24)x8 + ...


h4 + h22 = h4 + {(2) + (12)}2 = 2(4) + 3(31) + 4(22) + 5(212) + 7(14),

the term 5(212) indicates that objects such as a, a, b, c can be partitioned in five ways into two parts. These are a | a, b, c; b | a; a, c; c | a, a, b; a, a | b, c; a, b | a, c. The function hrs has been studied. (See MacMahon, Proc. Lond. Math. Soc. vol. xix.) Putting x equal to unity, the function may be written (h2 + h4 + h6 + ...) (1 + h1 + h2 + h3 + h4 + ...), a convenient formula.

The method of differential operators, of wide application to problems of combinatorial analysis, has for its leading idea the designing of a function and of a differential operator, so that when the operator is performed upon the function a number is reached which enumerates the solutions Method of differential operators. of the given problem. Generally speaking, the problems considered are such as are connected with lattices, or as it is possible to connect with lattices.

To take the simplest possible example, consider the problem of finding the number of permutations of n different letters. The function is here xn, and the operator (d/dx)n = δn x , yielding δn x xn = n! the number which enumerates the permutations. In fact—

δxxn = δx . x . x . x . x . x . x . ...,

and differentiating we obtain a sum of n terms by striking out an x from the product in all possible ways. Fixing upon any one of these terms, say x . x . x . x . ..., we again operate with δx by striking out an x in all possible ways, and one of the terms so reached is x . x . x . x . x . .... Fixing upon this term, and again operating and continuing the process, we finally arrive at one solution of the problem, which (taking say n = 4) may be said to be in correspondence with the operator diagram—

EB1911 Combinatorial Analysis, operator diagram.jpg

the number in each row of compartments denoting an operation of δx. Hence the permutation problem is equivalent to that of placing n units in the compartments of a square lattice of order n in such manner that each row and each column contains a single unit. Observe that the method not only enumerates, but also gives a process by which each solution is actually formed. The same problem is that of placing n rooks upon a chess-board of n2 compartments, so that no rook can be captured by any other rook.

Regarding these elementary remarks as introductory, we proceed to give some typical examples of the method. Take a lattice of m columns and n rows, and consider the problem of placing units in the compartments in such wise that the sth column shall contain λs units (s = 1, 2, 3, ... m), and the tth row pt units (t = 1, 2, 3, ... n).


1 + a1x + a2x2 + ... + ... = (1 + a1x) (1 + a2x)(1 + a3x) ...

and Dp = 1/p! (δα1 + α1δα2 + α2δα3 + ...)p, the multiplication being symbolic, so that Dp is an operator of order p, the function is

aλ1aλ2aλ3 ... aλm,

and the operator Dp1Dp2Dp3 ... Dpn. The number Dp1Dp2 ... Dpnaλ1aλ2aλ3 ... aλm enumerates the solutions. For the mode of operation of Dp upon a product reference must be made to the section on “Differential Operators” in the article Algebraic Forms. Writing

aλ1aλ2 ... aλm =

... ΑΣαp11 αp22 ... αpnn + ...,

or, in partition notation,

(1λ1) (1λ2) ... (1λm) =

... + Α(p1p2 ... pn) ... + Dp1Dp2 ... Dpn (1λ1) (1λ2) ... (1λm) = Α

and the law by which the operation is performed upon the product shows that the solutions of the given problem are enumerated by the number A, and that the process of operation actually represents each solution.

Ex. Gr.—Take

λ1 = 3, λ2 = 2, λ3 = 1,
p1 = 2, p2 = 2, p3 = 1, p4 = 1,

D22D21 a3a2a1 = 8,

and the process yields the eight diagrams:—

EB1911 Combinatorial Analysis, eight diagrams.jpg

viz. every solution of the problem. Observe that transposition of the diagrams furnishes a proof of the simplest of the laws of symmetry in the theory of symmetric functions.

For the next example we have a similar problem, but no restriction is placed upon the magnitude of the numbers which may appear in the compartments. The function is now hλ1hλ2 ... hλm, hλm being the homogeneous product sum of the quantities a, of order λ. The operator is as before

Dp1Dp2 ... Dpm,

and the solutions are enumerated by

Dp1Dp2 ... Dpn

hλ1hλ2 ... hλm.

Putting as before λ1 = 3, λ2 = 2, λ3 = 1, p1 = 2, p2 = 2, p3 = 1, p4 = 1, the reader will have no difficulty in constructing the diagrams of the eighteen solutions.

The next and last example of a multitude that might be given shows the extraordinary power of the method by solving the famous problem of the “Latin Square,” which for hundreds of years had proved beyond the powers of mathematicians. The problem consists in placing n letters a, b, c, ... n in the compartments of a square lattice of n2 compartments, no compartment being empty, so that no letter occurs twice either in the same row or in the same column. The function is here

(Σα2n−11 α2 n−22 ...

α2n−1 αn)n,

and the operator Dn2n−1, the enumeration being given by


(Σα2n−11 α2n−2 ... α2n−1 αn)n.

See Trans. Camb. Phil. Soc. vol. xvi. pt. iv. pp. 262-290.

Authorities.—P. A. MacMahon, “Combinatory Analysis: A Review of the Present State of Knowledge,” Proc. Lond. Math. Soc. vol. xxviii. (London, 1897). Here will be found a bibliography of the Theory of Partitions. Whitworth, Choice and Chance; Édouard Lucas, Théorie des nombres (Paris, 1891); Arthur Cayley, Collected Mathematical Papers (Cambridge, 1898), ii. 419; iii. 36, 37; iv. 166-170; v. 62-65, 617; vii. 575; ix. 480-483; x. 16, 38, 611; xi. 61, 62, 357-364, 589-591; xii. 217-219, 273-274; xiii. 47, 93-113, 269; Sylvester, Amer. Jour, of Math. v. 119 251; MacMahon, Proc. Lond. Math. Soc. xix. 228 et seq.; Phil. Trans. clxxxiv. 835-901; clxxxv. 111-160; clxxxvii. 619-673; cxcii. 351-401; Trans. Camb. Phil. Soc. xvi. 262-290.  (P. A. M.)