Assemblies of Ordered Partitions

• Assemblies of ordered partitions are combinatorial structures defined as sequences of ordered partitions with increasing minima and sum constraints.
• They enable unified enumeration through generalized Lah numbers, Stirling numbers, and explicit generating functions that capture rich algebraic interconnections.
• These assemblies underpin the classification of Bott–Samelson-type Bott manifolds and support moment-cumulant inversion in non-commutative stochastic analysis.

Assemblies of ordered partitions are combinatorial structures arising in the enumeration and classification of objects in algebraic topology, algebraic combinatorics, and stochastic analysis. These assemblies represent sequences of ordered partitions of a finite set, subject to specific conditions on their composition, and they appear centrally in the study of Bott manifolds of Bott–Samelson type, generalized Lah numbers, ordered cumulants, and related generating functions. The combinatorics of assemblies of ordered partitions unify several strands of enumeration involving ordered blocks, constraint-driven partition combinatorics, and poset-theoretic Möbius inversion.

1. Ordered Partitions and Assemblies: Definitions and Basic Properties

An ordered partition of a finite set $[m]=\{1,2,\dots,m\}$ is a sequence $\tau=(\tau^1,\dots,\tau^r)$ of mutually disjoint nonempty subsets, where the order of the blocks is significant. The underlying (unordered) partition is formed by the set $\{\tau^1,\dots,\tau^r\}$, while $U(\tau)=\tau^1\cup\cdots\cup\tau^r$ gives the support, and $\min(\tau)=\min(U(\tau))$ picks out the smallest index involved.

An assembly of ordered partitions with bound $n$ is a sequence $\sigma=(\sigma_1,\dots,\sigma_\ell)$, where each $\sigma_a$ is itself an ordered partition of $[m]$, satisfying:

• The subsets $U(\sigma_1),\dots,U(\sigma_\ell)$ form a partition of $\tau=(\tau^1,\dots,\tau^r)$0.
• The minima increase strictly: $\tau=(\tau^1,\dots,\tau^r)$1.
• The sum condition: $\tau=(\tau^1,\dots,\tau^r)$2, where $\tau=(\tau^1,\dots,\tau^r)$3 is the number of blocks in $\tau=(\tau^1,\dots,\tau^r)$4. These are denoted $\tau=(\tau^1,\dots,\tau^r)$5 (Jeong et al., 12 Nov 2025).

Assemblies are structurally decomposable into their constituent ordered partitions, enabling recursive construction and enumeration. The notion of neighbors in an assembly defines which elements may be transposed or considered adjacent, critical in characterizing equivalence relations and isomorphism classes.

2. Enumeration, Generating Functions, and Generalized Lah Numbers

Assemblies of ordered partitions are enumerated by various generalizations of classical combinatorial numbers:

• If unordered partitions are decorated by block orderings, the count of ordered partitions of $\tau=(\tau^1,\dots,\tau^r)$6 into $\tau=(\tau^1,\dots,\tau^r)$7 blocks is $\tau=(\tau^1,\dots,\tau^r)$8, where $\tau=(\tau^1,\dots,\tau^r)$9 is the Stirling number of the second kind. The total number of ordered partitions (the Fubini–Bell, or ordered-Bell, numbers) is $\{\tau^1,\dots,\tau^r\}$0 (Bonnier et al., 2019).
• For assemblies encoding additional constraints (such as fixed block sizes and distinguished elements), Jehanne–Rath–Soria introduce generalized Lah numbers $\{\tau^1,\dots,\tau^r\}$1, counting partitions of $\{\tau^1,\dots,\tau^r\}$2 into ordered blocks of sizes in $\{\tau^1,\dots,\tau^r\}$3 such that the first $\{\tau^1,\dots,\tau^r\}$4 distinguished elements occupy distinct blocks (Bényi et al., 2020).
• The exponential generating function for these numbers is

$\{\tau^1,\dots,\tau^r\}$5

• The enumeration of BS-type Bott manifolds is governed by

$\{\tau^1,\dots,\tau^r\}$6

where $\{\tau^1,\dots,\tau^r\}$7, and $\{\tau^1,\dots,\tau^r\}$8 is blockwise reversal (Jeong et al., 12 Nov 2025).

Example Table: Enumeration in Small Cases

$\{\tau^1,\dots,\tau^r\}$9	Shape in $U(\tau)=\tau^1\cup\cdots\cup\tau^r$0	$U(\tau)=\tau^1\cup\cdots\cup\tau^r$1 (Count)	$U(\tau)=\tau^1\cup\cdots\cup\tau^r$2
2	$U(\tau)=\tau^1\cup\cdots\cup\tau^r$3, $U(\tau)=\tau^1\cup\cdots\cup\tau^r$4, $U(\tau)=\tau^1\cup\cdots\cup\tau^r$5, $U(\tau)=\tau^1\cup\cdots\cup\tau^r$6	4	$U(\tau)=\tau^1\cup\cdots\cup\tau^r$7 for $U(\tau)=\tau^1\cup\cdots\cup\tau^r$8
3	$U(\tau)=\tau^1\cup\cdots\cup\tau^r$9, $\min(\tau)=\min(U(\tau))$0, etc. (see (Jeong et al., 12 Nov 2025))	19 (complete list casewise)	$\min(\tau)=\min(U(\tau))$1

This demonstrates the combinatorial explosion and rich structure in assemblies as parameters grow.

3. Lattice Structure and Möbius Inversion

The set of ordered partitions $\min(\tau)=\min(U(\tau))$2 of a poset $\min(\tau)=\min(U(\tau))$3 forms a lattice with respect to refinement: $\min(\tau)=\min(U(\tau))$4 if every block of $\min(\tau)=\min(U(\tau))$5 is contained in a block of $\min(\tau)=\min(U(\tau))$6. The meet is common refinement, and the join is the minimal coarser ordered partition. For $\min(\tau)=\min(U(\tau))$7 an antichain, $\min(\tau)=\min(U(\tau))$8 specializes to totally ordered set partitions with the classical Fubini–Bell sequence appearing in enumeration (Bonnier et al., 2019).

The Möbius function on this lattice supports inversion formulas that parallel the classical moment-cumulant duality, but in the context of ordered partitions. The inversion weights and antichain ancestry are computed according to block factorials and signed combinatorial sums, with explicit formulas for the Möbius function in terms of block-structures:

$\min(\tau)=\min(U(\tau))$9

where $n$0 is the antichain ancestry of $n$1.

For assemblies, the inverse of the matrix of generalized Lah numbers is interpreted via the Möbius function of certain posets of pairs, relating asterisk-lists and ordinary lists whose cardinalities are determined by set $n$2 and parameter $n$3 (Bényi et al., 2020).

4. Assemblies and Bott Manifolds of Bott–Samelson Type

Assemblies of ordered partitions have a central role in the classification of Bott manifolds of Bott–Samelson type, which are smooth projective toric varieties arising as desingularizations of Schubert varieties.

Jeong–Kim–Lee establish that each sequence $n$4 corresponds (via explicit maps) to an assembly $n$5 and a Bott matrix $n$6, with the key result (Jeong et al., 12 Nov 2025):

• The set of Bott manifolds of Bott–Samelson type of size $n$7 and parameter $n$8 is in bijection with $n$9, where $\sigma=(\sigma_1,\dots,\sigma_\ell)$0 is block-wise reversal.
• Two assemblies correspond to the same Bott manifold if and only if they are related by block reversals.

The generating function for $\sigma=(\sigma_1,\dots,\sigma_\ell)$1 therefore also counts Bott–Samelson-type Bott manifolds up to the natural involution.

5. Isomorphism Classes and Admissible Transpositions

To distinguish isomorphism classes of the associated manifolds, an equivalence $\sigma=(\sigma_1,\dots,\sigma_\ell)$2 on $\sigma=(\sigma_1,\dots,\sigma_\ell)$3 is defined by admissible transpositions and blockwise reversals. An admissible transposition $\sigma=(\sigma_1,\dots,\sigma_\ell)$4 is allowed for $\sigma=(\sigma_1,\dots,\sigma_\ell)$5 if $\sigma=(\sigma_1,\dots,\sigma_\ell)$6 and $\sigma=(\sigma_1,\dots,\sigma_\ell)$7 are not neighbors in $\sigma=(\sigma_1,\dots,\sigma_\ell)$8.

Two assemblies are in the same $\sigma=(\sigma_1,\dots,\sigma_\ell)$9-equivalence class if one may be obtained from the other by a sequence of admissible transpositions and block reversals. This yields the classification:

• Isomorphism classes of Bott–Samelson-type Bott manifolds are in bijection with $\sigma_a$0.
• The necessary and sufficient combinatorial invariant is thus the $\sigma_a$1-class of the assembly.

The correspondence between toric isomorphisms of Bott towers and these combinatorial operations is rigorously verified (Jeong et al., 12 Nov 2025).

6. Moment-Cumulant Structure and Ordered Partition Species

Ordered partitions also form the foundation for moment–cumulant theory in the context of non-commutative stochastic analysis. In particular, signature moments and cumulants of stochastic processes are indexed by ordered partitions, with the Möbius function of the ordered partition lattice governing the inversion between moments and cumulants (Bonnier et al., 2019). The combinatorial species framework expresses the set of ordered partitions as the species composition $\sigma_a$2, with the exponential generating function

$\sigma_a$3

This combinatorial foundation directly yields recurrences for ordered-Bell numbers and supports deep analytic parallels with classical partition-based cumulants.

7. Generalizations, Poset Structures, and Unified Enumeration

The framework for assemblies of ordered partitions generalizes in several directions:

• Generalized Lah numbers recover classical enumeration (unsigned Lah, Stirling, Fubini–Bell) as degenerate cases.
• Poset-based interpretations allow for the combinatorial and algebraic study of inversion and Möbius function calculations in ordered block settings.
• Explicit determinantal formulas and generating functions admit closed-form enumeration for a diverse array of ordered partition assemblies (e.g., doubly-ordered partitions, Fubini-type counts under restriction) (Bényi et al., 2020).

A plausible implication is that the combinatorial infrastructure of assemblies of ordered partitions will continue to facilitate advances wherever ordered block decompositions interface with algebraic or geometric classification problems, particularly in enumerative geometry, combinatorial Hopf algebras, and higher-cumulant theories.