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
338 Combinatorics of Permutations, Second Edition
permutation p by such a deque, it is obvious that we have to keep the deque
increasing from top to bottom, which makes the definition of the rest of the
sorting algorithm easy. The reader should try to solve Exercises 24 and 25 for
the details.
Exercises
1. Take a permutation of length n. Assign a direction (Left or Right)
to each entry, such as in 2
L
3
R
4
L
1
R
5
L
.Callanentryx winning if its
neighbor in the direction given to x exists, is y,andy<x.Sofor
instance, in 2
L
3
R
4
L
1
R
5
L
, the entries 4 and 5 are winning.
Now consider the following algorithm. Start with the permutation p
1
=
1
L
2
L
···n
L
. Find the largest winning ...
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