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
Permutations and the Rest. Algebraic Combinatorics of Permutations. 295
sight. That was corrected in [34]. The proof we present here is significantly
simpler than the previous proof.
PROOF (of Theorem 7.32) Let p P
A
n
. Recall Exercise 27 of Chapter 4.
Define f (p) to be the 132-avoiding permutation whose unlabeled binary tree is
obtained from the unlabeled binary tree T (p)ofp by reflecting T (p) through
a vertical axis. By part (b) of the mentioned exercise, this reflection will turn
left edges into right edges, and so ascents into descents, and vice versa. In
particular, the vertex that was in the ith position from the left will now be
in the ith position ...
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