Species and Advanced Enumeration
The theory of combinatorial species, introduced by AndrΓ© Joyal, provides a categorical framework for enumeration that unifies and extends the PΓ³lya theory. It offers a rigorous foundation for manipulating generating functions associated with combinatorial structures.
Combinatorial Species
A combinatorial species is a functor , where is the category of finite sets and bijections. For each finite set , is the set of -structures on , and for each bijection , is a transport of structures that preserves composition and identity.
A species has three associated generating series:
- Type generating series: , where (number of isomorphism types)
- Exponential generating series:
- Cycle index series:
Operations on Species
For species and :
- Sum : disjoint union of structures.
- Product : partition into two parts and place on one, on the other.
These operations correspond to addition and multiplication of exponential generating functions.
For species and (with ), the substitution is defined by where is the set of partitions of . This corresponds to plethystic substitution of cycle index series.
The theory of species provides an elegant proof of the formula for counting labeled trees. Using the dissymmetry theorem, one relates rooted and unrooted tree species via the equation , where is the species of rooted trees. Combined with the functional equation , this recovers Cayley's formula for labeled trees on vertices.
Asymptotic Enumeration
Singularity analysis provides asymptotic formulas for the coefficients of generating functions. If as (the dominant singularity), then . This transfer theorem, combined with species operations, enables automatic asymptotic enumeration.
Cayley's formula gives exactly labeled trees on vertices. By Stirling's approximation, the fraction of all graphs on vertices that are trees is approximately , which is super-exponentially small.