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 This Way, but Nicely. Pattern Avoidance. Follow-Up. 207
DEFINITION 5.21 Let p be an n-permutation. The subsequence of p
consisting of
all black and gray entries and
all front entries that are preceded by at least one black entry and
the entry n
is called the fundamental subsequence of p.
This means that permutations of the same class have identical fundamental
subsequences, and the part of these subsequences that is weakly on the left of
n is in the same position in each permutation belonging to the class.
DEFINITION 5.22 The classes C and C
are called similar if their
permutations have fundamental subsequences that are identical as permutation ...
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