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 One Line and Close. Permutations as Linear Orders. 33
PROOF Let us assume the contrary, that is, that there exists an n-
permutation p so that each maximum-length alternating subsequence of p
avoids the entry n. This means that all maximum-length alternating subse-
quences of p start on the right of n,orendontheleftofn, or “skip” n;that
is, contain an entry on the left of n that is followed by an entry on the right
of n. It is easy to see that each of these three kinds of subsequences can be
transformed into an alternating subsequence of the same length that contains
n. For instance, if s is an alternating subsequence of p so that a<bare two
consecutive ...
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