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
222 Combinatorics of Permutations, Second Edition
p

be the result of adding k to every element of that permutation. Then, by
construction, p = p
p

S
n
and c(p)=ks + t = c as desired.
One can modify the proof of the previous theorem to locate precisely where
the internal zeros could be for an IZ sequence. We will need the fact (estab-
lished by computer) that for n 12 the only IZ integers are 6, 8, and 9, and
that they all satisfied the following result.
THEOREM 5.43
For any positive integer n, the sequence F
n
does not have internal zeros, except
possibly for c = M
n
1 or c = M
n
2, but not both.
PROOF We prove this theorem by induction on n. Numerical ...
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