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
How Did We Get Here? Permutations as Genome Rearrangements. 381
12. Let us say that the permutation p = p
1
p
2
···p
n
has a bond in i [0,n]if
p
i+1
= p
i
+1, where p
0
=0andp
n+1
= n+ 1. State and prove a slightly
stronger version of Theorem 9.6 in terms of the number of bonds of p.
13. Sort the permutation 963852741 with five block transpositions.
14. Let p be an n-permutation, and let us sort p by block interchanges in
which each block consists of one entry. Find a formula for the number
of such operations needed to sort p.
15. (–) Let p be an n-permutation, and let is(p) be the length of the longest
increasing subsequence of p.Provethatbtd(n) n is(p), a
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