The 13 possible strict weak orderings on a set of three elements {a, b, c}

In number theory and enumerative combinatorics, the ordered Bell numbers or Fubini numbers count the number of weak orderings on a set of n elements (orderings of the elements into a sequence allowing ties, such as might arise as the outcome of a horse race).^[1] Starting from n = 0, these numbers are

1, 1, 3, 13, 75, 541, 4683, 47293, 545835, 7087261, 102247563, ... (sequence A000670 in the OEIS).

The ordered Bell numbers may be computed via a summation formula involving binomial coefficients, or by using a recurrence relation. Along with the weak orderings, they count several other types of combinatorial objects that have a bijective correspondence to the weak orderings, such as the ordered multiplicative partitions of a squarefree number^[2] or the faces of all dimensions of a permutohedron^[3] (e.g. the sum of faces of all dimensions in the truncated octahedron is 1 + 14 + 36 + 24 = 75^[4]).

History[edit]

13 plane trees with ordered leaves and equal-length root-leaf paths, with the gaps between adjacent leaves labeled by the height above the leaves of the nearest common ancestor. These labels induce a weak ordering on the gaps, showing that the trees of this type are counted by the ordered Bell numbers.

The ordered Bell numbers appear in the work of Cayley (1859), who used them to count certain plane trees with n + 1 totally ordered leaves. In the trees considered by Cayley, each root-to-leaf path has the same length, and the number of nodes at distance i from the root must be strictly smaller than the number of nodes at distance i + 1, until reaching the leaves.^[5] In such a tree, there are n pairs of adjacent leaves, that may be weakly ordered by the height of their lowest common ancestor; this weak ordering determines the tree. Mor & Fraenkel (1984) call the trees of this type "Cayley trees", and they call the sequences that may be used to label their gaps (sequences of n positive integers that include at least one copy of each positive integer between one and the maximum value in the sequence) "Cayley permutations".^[6]

Pippenger (2010) traces the problem of counting weak orderings, which has the same sequence as its solution, to the work of Whitworth (1886).^[7][8]

These numbers were called Fubini numbers by Louis Comtet, because they count the number of different ways to rearrange the ordering of sums or integrals in Fubini's theorem, which in turn is named after Guido Fubini.^[9] For instance, for a bivariate integral, Fubini's theorem states that

∫A(∫Bf(x,y)dy)dx=∫B(∫Af(x,y)dx)dy=∫A×Bf(x,y)d(x,y),{displaystyle int _{A}left(int _{B}f(x,y),{text{d}}yright),{text{d}}x=int _{B}left(int _{A}f(x,y),{text{d}}xright),{text{d}}y=int _{Atimes B}f(x,y),{text{d}}(x,y),}

where these three formulations correspond to the three weak orderings on two elements. In general, in a multivariate integral, the ordering in which the variables may be grouped into a sequence of nested integrals forms a weak ordering.

The Bell numbers, named after Eric Temple Bell, count the number of partitions of a set, and the weak orderings that are counted by the ordered Bell numbers may be interpreted as a partition together with a total order on the sets in the partition.^[10]

Formula[edit]

The nth ordered Bell number may be given by a summation formula involving the Stirling numbers of the second kind, which count the number of partitions of an n-element set into k nonempty subsets,^[11][12]
expanded out into a double summation involving binomial coefficients (using a formula expressing Stirling numbers as a sum of binomial coefficients), or given by an infinite series:^[7][10]

a(n)=∑k=0nk!{nk}=∑k=0n∑j=0k(−1)k−j(kj)jn=12∑m=0∞mn2m.{displaystyle a(n)=sum _{k=0}^{n}k!left{{begin{matrix}n\kend{matrix}}right}=sum _{k=0}^{n}sum _{j=0}^{k}(-1)^{k-j}{binom {k}{j}}j^{n}={frac {1}{2}}sum _{m=0}^{infty }{frac {m^{n}}{2^{m}}}.}

An alternative summation formula expresses the ordered Bell numbers in terms of the Eulerian numbers, which count the number of permutations of n items with k + 1 runs of increasing items:^[13]

a(n)=∑k=0n−12k⟨nk⟩=An(2),{displaystyle a(n)=sum _{k=0}^{n-1}2^{k}leftlangle {begin{matrix}n\kend{matrix}}rightrangle =A_{n}(2),}

where A_n is the nth Eulerian polynomial.

The exponential generating function of the ordered Bell numbers is^{[7][10][12][14]}

∑n=0∞a(n)xnn!=12−ex.{displaystyle sum _{n=0}^{infty }a(n){frac {x^{n}}{n!}}={frac {1}{2-e^{x}}}.}

This can be expressed equivalently as the fact that the ordered Bell numbers are the numbers in the first column of the infinite matrix (2I − P)⁻¹, where I is the identity matrix and P is an infinite matrix form of Pascal's triangle.^[15]
Based on a contour integration of this generating function, the ordered Bell numbers can be expressed by the infinite sum^[2][16]

a(n)=n!2∑k=−∞∞(log⁡2+2πik)−(n+1),n≥1,{displaystyle a(n)={frac {n!}{2}}sum _{k=-infty }^{infty }(log 2+2pi ik)^{-(n+1)},qquad ngeq 1,}

and approximated as^{[2][12][17][18][16]}

a(n)≈n!2(log⁡2)n+1.{displaystyle a(n)approx {frac {n!}{2(log 2)^{n+1}}}.}

Because log 2 is less than one, the form of this approximation shows that the ordered Bell numbers exceed the corresponding factorials by an exponential factor. The asymptotic convergence of this approximation may be expressed as

limn→∞na(n−1)a(n)=log⁡2.{displaystyle lim _{nto infty }{frac {n,a(n-1)}{a(n)}}=log 2.}

Recurrence and modular periodicity[edit]

As well as the formulae above, the ordered Bell numbers may be calculated by the recurrence relation^[7][17]

a(n)=∑i=1n(ni)a(n−i).{displaystyle a(n)=sum _{i=1}^{n}{binom {n}{i}}a(n-i).}

The intuitive meaning of this formula is that a weak ordering on n items may be broken down into a choice of some nonempty set of i items that go into the first equivalence class of the ordering, together with a smaller weak ordering on the remaining n − i items. As a base case for the recurrence, a(0) = 1 (there is one weak ordering on zero items). Based on this recurrence, these numbers can be shown to obey certain periodic patterns in modular arithmetic: for sufficiently large n,

a(n+4)≡a(n)(mod10),{displaystyle a(n+4)equiv a(n){pmod {10}},}^[17]

a(n+20)≡a(n)(mod100),{displaystyle a(n+20)equiv a(n){pmod {100}},}

a(n+100)≡a(n)(mod1000),{displaystyle a(n+100)equiv a(n){pmod {1000}},} and

a(n+500)≡a(n)(mod10000).{displaystyle a(n+500)equiv a(n){pmod {10000}}.}^[19]

Several additional modular identities are given by Good (1975) and Poonen (1988).^[11][20]

Additional applications[edit]

As has already been mentioned, the ordered Bell numbers count weak orderings, permutohedron faces, Cayley trees, Cayley permutations, ordered multiplicative partitions of squarefree numbers, and equivalent formulae in Fubini's theorem. Weak orderings in turn have many other applications. For instance, in horse racing, photo finishes have eliminated most but not all ties, called in this context dead heats, and the outcome of a race that may contain ties (including all the horses, not just the first three finishers) may be described using a weak ordering. For this reason, the ordered Bell numbers count the possible number of outcomes of a horse race,^[1] or the possible outcomes of a multi-candidate election.^[21] In contrast, when items are ordered or ranked in a way that does not allow ties (such as occurs with the ordering of cards in a deck of cards, or batting orders among baseball players), the number of orderings for n items is a factorial number n!,^[22] which is significantly smaller than the corresponding ordered Bell number.^[23]

Kemeny (1956) uses the ordered Bell numbers to describe the "complexity" of an n-ary relation, by which he means the number of other relations one can form from it by permuting and repeating its arguments (lowering the arity with every repetition).^[24] In this application, for each derived relation, the arguments of the original relation are weakly ordered by the positions of the corresponding arguments of the derived relation.

Velleman & Call (1995) consider combination locks with a numeric keypad, in which several keys may be pressed simultaneously and a combination consists of a sequence of keypresses that includes each key exactly once. As they show, the number of different combinations in such a system is given by the ordered Bell numbers.^[13]

Ellison & Klein (2001) point out an application of these numbers to optimality theory in linguistics. In this theory, grammars for natural languages are constructed by ranking certain constraints, and (in a phenomenon called factorial typology) the number of different grammars that can be formed in this way is limited to the number of permutations of the constraints. A paper reviewed by Ellison and Klein suggested an extension of this linguistic model in which ties between constraints are allowed, so that the ranking of constraints becomes a weak order rather than a total order. As they point out, the much larger magnitude of the ordered Bell numbers, relative to the corresponding factorials, allows this theory to generate a much richer set of grammars.^[23]

References[edit]