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
140 Combinatorics of Permutations, Second Edition
Solutions to Problems Plus
1. This result was first proved by Jeffrey Remmel in [221] as a corollary
to a more general argument involving q-analogues. Other proofs can be
found in [104] and (in a slightly different context), in [268].
2. (a) The proofs are different for the cases of odd n and even n.Thecase
of even n can be proved very similarly to Exercise 61. For odd n,
however, we cannot solely rely on our previous methods, because
2n + 2 is divisible by 4, and so there are permutations counted
by SQ
2n+2
whose odd part is empty. (And therefore, their even
part is of length 2n + 2, and as such, cannot b
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