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 This Way, but Nicely. Pattern Avoidance. Follow-Up. 217
DEFINITION 5.35 For any positive integer n,letk
n
be the positive
integer for which
M
n
=max
kn
M
k
+ k
m
2

is maximal. If there are several integers with this property, then let k
n
be the
largest among them.
In other words, k
n
is the largest possible length of the remaining permu-
tation after removing the last layer of an optimal n-permutation p.When
there is no danger of confusion, we will only write k instead of k
n
, to simplify
notation. We will also always use m = n k to denote the length of the last
layer of p.
We continue our search for 132-optimal n-permutations. The construction
at the beginni ...
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