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
Basic Tools 43
time a rook is placed i new rows are created and drawn to the right end and immediately
above where we placed the rook. For i>0, as we place a rook, the next rook to be placed
has an increased number of possible positions. Note that i = 0 corresponds to the classical
rook placements considered in preceding sections.
Example 2.63 Let us consider the Ferrers board B(1, 1, 3, 3, 5) shown in Figure 2.3. We
will place 3 non-taking rooks in columns 1, 3,and4 using a 1-creation rule. For the first
rook in the first column, there is only one possibility to place it. After placing the rook, we
create to the right of the rook a new row. The result ...
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