Skip to Main Content
Commutation Relations, Normal Ordering, and Stirling Numbers
book

Commutation Relations, Normal Ordering, and Stirling Numbers

by Toufik Mansour, Matthias Schork
September 2015
Intermediate to advanced content levelIntermediate to advanced
528 pages
19h 34m
English
Chapman and Hall/CRC
Content preview from Commutation Relations, Normal Ordering, and Stirling Numbers
Chapter 3
Stirling and Bell Numbers
In this chapter we recall the definition and basic properties of the classical Stirling and
Bell numbers. Many of these properties were already discussed in preceding chapters. For
instance, the Stirling numbers of the second kind, S(n, k), were introduced as the numbers
counting set partitions of the set [n] having k blocks, and later considerations showed that
they appear as connection coefficients when writing x
n
in terms of (x)
k
; see (1.3). We recall
that the numbers S(n, k) also appear as normal ordering coefficients for (XD)
n
and as rook
numbers of particular Ferrers boards. For the Bell numbers, which are closely ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

The Separable Galois Theory of Commutative Rings, 2nd Edition

The Separable Galois Theory of Commutative Rings, 2nd Edition

Andy R. Magid
Algebraic Operads

Algebraic Operads

Murray R. Bremner, Vladimir Dotsenko
Methods in Algorithmic Analysis

Methods in Algorithmic Analysis

Vladimir A. Dobrushkin
Distributed Computing Through Combinatorial Topology

Distributed Computing Through Combinatorial Topology

Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum

Publisher Resources

ISBN: 9781466579897