Combinatorics Generating functions and asymptotics Concept
Combinatorial species
Summary
A combinatorial species is a rule that assigns to each finite set the structures of a given kind on it, see the definition. The rule must be compatible with renaming the elements, which makes it a functor on finite sets and bijections. Each species has an exponential generating function, and operations on species match operations on these series. The theory was introduced by André Joyal and gives a conceptual basis for the symbolic method for labelled structures.
Further reading
About this page
| Tag | 7PEE48WBQF |
|---|---|
| URI | m2://7PEE48WBQF |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05A15, 18B99 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.