ConceptComplete

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

Definition8.8Combinatorial Species

A combinatorial species is a functor F:B→BF: \mathbf{B} \to \mathbf{B}, where B\mathbf{B} is the category of finite sets and bijections. For each finite set UU, F[U]F[U] is the set of FF-structures on UU, and for each bijection σ:U→V\sigma: U \to V, F[σ]:F[U]→F[V]F[\sigma]: F[U] \to F[V] is a transport of structures that preserves composition and identity.

Definition8.9Generating Series of a Species

A species FF has three associated generating series:

  • Type generating series: F~(x)=βˆ‘nβ‰₯0fnxn\widetilde{F}(x) = \sum_{n \geq 0} f_n x^n, where fn=∣F[n]/Sn∣f_n = |F[n]/S_n| (number of isomorphism types)
  • Exponential generating series: F(x)=βˆ‘nβ‰₯0∣F[{1,…,n}]∣xnn!F(x) = \sum_{n \geq 0} |F[\{1,\ldots,n\}]| \frac{x^n}{n!}
  • Cycle index series: ZF=βˆ‘nβ‰₯01n!βˆ‘ΟƒβˆˆSn∣Fix⁑F[n](Οƒ)βˆ£β‹…p1c1(Οƒ)β‹―pncn(Οƒ)Z_F = \sum_{n \geq 0} \frac{1}{n!} \sum_{\sigma \in S_n} |\operatorname{Fix}_{F[n]}(\sigma)| \cdot p_1^{c_1(\sigma)} \cdots p_n^{c_n(\sigma)}

Operations on Species

ExampleAddition and Multiplication

For species FF and GG:

  • Sum (F+G)[U]=F[U]βŠ”G[U](F + G)[U] = F[U] \sqcup G[U]: disjoint union of structures.
  • Product (Fβ‹…G)[U]=⨆SβŠ†UF[S]Γ—G[Uβˆ–S](F \cdot G)[U] = \bigsqcup_{S \subseteq U} F[S] \times G[U \setminus S]: partition UU into two parts and place FF on one, GG on the other.

These operations correspond to addition and multiplication of exponential generating functions.

Definition8.10Substitution (Composition)

For species FF and GG (with G[βˆ…]=βˆ…G[\emptyset] = \emptyset), the substitution F∘GF \circ G is defined by (F∘G)[U]=β¨†Ο€βˆˆPar⁑(U)F[Ο€]Γ—βˆBβˆˆΟ€G[B],(F \circ G)[U] = \bigsqcup_{\pi \in \operatorname{Par}(U)} F[\pi] \times \prod_{B \in \pi} G[B], where Par⁑(U)\operatorname{Par}(U) is the set of partitions of UU. This corresponds to plethystic substitution of cycle index series.

RemarkDissymmetry Theorem for Trees

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 T=A+E2(T)βˆ’Tβ‹…E1(T)T = A + E_2(T) - T \cdot E_1(T), where AA is the species of rooted trees. Combined with the functional equation A(x)=xexp⁑(A(x))A(x) = x \exp(A(x)), this recovers Cayley's formula nnβˆ’2n^{n-2} for labeled trees on nn vertices.


Asymptotic Enumeration

Definition8.11Transfer Theorems

Singularity analysis provides asymptotic formulas for the coefficients of generating functions. If f(z)∼C(1βˆ’z/ρ)βˆ’Ξ±f(z) \sim C(1 - z/\rho)^{-\alpha} as z→ρz \to \rho (the dominant singularity), then [zn]f(z)∼CΞ“(Ξ±)nΞ±βˆ’1Οβˆ’n[z^n]f(z) \sim \frac{C}{\Gamma(\alpha)} n^{\alpha - 1} \rho^{-n}. This transfer theorem, combined with species operations, enables automatic asymptotic enumeration.

ExampleAsymptotics of Labeled Trees

Cayley's formula gives exactly nnβˆ’2n^{n-2} labeled trees on nn vertices. By Stirling's approximation, the fraction of all graphs on nn vertices that are trees is approximately nnβˆ’22(n2)\frac{n^{n-2}}{2^{\binom{n}{2}}}, which is super-exponentially small.