Editing Symbolic method (combinatorics)

{{About|the method in analytic combinatorics|the method in invariant theory|Symbolic method}}

In [[combinatorics]], the '''symbolic method''' is a technique for [[enumerative combinatorics|counting combinatorial objects]].  It uses the internal structure of the objects to derive formulas for their [[generating function]]s.  The method is mostly associated with [[Philippe Flajolet]] and is detailed in Part A of his book with [[Robert Sedgewick (computer scientist)|Robert Sedgewick]], ''[[Analytic Combinatorics]]'', while the rest of the book explains how to use complex analysis in order to get asymptotic and probabilistic results on the corresponding generating functions.

During two centuries, generating functions were popping up via the corresponding recurrences on their coefficients (as can be seen in the seminal works of [[Daniel Bernoulli|Bernoulli]], [[Leonhard Euler|Euler]], [[Arthur Cayley]], [[Ernst Schröder (mathematician)|Schröder]], 
[[Srinivasa Ramanujan|Ramanujan]], [[John Riordan (mathematician)|Riordan]], [[Donald Knuth|Knuth]], {{ill|Louis Comtet|fr|lt=Comtet}}, etc.).
It was then slowly realized that the generating functions were capturing many other facets of the initial discrete combinatorial objects, and that this could be done in a more direct formal way: The recursive nature of some combinatorial structures 
translates, via some isomorphisms, into noteworthy identities on the corresponding generating functions. 
Following the works of [[George Pólya|Pólya]], further advances were thus done in this spirit in the 1970s with generic uses of languages for specifying combinatorial classes and their generating functions, as found in works by [[Dominique Foata|Foata]] and [[Marcel-Paul Schützenberger|Schützenberger]]<ref name="fs">{{cite book|last1=Foata|first1=Dominique|authorlink1=Dominique Foata|last2=Schützenberger|first2=Marcel-P.|authorlink2=Marcel-Paul Schützenberger|title=Théorie Géométrique des Polynômes Eulériens|series=Lecture Notes in Mathematics|date=1970|volume=138|doi=10.1007/BFb0060799|isbn=978-3-540-04927-2|doi-access=free|arxiv=math/0508232}}</ref> on permutations, 
Bender and Goldman on prefabs,<ref>{{cite journal|last1=Bender|first1=Edward A.|last2=Goldman|first2=Jay R.|title=Enumerative uses of generating functions|journal=Indiana University Mathematics Journal|date=1971|volume=20|issue=8|pages=753–764|doi=10.1512/iumj.1971.20.20060|doi-access=free}}</ref> and [[André Joyal|Joyal]] on [[combinatorial species]].<ref>{{cite journal|last1=Joyal|first1=André|authorlink1=André Joyal|title=Une théorie combinatoire des séries formelles|journal=[[Advances in Mathematics]]|date=1981|volume=42|pages=1–82|ref=joy|doi=10.1016/0001-8708(81)90052-9|doi-access=}}</ref>

Note that this symbolic method in enumeration is unrelated to "Blissard's symbolic method", which is just another old name for [[umbral calculus]].

The symbolic method in combinatorics constitutes the first step of many analyses of combinatorial structures, 
which can then lead to fast computation schemes, to asymptotic properties and [[Asymptotic distribution|limit laws]], to [[random generation]], all of them being suitable to automatization via [[computer algebra]].

== Classes of combinatorial structures ==
Consider the problem of distributing objects given by a generating function into a set of ''n'' slots, where a permutation group ''G'' of degree ''n'' acts on the slots to create an equivalence relation of filled slot configurations, and asking about the generating function of the configurations by weight of the configurations with respect to this equivalence relation, where the weight of a configuration is the sum of the weights of the objects in the slots. We will first explain how to solve this problem in the labelled and the unlabelled case and use the solution to motivate the creation of [[combinatorial class|classes of combinatorial structures]].

The [[Pólya enumeration theorem]] solves this problem in the unlabelled case. Let ''f''(''z'') be the [[ordinary generating function]] (OGF) of the objects, then the OGF of the configurations is given by the substituted [[cycle index]]

:<math>Z(G)(f(z), f(z^2), \ldots, f(z^n)).</math>

In the labelled case we use an [[exponential generating function]] (EGF) ''g''(''z'') of the objects and apply the [[Labelled enumeration theorem]], which says that the EGF of the configurations is given by

:<math>\frac{g(z)^n}{|G|}.</math>

We are able to enumerate filled slot configurations using either [[Pólya enumeration theorem]] in the unlabelled case or the labelled enumeration theorem in the labelled case. We now ask about the generating function of configurations obtained when there is more than one set of slots, with a permutation group acting on each. Clearly the orbits do not intersect and we may add the respective generating functions. Suppose, for example, that we want to enumerate unlabelled sequences of length two or three of some objects contained in a set ''X''. There are two sets of slots, the first one containing two slots, and the second one, three slots. The group acting on the first set is the full symmetric group <math>S_2</math>, which in symbolic combinatorics is traditionally denoted <math>E_2</math>. The group acting on the second set is, analogously, <math>S_3 = E_3</math>. We represent this by the following formal [[power series]] in ''X'':

:<math> X^2/E_2 \; + \; X^3/E_3 </math>

where the term <math>X^n/G</math> is used to denote the set of orbits under ''G'' and <math>X^n = X \times \cdots \times X</math>, which denotes in the obvious way the process of distributing the objects from ''X'' with repetition into the ''n'' slots. Similarly, consider the labelled problem of creating cycles of arbitrary length  from a set of labelled objects ''X''. This yields the following series of actions of cyclic groups:

:<math> X/C_1 \; + \; X^2/C_2 \; + \; X^3/C_3 \; + \; X^4/C_4 \; + \cdots.</math>

Clearly we can assign meaning to any such power series of quotients (orbits) with respect to permutation groups, where we restrict the groups of degree ''n'' to the conjugacy classes <math>\operatorname{Cl}(S_n)</math> of the symmetric group <math>S_n</math>, which form a unique factorization domain. (The orbits with respect to two groups from the same conjugacy class are isomorphic.) This motivates the following definition.

A class <math>\mathcal{C}\in \mathbb{N}[\mathfrak{M}]</math> of combinatorial structures is a formal series
:<math>\mathcal{C} = \sum_{n \ge 1} \sum_{G\in \operatorname{Cl}(S_n)} c_G (X^n/G)</math>
where <math>\mathfrak{M}</math> (the "M" is for "molecules") is the set of primes of the UFD <math>\{\operatorname{Cl}(S_n)\}_{n\ge 1}</math> and <math>c_G \in \mathbb{N}.</math>

In the following we will simplify our notation a bit and write e.g.

:<math> E_2 + E_3 \text{ and } C_1 + C_2 + C_3 + \cdots.</math>

for the classes mentioned above.

== The Flajolet&ndash;Sedgewick fundamental theorem ==

A theorem in the Flajolet&ndash;Sedgewick theory of symbolic combinatorics treats the enumeration problem of labelled and unlabelled combinatorial classes by means of the creation of symbolic operators that make it possible to translate equations involving combinatorial structures directly (and automatically) into equations in the generating functions of these structures.

Let <math>\mathcal{C}\in\mathbb{N}[\mathfrak{A}]</math> be a class of combinatorial structures. The OGF <math>F(z)</math> of <math>\mathcal{C}(X)</math> where ''X'' has OGF <math>f(z)</math> and the EGF <math>G(z)</math> of  <math>\mathcal{C}(X)</math> where ''X'' is labelled with EGF <math>g(z)</math> are given by

:<math>F(z) = \sum_{n \ge 1} \sum_{G\in \operatorname{Cl}(S_n)} c_G Z(G)(f(z), f(z^2), \ldots, f(z^n))</math>

and

:<math>G(z) = \sum_{n \ge 1} \left(\sum_{G\in \operatorname{Cl}(S_n)} \frac{c_G}{|G|}\right) g(z)^n. </math>

In the labelled case we have the additional requirement that ''X'' not contain elements of size zero. It will sometimes prove convenient to add one to <math>G(z)</math> to indicate the presence of one copy of the empty set. It is possible to assign meaning to both <math>\mathcal{C}\in\mathbb{Z}[\mathfrak{A}]</math> (the most common example is the case of unlabelled sets) and <math>\mathcal{C}\in\mathbb{Q}[\mathfrak{A}].</math> To prove the theorem simply apply PET (Pólya enumeration theorem) and the labelled enumeration theorem.

The power of this theorem lies in the fact that it makes it possible to construct operators on generating functions that represent combinatorial classes. A structural equation between combinatorial classes thus translates directly into an equation in the corresponding generating functions. Moreover, in the labelled case it is evident from the formula that we may replace <math>g(z)</math> by the atom ''z'' and compute the resulting operator, which may then be applied to EGFs. We now proceed to construct the most important operators. The reader may wish to compare with the data on the [[cycle index]] page.

=== The sequence operator {{nobold|{{math|SEQ}}}} ===

This operator corresponds to the class

:<math>L = \frac{1}{1 - X} = 1 + X + X^2 + X^3 + \cdots</math>

and represents sequences, i.e. the slots are not being permuted and there is exactly one empty sequence. We have

:<math> F(z) = 1 + \sum_{n\ge 1} Z(1)(f(z), f(z^2), \ldots, f(z^n)) =
1 + \sum_{n\ge 1} f(z)^n = \frac{1}{1-f(z)}</math>

and

:<math> G(z) = 1 + \sum_{n\ge 1} g(z)^n = 
\frac{1}{1-g(z)}.</math>

=== The cycle operator {{nobold|{{math|CYC}}}} ===

This operator corresponds to the class

:<math>C = C_1 + C_2 + C_3 + \cdots</math>

i.e., cycles containing at least one object. We have

:<math> 
F(z) = \sum_{n\ge 1} Z(C_n)(f(z), f(z^2), \ldots, f(z^n)) =
\sum_{n\ge 1} \frac{1}{n} \sum_{d\mid n} \varphi(d) f(z^d)^{n/d}</math>

or

:<math>
F(z) = \sum_{k\ge 1} \varphi(k) \sum_{m\ge 1} \frac{1}{km} f(z^k)^m =
\sum_{k\ge 1} \frac{\varphi(k)}{k} \log \frac{1}{1-f(z^k)}</math>

and

:<math> G(z) = \sum_{n\ge 1} \left(\frac{1}{|C_n|}\right) g(z)^n = 
\log \frac{1}{1-g(z)}.</math>

This operator, together with the set operator {{math|SET}}, and their restrictions to specific degrees are used to compute [[random permutation statistics]]. There are two useful restrictions of this operator, namely to even and odd cycles.

The labelled even cycle operator {{math|CYC{{sub|even}}}} is

:<math>C_2 + C_4 + C_6 + \cdots</math>

which yields

:<math> G(z) = \sum_{n\ge 1} \left(\frac{1}{|C_{2n}|}\right) g(z)^{2n} = 
\frac{1}{2} \log \frac{1}{1-g(z)^2}.</math>

This implies that the labelled odd cycle operator {{math|CYC{{sub|odd}}}}

:<math>C_1 + C_3 + C_5 + \cdots</math>

is given by

:<math> G(z) = \log \frac{1}{1-g(z)} - \frac{1}{2} \log \frac{1}{1-g(z)^2} =
\frac{1}{2} \log \frac{1+g(z)}{1-g(z)}.</math>

=== The multiset/set operator {{nobold|{{math|MSET}}/{{math|SET}}}} ===

The series is

:<math>E = 1 + E_1 + E_2 + E_3 + \cdots</math>

i.e., the symmetric group <math>S_n = E_n</math> is applied to the ''n''th slot. This creates multisets in the unlabelled case and sets in the labelled case (there are no multisets in the labelled case because the labels distinguish multiple instances of the same object from the set being put into different slots). We include the empty set in both the labelled and the unlabelled case.

The unlabelled case is done using the function

:<math>M(f(z), y) = \sum_{n\ge 0} y^n Z(E_n)(f(z), f(z^2), \ldots, f(z^n))</math>

so that

:<math>\mathfrak{M}(f(z)) = M(f(z), 1).</math>

Evaluating <math>M(f(z), 1)</math> we obtain

:<math> F(z) = \exp \left( \sum_{\ell\ge 1} \frac{f(z^\ell)}{\ell} \right).</math>

For the labelled case we have

:<math> G(z) =  1 + \sum_{n\ge 1} \left(\frac{1}{|S_n|}\right) g(z)^n = 
\sum_{n\ge 0} \frac{g(z)^n}{n!} = \exp g(z).</math>

In the labelled case we denote the operator by {{math|SET}}, and in the unlabelled case, by {{math|MSET}}. This is because in the labeled case there are no multisets (the labels distinguish the constituents of a compound combinatorial class) whereas in the unlabeled case there are multisets and sets, with the latter being given by

:<math> F(z) = \exp \left( \sum_{\ell\ge 1} (-1)^{\ell-1} \frac{f(z^\ell)} \ell \right).</math>

==Procedure==
Typically, one starts with the ''neutral class'' <math>\mathcal{E}</math>, containing a single object of size 0 (the ''neutral object'', often denoted by <math>\epsilon</math>), and one or more ''atomic classes'' <math>\mathcal{Z}</math>, each containing a single object of size 1.  Next, [[Set theory|set-theoretic]] relations involving various simple operations, such as [[disjoint union]]s, [[Cartesian product|products]], [[Set (mathematics)|sets]], [[sequence]]s, and [[multiset]]s define more complex classes in terms of the already defined classes.  These relations may be [[recursion|recursive]].  The elegance of symbolic combinatorics lies in that the set theoretic, or ''symbolic'', relations translate directly into ''[[algebra]]ic'' relations involving the generating functions.

In this article, we will follow the convention of using script uppercase letters to denote combinatorial classes and the corresponding plain letters for the generating functions (so the class <math>\mathcal{A}</math> has generating function <math>A(z)</math>).

There are two types of generating functions commonly used in symbolic combinatorics—[[ordinary generating function]]s, used for combinatorial classes of unlabelled objects, and [[exponential generating function]]s, used for classes of labelled objects.

It is trivial to show that the generating functions (either ordinary or exponential) for <math>\mathcal{E}</math> and <math>\mathcal{Z}</math> are <math>E(z) = 1</math> and <math>Z(z) = z</math>, respectively.  The disjoint union is also simple &mdash; for disjoint sets <math>\mathcal{B}</math> and <math>\mathcal{C}</math>, <math>\mathcal{A} = \mathcal{B} \cup \mathcal{C}</math> implies <math>A(z) = B(z) + C(z)</math>.  The relations corresponding to other operations depend on whether we are talking about labelled or unlabelled structures (and ordinary or exponential generating functions).

==Combinatorial sum==
The restriction of [[Union (set theory)|unions]] to disjoint unions is an important one; however, in the formal specification of symbolic combinatorics, it is too much trouble to keep track of which sets are disjoint.  Instead, we make use of a construction that guarantees there is no intersection (''be careful, however; this affects the semantics of the operation as well'').  In defining the ''combinatorial sum'' of two sets <math>\mathcal{A}</math> and <math>\mathcal{B}</math>, we mark members of each set with a distinct marker, for example <math>\circ</math> for members of <math>\mathcal{A}</math> and <math>\bullet</math> for members of <math>\mathcal{B}</math>.  The combinatorial sum is then:

:<math>\mathcal{A} + \mathcal{B} = (\mathcal{A} \times \{\circ\}) \cup (\mathcal{B} \times \{\bullet\})</math>

This is the operation that formally corresponds to addition.

==Unlabelled structures==
With unlabelled structures, an [[ordinary generating function]] (OGF) is used.  The OGF of a sequence <math>A_n</math> is defined as

:<math>A(x)=\sum_{n=0}^\infty A_n x^n</math>

===Product===
The [[Cartesian product|product]] of two combinatorial classes <math>\mathcal{A}</math> and <math>\mathcal{B}</math> is specified by defining the size of an ordered pair as the sum of the sizes of the elements in the pair.  Thus we have for <math>a \in \mathcal{A}</math> and <math>b \in \mathcal{B}</math>, <math>|(a,b)| = |a| + |b|</math>.  This should be a fairly intuitive definition.  We now note that the number of elements in <math>\mathcal{A} \times \mathcal{B}</math> of size <var>n</var> is

:<math>\sum_{k=0}^n A_k B_{n-k}.</math>

Using the definition of the OGF and some elementary algebra, we can show that

:<math>\mathcal{A} = \mathcal{B} \times \mathcal{C}</math> implies <math>A(z) = B(z) \cdot C(z).</math>

===Sequence===
The ''sequence construction'', denoted by <math>\mathcal{A} = \mathfrak{G}\{\mathcal{B}\}</math> is defined as

:<math>\mathfrak{G}\{\mathcal{B}\} = \mathcal{E} + \mathcal{B} + (\mathcal{B} \times \mathcal{B}) + (\mathcal{B} \times \mathcal{B} \times \mathcal{B}) + \cdots.</math>

In other words, a sequence is the neutral element, or an element of <math>\mathcal{B}</math>, or an ordered pair, ordered triple, etc.  This leads to the relation

:<math>A(z) = 1 + B(z) + B(z)^{2} + B(z)^{3} + \cdots = \frac{1}{1 - B(z)}.</math>

===Set===
The ''set'' (or ''powerset'') ''construction'', denoted by <math>\mathcal{A} = \mathfrak{P}\{\mathcal{B}\}</math> is defined as

:<math>\mathfrak{P}\{\mathcal{B}\} = \prod_{\beta \in \mathcal{B}}(\mathcal{E} + \{\beta\}),</math>

which leads to the relation

:<math>\begin{align}A(z) &{} = \prod_{\beta \in \mathcal{B}}(1 + z^{|\beta|}) \\
 &{} = \prod_{n=1}^\infty (1 + z^n)^{B_n} \\
 &{} = \exp \left ( \ln \prod_{n=1}^{\infty}(1 + z^n)^{B_n} \right ) \\
 &{} = \exp \left ( \sum_{n = 1}^\infty B_n \ln(1 + z^n) \right ) \\
 &{} = \exp \left ( \sum_{n = 1}^\infty B_n \cdot \sum_{k = 1}^{\infty} \frac{(-1)^{k-1}z^{nk}} k \right ) \\
 &{} = \exp \left ( \sum_{k = 1}^\infty \frac{(-1)^{k-1}} k \cdot \sum_{n = 1}^\infty B_n z^{nk} \right ) \\
 &{} = \exp \left ( \sum_{k = 1}^\infty \frac{(-1)^{k-1} B(z^k)} k \right),
\end{align}</math>

where the expansion

:<math>\ln(1 + u) = \sum_{k = 1}^\infty \frac{(-1)^{k-1} u^k} k </math>

was used to go from line 4 to line 5.

===Multiset===
The ''multiset construction'', denoted <math>\mathcal{A} = \mathfrak{M}\{\mathcal{B}\}</math> is a generalization of the set construction.  In the set construction, each element can occur zero or one times.  In a multiset, each element can appear an arbitrary number of times.  Therefore,

:<math>\mathfrak{M}\{\mathcal{B}\} = \prod_{\beta \in \mathcal{B}} \mathfrak{G}\{\beta\}.</math>

This leads to the relation

:<math>\begin{align} A(z) &{} = \prod_{\beta \in \mathcal{B}} (1 - z^{|\beta|})^{-1} \\
 &{} = \prod_{n = 1}^\infty (1 - z^n)^{-B_n} \\
 &{} = \exp \left ( \ln \prod_{n = 1}^\infty (1 - z^n)^{-B_n} \right ) \\
 &{} = \exp \left ( \sum_{n=1}^\infty-B_n \ln (1 - z^n) \right ) \\
 &{} = \exp \left ( \sum_{k=1}^\infty \frac{B(z^k)} k \right ),
\end{align}
</math>

where, similar to the above set construction, we expand <math>\ln (1 - z^n)</math>, swap the sums, and substitute for the OGF of <math>\mathcal{B}</math>.

===Other elementary constructions===
Other important elementary constructions are:
*the ''cycle construction'' (<math>\mathfrak{C}\{\mathcal{B}\}</math>), like sequences except that cyclic rotations are not considered distinct
*''pointing'' (<math>\Theta\mathcal{B}</math>), in which each member of {{mathcal|B}} is augmented by a neutral (zero size) pointer to one of its atoms
*''substitution'' (<math>\mathcal{B} \circ \mathcal{C}</math>), in which each atom in a member of {{mathcal|B}} is replaced by a member of {{mathcal|C}}.

The derivations for these constructions are too complicated to show here.  Here are the results:
{| class="wikitable"
|-
! Construction
! Generating function
|-
|<math>\mathcal{A} = \mathfrak{C}\{\mathcal{B}\}</math>
|<math>A(z) = \sum_{k=1}^\infty \frac{\phi(k)} k \ln \frac 1 {1 - B(z^k)}</math> (where <math>\phi(k)</math> is the [[Euler totient function]])
|-
|<math>\mathcal{A} = \Theta\mathcal{B}</math>
|<math>A(z) = z\frac{d}{dz}B(z)</math>
|-
|<math>\mathcal{A} = \mathcal{B} \circ \mathcal{C}</math>
|<math>A(z) = B(C(z))</math>
|}

===Examples===
Many combinatorial classes can be built using these elementary constructions. For example, the class of plane [[tree (graph)|tree]]s (that is, trees [[embedding|embedded]] in the plane, so that the order of the subtrees matters) is specified by the [[recursion|recursive]] relation

:<math>\mathcal{G} = \mathcal{Z} \times \operatorname{SEQ}\{\mathcal{G}\}.</math>

In other words, a tree is a root node of size 1 and a sequence of subtrees.  This gives

:<math>G(z) = \frac{z}{1 - G(z)}</math>

we solve for ''G''(''z'') by multiplying <math>1 - G(z)</math> to get

<math>G(z) - G(z)^2 = z</math>

subtracting z and solving for G(z) using the quadratic formula gives

:<math>G(z) = \frac{1 - \sqrt{1 - 4z}}{2}.</math>

Another example (and a classic combinatorics problem) is [[integer partition]]s.  First, define the class of positive integers <math>\mathcal{I}</math>, where the size of each integer is its value:

:<math>\mathcal{I} = \mathcal{Z} \times \operatorname{SEQ}\{\mathcal{Z}\}</math>

The OGF of <math>\mathcal{I}</math> is then

:<math>I(z) = \frac{z}{1 - z}.</math>

Now, define the set of partitions <math>\mathcal{P}</math> as

:<math>\mathcal{P} = \operatorname{MSET}\{\mathcal{I}\}. </math>

The OGF of <math>\mathcal{P}</math> is

:<math>P(z) = \exp \left ( I(z) + \frac{1}{2} I(z^{2}) + \frac{1}{3} I(z^{3}) + \cdots \right ). </math>

Unfortunately, there is no closed form for <math>P(z)</math>; however, the OGF can be used to derive a [[recurrence relation]], or using more advanced methods of analytic combinatorics, calculate the [[Generating function#Asymptotic growth of a sequence|asymptotic behavior]] of the counting sequence.

===Specification and specifiable classes===
The elementary constructions mentioned above allow us to define the notion of ''specification''. This specification allows us to use a set of recursive equations, with multiple combinatorial classes.

Formally, a specification for a set of combinatorial classes <math>(\mathcal A_1,\dots,\mathcal A_r)</math> is a set of <math>r</math> equations <math>\mathcal A_i=\Phi_i(\mathcal A_1,\dots,\mathcal A_r)</math>, where <math>\Phi_i</math> is an expression, whose atoms are <math>\mathcal E,\mathcal Z</math> and the <math>\mathcal A_i</math>'s, and whose operators are the elementary constructions listed above.

A class of combinatorial structures is said to be ''constructible'' or ''specifiable'' when it admits a specification.

For example, the set of trees whose leaves' depth is even (respectively, odd) can be defined using the specification with two classes <math>\mathcal A_\text{even}</math> and <math>\mathcal A_\text{odd}</math>. Those classes should satisfy the equation <math>\mathcal A_\text{odd}=\mathcal Z\times \operatorname{Seq}_{\ge1}\mathcal A_\text{even}</math> and <math>\mathcal A_\text{even} = \mathcal Z\times \operatorname{Seq}\mathcal A_\text{odd}</math>.

==Labelled structures==
An object is ''weakly labelled'' if each of its atoms has a nonnegative integer label, and each of these labels is distinct.  An object is (''strongly'' or ''well'') ''labelled'', if furthermore, these labels comprise the consecutive integers <math>[1 \ldots n]</math>.  ''Note: some combinatorial classes are best specified as labelled structures or unlabelled structures, but some readily admit both specifications.''  A good example of labelled structures is the class of [[Graph (discrete mathematics)|labelled graph]]s.

With labelled structures, an [[exponential generating function]] (EGF) is used.  The EGF of a sequence <math>A_n</math> is defined as

:<math>A(x)=\sum_{n=0}^\infty A_n \frac{x^n}{n!}.</math>

===Product===
For labelled structures, we must use a different definition for product than for unlabelled structures.  In fact, if we simply used the cartesian product, the resulting structures would not even be well labelled.  Instead, we use the so-called ''labelled product'', denoted <math>\mathcal{A} \star \mathcal{B}.</math>

For a pair <math>\beta \in \mathcal{B}</math> and <math>\gamma \in \mathcal{C}</math>, we wish to combine the two structures into a single structure.  In order for the result to be well labelled, this requires some relabelling of the atoms in <math>\beta</math> and <math>\gamma</math>.  We will restrict our attention to relabellings that are consistent with the order of the original labels.  Note that there are still multiple ways to do the relabelling; thus, each pair of members determines not a single member in the product, but a set of new members. The details of this construction are found on the page of the [[Labelled enumeration theorem]].

To aid this development, let us define a function, <math>\rho</math>, that takes as its argument a (possibly weakly) labelled object <math>\alpha</math> and relabels its atoms in an order-consistent way so that <math>\rho(\alpha)</math> is well labelled.  We then define the labelled product for two objects <math>\alpha</math> and <math>\beta</math> as

:<math>\alpha \star \beta = \{(\alpha',\beta'): (\alpha',\beta') \text{ is well-labelled, } \rho(\alpha') = \alpha, \rho(\beta') = \beta \}.</math>

Finally, the labelled product of two classes <math>\mathcal{A}</math> and <math>\mathcal{B}</math> is

:<math>\mathcal{A} \star \mathcal{B} = \bigcup_{\alpha \in \mathcal{A}, \beta \in \mathcal{B}} (\alpha \star \beta).</math>

The EGF can be derived by noting that for objects of size <math>k</math> and <math>n-k</math>, there are <math>{n \choose k}</math> ways to do the relabelling.  Therefore, the total number of objects of size <math>n</math> is

:<math>\sum_{k=0}^n {n \choose k} A_k B_{n-k}.</math>

This ''binomial convolution'' relation for the terms is equivalent to multiplying the EGFs,

:<math>A(z) \cdot B(z).</math>

===Sequence===
The ''sequence construction'' <math>\mathcal{A} = \mathfrak{G}\{\mathcal{B}\}</math> is defined similarly to the unlabelled case:
:<math>\mathfrak{G}\{\mathcal{B}\} = \mathcal{E} + \mathcal{B} + (\mathcal{B} \star \mathcal{B}) + (\mathcal{B} \star \mathcal{B} \star \mathcal{B}) + \cdots</math>
and again, as above,
:<math>A(z) = \frac{1}{1 - B(z)}</math>

===Set===
In labelled structures, a set of <math>k</math> elements corresponds to exactly <math>k!</math> sequences.  This is different from the unlabelled case, where some of the permutations may coincide.  Thus for <math>\mathcal{A} = \mathfrak{P}\{\mathcal{B}\}</math>, we have
:<math>A(z) = \sum_{k = 0}^\infty \frac{B(z)^k}{k!} = \exp(B(z))</math>

===Cycle===
Cycles are also easier than in the unlabelled case.  A cycle of length <math>k</math> corresponds to <math>k</math> distinct sequences.  Thus for <math>\mathcal{A} = \mathfrak{C}\{\mathcal{B}\}</math>, we have

:<math>A(z) = \sum_{k = 0}^\infty \frac{B(z)^k}{k} = \ln\left(\frac 1 {1-B(z)}\right).</math>

===Boxed product===
In labelled structures, the min-boxed product <math>\mathcal{A}_{\min} = \mathcal{B}^{\square}\star \mathcal{C}</math> is a variation of the original product which requires the element of <math>\mathcal{B}</math> in the product with the minimal label. Similarly, we can also define a max-boxed product, denoted by <math>\mathcal{A}_{\max} = \mathcal{B}^\blacksquare \star \mathcal{C}</math>, by the same manner. Then we have,
:<math>A_{\min}(z)=A_{\max}(z)=\int^z_0 B'(t)C(t)\,dt.</math>
or equivalently, 
:<math>A_{\min}'(t)=A_{\max}'(t)=B'(t)C(t).</math>

===Example===
An increasing Cayley tree is a labelled non-plane and rooted tree whose labels along any branch stemming from the root form an increasing sequence. Then, let <math>\mathcal{L}</math> be the class of such trees. The recursive specification is now <math>\mathcal{L}=\mathcal{Z}^\square\star \operatorname{SET}(\mathcal{L}).</math>

===Other elementary constructions===

The operators
{{math|
CYC{{sub|even}},
CYC{{sub|odd}},
SET{{sub|even}},}}
and 
{{math|
SET{{sub|odd}}
}}
represent cycles of even and odd length, and sets of even and odd cardinality.

===Example===

[[Stirling numbers of the second kind]] may be derived and analyzed using the structural decomposition
:<math> \operatorname{SET}(\operatorname{SET}_{\ge 1}(\mathcal{Z})).</math>

The decomposition

:<math> \operatorname{SET}(\operatorname{CYC}(\mathcal{Z}))</math>

is used to study unsigned [[Stirling numbers of the first kind]], and in the derivation of the [[Random permutation statistics|statistics of random permutations]]. A detailed examination of the [[exponential generating function]]s associated to Stirling numbers within symbolic combinatorics may be found on the page on [[Stirling numbers and exponential generating functions in symbolic combinatorics]].

==See also==
*[[Combinatorial species]]
* [[Analytic combinatorics]]

==References==
{{reflist}}
* 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).
* Philippe Flajolet and Robert Sedgewick, ''[[Analytic Combinatorics]]'', Cambridge University Press (2009). (available online: http://algo.inria.fr/flajolet/Publications/book.pdf)
* Micha Hofri, ''Analysis of Algorithms: Computational Methods and Mathematical Tools'', Oxford University Press (1995).

[[Category:Combinatorics]]