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 2
Basic Tools
Today, combinatorics is an important branch of mathematics and has many applications
in computer science, physics, chemistry, and biology. Usually, one is interested in counting
objects of a set that depend on a parameter or several parameters, for example, the number
of partitions of the set [n] (here the parameter is n), or the number of set partitions of the set
[n] with exactly k blocks (here the parameters are n and k). It is not hard to enumerate the
number of such partitions for small values of n and k by exhibiting all possibilities, but as n
(k) increases, the number of such partitions grows very fast, and so we need
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