Metraipolis › archive › dc_140b04fa1876

Combinatorial species — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Combinatorial_species
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:28:03.490Z
SHA-256 of the archived text
60e8d60388e33d75da566e3652eb9fb9658e66a09d0e9728a900c1ab2c656590
Stable URL of this page
https://metraipolis.com/documento/dc_140b04fa1876

How to cite

Combinatorial species — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Combinatorial_species (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_140b04fa1876 (Metraipolis archive dc_140b04fa1876, sha256 60e8d60388e33d75da566e3652eb9fb9658e66a09d0e9728a900c1ab2c656590)
BibTeX
@misc{dc140b04fa1876,
  title = {Combinatorial species — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Combinatorial_species},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_140b04fa1876; sha256 60e8d60388e33d75da566e3652eb9fb9658e66a09d0e9728a900c1ab2c656590},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Combinatorial_species. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for deriving the generating functions of discrete structures, which allows one to not merely count these structures but give bijective proofs involving them. Examples of combinatorial species are (finite) graphs, permutations, trees, and so on; each of these has an associated generating function which counts how many structures there are of a certain size. One goal of species theory is to be able to analyse complicated structures by describing them in terms of transformations and combinations of simpler structures. These operations correspond to equivalent manipulations of generating functions, so producing such functions for complicated structures is much easier than with other methods. The theory was introduced, carefully elaborated and applied by Canadian researchers around André Joyal. The power of the theory comes from its level of abstraction. The "description format" of a structure (such as adjacency list versus adjacency matrix for graphs) is irrelevant, because species are purely algebraic. Category theory provides a useful language for the concepts that arise here, but it is not necessary to understand categories before being able to work with species. The category of species is equivalent to the category of symmetric sequences in finite sets.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «category theory»).
Fonte: Wikipedia in inglese, voce «Combinatorial species» — https://en.wikipedia.org/wiki/Combinatorial_species
Wikidata Q4457949 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4457949
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Combinatorial_species?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1377819986, consultata il 2026-10-07T22:08:34.816Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8c85f722af146e47f2c67bd600b0b1bb67ce6e4ce8a59651b2d0cc38aaa19ab7