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
376 Combinatorics of Permutations, Second Edition
7
7
L
R
2
L
2
R
1
L
1
R
00
R
R
5
5
6
6
L
L
R
R
4
L
4
R
3
3
L
L
FIGURE 9.12
The breakpoint graph of B(312 231).
However, the following is an example of a super-bad permutation.
Example 9.36
[200] It can be computationally verified [200] that the 10-permutation
85210741963
is super-bad.
DEFINITION 9.37 Let p and q be permutations so that p is at least as
long as q,andletC be an odd cycle in B(p). We say that C is homeomorphic
to B(q) if there is a cyclic-order preserving function π from the vertex set of
B(q) into the vertex set of B(p) so that π(B(q)) = C.
For example, if q is a permutation that consists of a single cycle, then the
cycle ...
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