Lah number¶

A signed or unsigned combinatorial coefficient converting rising factorials to falling factorials and counting partitions of n labeled elements into k nonempty linearly ordered lists.

Version: v2 · 2026-09-19 · History
Domain-specific #: 5246
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Combinatorics, Connection Coefficients → Mathematics

Core Idea¶

Unsigned Lah numbers L(n,k) count partitions of n labeled elements into k unordered blocks, each block linearly ordered. Choosing block leaders and ordering elements yields a closed binomial-factorial formula, while basis expansion makes the same numbers connection coefficients. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of combinatorics. It is ordered-block partition numbers linking two factorial polynomial bases. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that block ordering and sign convention are stated and indices satisfy n≥k≥1 with boundary cases declared fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Counting Line-Ups

Say you have some friends and want to split them into a set number of lines, like lines for the slide. Inside each line, who's first and who's second matters. But the lines themselves have no names, so swapping two whole lines doesn't count as new. A Lah number tells you how many different ways you can do this.

Groups That Stand in Line

A Lah number counts the ways to split a group of different people into a certain number of lines. The order of people inside each line matters, but the lines are not labeled, so swapping whole lines doesn't make a new way. For example, there are 6 ways to put 3 people into 2 lines. You pick which two share a line (3 choices), then decide who stands first in that line (2 choices). Mathematicians write this as L(n, k), meaning n people in k lines.

Ordered-Block Partition Numbers

The unsigned Lah number L(n, k) counts the ways to partition n labeled items into k nonempty blocks. Each block is linearly ordered, and the blocks themselves are unordered. This differs from Stirling numbers of the second kind, where the order within a block doesn't matter. Counting by choosing block leaders and arranging the elements gives a closed formula combining a binomial coefficient and factorials: L(n, k) = C(n−1, k−1)·n!/k!. For example, L(3, 2) = 2·6/2 = 6. The same numbers also show up when converting between two families of 'factorial' polynomials. You must state which sign convention you use and how the boundary cases are handled.

Unsigned Lah numbers L(n,k) count partitions of an n-element labeled set into k unordered blocks, each equipped with a linear order. A leader-selection and ordering argument gives a closed binomial–factorial formula. Algebraically, the same numbers are the connection coefficients between two factorial polynomial bases, the rising and falling factorials. A precise statement requires three conventions: - that blocks are linearly ordered - whether signed or unsigned numbers are meant - the index range n ≥ k ≥ 1, with boundary cases declared Substituting unordered blocks gives Stirling numbers instead, which is a different object.

Scope of Application¶

Lah number belongs to combinatorics and is useful where the analyst can specify integers n and k, labeled set, partition into lists, ordering within blocks, unsigned and signed conventions, rising and falling factorial bases and generating functions, then evaluate block ordering and sign convention are stated and indices satisfy n≥k≥1 with boundary cases declared. The scope is broad within that domain but bounded by the need for block ordering and sign convention are stated and indices satisfy n≥k≥1 with boundary cases declared. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making block ordering and sign convention are stated and indices satisfy n≥k≥1 with boundary cases declared the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Lah number can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Lah number. Lah number compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: integers n and k, labeled set, partition into lists, ordering within blocks, unsigned and signed conventions, rising and falling factorial bases and generating functions. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express block ordering and sign convention are stated and indices satisfy n≥k≥1 with boundary cases declared independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of combinatorics because they reuse integers n and k, labeled set, partition into lists, ordering within blocks, unsigned and signed conventions, rising and falling factorial bases and generating functions, Choosing block leaders and ordering elements yields a closed binomial-factorial formula, while basis expansion makes the same numbers connection coefficients., and type the carrier, state every parameter and convention in the definition, test that block ordering and sign convention are stated and indices satisfy n≥k≥1 with boundary cases declared, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Lah number Domain-specific

Parents (1) — outgoing typed relations

Lah number is a kind of Composition Prime

Lah numbers count compositions of labeled elements into ordered blocks.

Hierarchy path (1) — routes to 1 parentless root

Lah number → is a kind of Composition → presupposes Gestalt Principles → is a decomposition of Holism

Neighborhood in Abstraction Space¶

Lah number sits in a crowded region of the domain-specific corpus (17^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Combinatorial Enumeration & Sequences (38 abstractions)

Nearest neighbors

Schröder number — 0.91
Stirling numbers of the second kind — 0.91
Order polynomial — 0.90
Addition principle — 0.90
Piecewise syndetic set — 0.90

Computed from structural-signature embeddings · 2026-10-25