Skip to Main Content
Combinatorics of Permutations, 2nd Edition
book

Combinatorics of Permutations, 2nd Edition

by Miklos Bona
April 2016
Intermediate to advanced content levelIntermediate to advanced
478 pages
14h 44m
English
Chapman and Hall/CRC
Content preview from Combinatorics of Permutations, 2nd Edition
In Many Circles. Permutations as Products of Cycles. 115
THEOREM 3.49
Let K be a field of characteristic zero, and let f
i
: N K be functions,
1 i k. Define h : N K by
h(n)=
f
1
(|A
1
|)f
2
(|A
2
|) ···f
k
(|A
k
|),
where the sum ranges over all weak ordered partitions (A
1
,A
2
, ···,A
k
) of [n]
into k parts. Let F
i
(x) and H(x) be the exponential generating functions of
the sequences f
i
(n) and h(n). Then we have
H(x)=F
1
(x)F
2
(x) ···F
n
(x).
You could ask what the advantage of letting f and h map into any field of
characteristic zero is, as opposed to just the field of real or complex numbers.
The answer will become obvious when we discuss cycle indices later in this
section. ...
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

Introduction to Combinatorics, 2nd Edition

Introduction to Combinatorics, 2nd Edition

Martin J. Erickson

Publisher Resources

ISBN: 9781439850527