Stirling numbers arise in a variety of analytic and combinatorial problems and are named after James Stirling, who introduced them in a purely algebraic setting in his 1730 book Methodus differentialis; they were rediscovered and given a combinatorial meaning by Masanobu Saka in his 1782 work Sanpo-Gakkai. Two different sets of numbers carry the name, the Stirling numbers of the first kind and of the second kind, and Lah numbers are sometimes called Stirling numbers of the third kind. A property common to all three kinds is that they describe coefficients relating three different sequences of polynomials that arise often in combinatorics, and all three can be defined as counting the ways of partitioning a set of n elements into k nonempty subsets in which each subset carries a certain kind of order, either no order, cyclical order, or linear order.
Facts
Connections
In Branch
Source Wikipedia: Stirling numbers of the second kind
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Wikipedia: Stirling numbers of the second kind
Introduction
a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of n objects into k non-empty subsets.
In Branch: Combinatorics, Lead sentence
In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number o
View the Source2. James Stirling - MacTutor History of Mathematics
BiographyQuote, Biography
While in London, Stirling published his most important work Methodus Differentialis in 1730.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.