Metraipolis › archive › dc_c48d139e50ec
Enumerative combinatorics — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Enumerative_combinatorics
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T14:40:11.694Z
- SHA-256 of the archived text
775ac942bd2d1e40b64d310456bc9048e12c9f335f72bbf3586c0edb42531249- Stable URL of this page
https://metraipolis.com/documento/dc_c48d139e50ec
How to cite
Enumerative combinatorics — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Enumerative_combinatorics (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c48d139e50ec (Metraipolis archive dc_c48d139e50ec, sha256 775ac942bd2d1e40b64d310456bc9048e12c9f335f72bbf3586c0edb42531249)
BibTeX
@misc{dcc48d139e50ec,
title = {Enumerative combinatorics — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Enumerative_combinatorics},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c48d139e50ec; sha256 775ac942bd2d1e40b64d310456bc9048e12c9f335f72bbf3586c0edb42531249},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Enumerative_combinatorics. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type of problem are counting combinations and counting permutations. More generally, given an infinite collection of finite sets Si indexed by the natural numbers, enumerative combinatorics seeks to describe a counting function which counts the number of objects in Sn for each n. Although counting the number of elements in a set is a rather broad mathematical problem, many of the problems that arise in applications have a relatively simple combinatorial description. The twelvefold way provides a unified framework for counting permutations, combinations and partitions. The simplest such functions are closed formulas, which can be expressed as a composition of elementary functions such as factorials, powers, and so on. For instance, as shown below, the number of different possible orderings of a deck of n cards is f(n) = n!. The problem of finding a closed formula is known as algebraic enumeration, and frequently involves deriving a recurrence relation or generating function and using this to arrive at the desired closed form. Often, a complicated closed formula yields little insight into the behavior of the counting function as the number of counted objects grows. In these cases, a simple asymptotic approximation may be preferable. A function g ( n ) {\displaystyle g(n)} is an asymptotic approximation to f ( n ) {\displaystyle f(n)} if f ( n ) / g ( n ) → 1 {\displaystyle f(n)/g(n)\rightarrow 1} as n → ∞ {\displaystyle n\rightarrow \infty } . In this case, we write f ( n ) ∼ g ( n ) . {\displaystyle f(n)\sim g(n).\,}
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «combinatorics»).
Fonte: Wikipedia in inglese, voce «Enumerative combinatorics» — https://en.wikipedia.org/wiki/Enumerative_combinatorics
Wikidata Q336787 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q336787
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Enumerative_combinatorics?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 1336734229, consultata il 2026-10-15T14:00:00.938Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1f0ff97315a59c60b825e390557feed316bb32d2e63b08a92f170f892ee12989