Labelled Enumeration Theorem

In combinatorial mathematics, the labelled enumeration theorem is the counterpart of the Pólya enumeration theorem for the labelled case, where we have a set of labelled objects given by an exponential generating function (EGF) ''g''(''z'') which are being distributed into ''n'' slots and a permutation group ''G'' which permutes the slots, thus creating equivalence classes of configurations. There is a special re-labelling operation that re-labels the objects in the slots, assigning labels from 1 to ''k'', where ''k'' is the total number of nodes, i.e. the sum of the number of nodes of the individual objects. The EGF $f_n(z)$ of the number of different configurations under this re-labelling process is given by

:$f_n(z) = \frac.$

In particular, if ''G'' is the symmetric group of order ''n'' (hence, , ''G'',  = ''n''!), the functions $f_n(z)$ can be further combined into a single generating function:

:$F(z,t) = \sum_^\infty f_n(z) t^n = \sum_^\infty \frac t^n = e^$

which is exponential w.r.t. the variable ''z'' and ordinary w.r.t. the variable ''t''.

The re-labelling process

We assume that an object $\omega$ of size $, \omega,$ represented by $z^/, \omega, !$ contains $, \omega, =m$ labelled internal nodes, with the labels going from 1 to ''m''. The action of ''G'' on the slots is greatly simplified compared to the unlabelled case, because the labels distinguish the objects in the slots, and the orbits under ''G'' all have the same size $, G,$. (The EGF ''g''(''z'') may not include objects of size zero. This is because they are not distinguished by labels and therefore the presence of two or more of such objects creates orbits whose size is less than $, G,$.) As mentioned, the nodes of the objects are re-labelled when they are distributed into the slots. Say an object of size $r_1$ goes into the first slot, an object of size $r_2$ into the second slot, and so on, and the total size of the configuration is ''k'', so that

:$r_1 + r_2 + \cdots + r_n = k.$

The re-labelling process works as follows: choose one of

:$$

partitions of the set of ''k'' labels into subsets of size $r_1, r_2, \ldots r_n.$
Now re-label the internal nodes of each object using the labels from the respective subset, preserving the order of the labels. E.g. if the first object contains four nodes labelled from 1 to 4 and the set of labels chosen for this object is , then node 1 receives the label 2, node 2, the label 5, node 3, the label 6 and node 4, the label 10. In this way the labels on the objects induce a unique labelling using the labels from the subset of /math> chosen for the object.

Proof of the theorem

It follows from the re-labelling construction that there are

:
\frac
\sum_
\;
r_1! ^g(z) \;
r_2! ^g(z) \;
\cdots \;
r_n! ^g(z)

or

:
\frac
\sum_
^g(z)
^g(z)
\cdots
^g(z)

\; = \; \frac ^kg(z)^n

different configurations of total size ''k''. The formula evaluates to an integer because ^kg(z)^n is zero for ''k'' < ''n'' (remember that ''g'' does not include objects of size zero) and when $k \ge n$ we have $n!, k!$ and the order $, G,$ of ''G'' divides the order of $S_n$, which is $n!$, by Lagrange's theorem. The conclusion is that the EGF of the labelled configurations is given by

: f_n(z) = \sum_ \left( \frac ^kg(z)^n \right) \frac =
\frac \sum_ z^k ^kg(z)^n = \frac{, G.

This formula could also be obtained by enumerating sequences, i.e. the case when the slots are not being permuted, and by using the above argument without the $1/, G,$-factor to show that their generating function under re-labelling is given by $g(z)^n$. Finally note that every sequence belongs to an orbit of size $, G,$, hence the generating function of the orbits is given by $g(z)^n/, G, .$

References

* François Bergeron, Gilbert Labelle, Pierre Leroux, ''Théorie des espèces et combinatoire des structures arborescentes'', LaCIM, Montréal (1994). English version: ''Combinatorial Species and Tree-like Structures'', Cambridge University Press (1998).

Enumerative combinatorics
Theorems in combinatorics
Articles containing proofs