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
356 Combinatorics of Permutations, Second Edition
where the lower bound is assured by the decreasing permutation. That, of
course, does not mean that the decreasing permutation is indeed the most
difficult to sort, but for several years, no n-permutation p was known to
satisfy btd(p) > btd(n ···21). That changed when in 2004 Isaac Elias and
Tzvika Hartman [114] presented the following result.
PROPOSITION 9.7
Let i be a non-negative integer. Then the permutation
EH(i)=432151312···614171615···14 + 4i 17+4i 16+4i 15 + 4i
has block transposition distance 10+2i.
In other words, EH(i) consists of the following parts.
1. The decreasing sequence 4321,
2. the fixed ...
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