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
332 Commutation Relations, Normal Ordering, and Stirling Numbers
The mapping ρ → ρ
is seen to be an involution of A which is not defined in the case
when the block C is either of the following forms:
(i) C = {E
1
,...,E
t
, {c
2
γ
2
}, {c
1
γ
1
}}, (ii) C = {E
1
,...,E
t
, {c
1
γ
1
c
2
γ
2
}},
where γ
1
and γ
2
are possibly empty sequences and the E
i
are contents-ordered blocks which
occur in decreasing order according to the size of the first element and in which the first
element is also the smallest one within each block. However, exchanging (i)for(ii), and
vice versa, defines an involution in this case that reverses the weight, which completes the
proof of (8.122).
8.5.10.2 Com ...
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