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
212 Combinatorics of Permutations, Second Edition
to a P -recursive function of n by our induction hypothesis as q
is
shorter than q.
Example 5.28
If q =341652,then q
=23541;thus we lose three subsequences
of type 132 when deleting 1. Therefore, we can apply our inductive
hypothesis for r 3, then reinsert the entry 1 to its place. If q =
3124, then we do not lose any 132-patterns when deleting the entry
1 and getting q
= 2 1 3. Thus we still need to count permutations
with r 132-patterns, but they must end with q
,notwithq.The
pattern q
is shorter than q, thus the induction hypothesis on k can
be applied.
If q has at most r inversions, but q is no
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