Stirling numbers of the second kind
E1245025
UNEXPLORED
Stirling numbers of the second kind are a family of combinatorial numbers that count the ways to partition a set of n labeled elements into k nonempty, unlabeled subsets.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Stirling numbers of the second kind canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T16991858 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Stirling numbers of the second kind Context triple: [The Twelvefold Way, relatesTo, Stirling numbers of the second kind]
-
A.
Bell numbers
Bell numbers are a sequence in combinatorics that count the number of ways to partition a finite set into nonempty, unlabeled subsets.
-
B.
Catalan numbers
Catalan numbers are a sequence of natural numbers that count a wide variety of combinatorial structures, such as correctly matched parentheses, binary tree shapes, and lattice path configurations.
-
C.
The Twelvefold Way
The Twelvefold Way is a framework in combinatorics that systematically classifies twelve fundamental ways of counting functions between finite sets under various labeling and structural constraints.
-
D.
Dedekind number
A Dedekind number is the count of distinct monotone Boolean functions (or equivalently, antichains) on an n-element set, forming a rapidly growing sequence studied in combinatorics and lattice theory.
-
E.
Pólya enumeration theorem
The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Stirling numbers of the second kind Target entity description: Stirling numbers of the second kind are a family of combinatorial numbers that count the ways to partition a set of n labeled elements into k nonempty, unlabeled subsets.
-
A.
Bell numbers
Bell numbers are a sequence in combinatorics that count the number of ways to partition a finite set into nonempty, unlabeled subsets.
-
B.
Catalan numbers
Catalan numbers are a sequence of natural numbers that count a wide variety of combinatorial structures, such as correctly matched parentheses, binary tree shapes, and lattice path configurations.
-
C.
The Twelvefold Way
The Twelvefold Way is a framework in combinatorics that systematically classifies twelve fundamental ways of counting functions between finite sets under various labeling and structural constraints.
-
D.
Dedekind number
A Dedekind number is the count of distinct monotone Boolean functions (or equivalently, antichains) on an n-element set, forming a rapidly growing sequence studied in combinatorics and lattice theory.
-
E.
Pólya enumeration theorem
The Pólya enumeration theorem is a fundamental result in combinatorics that counts distinct configurations of objects under group actions by using cycle index polynomials and generating functions.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.