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
440 Combinatorics of Permutations, Second Edition
[77] A. Broder, M. Charikar, A. Frieze, M. Mitzenmacher, Min-wise inde-
pendent permutations. 30th Annual ACM Symposium on Theory of
Computing (Dallas, TX, 1998). J. Comput. System Sci., 60 (2000), no.
3, 630–659.
[78] W. G. Brown, J. W. Tutte, On the enumeration of rooted non-separable
planar maps. Canad. J. Math., 16 (1964) 572–577.
[79] S. Brunetti, A. DelLungo, F. DelRistoro, A cycle lemma for permutation
inversions. Discrete Math., 257 (2002), no. 1, 1–13.
[80] A. Burstein, A short proof for the number of permutations containing
the pattern 321 exactly once. Elec.J.Combin.18 (2), 2001, P21.
[81] L. Butler, The q-log-concavity of q-binomial coefficients. J. Combin.
Theory A, 54 (1990), no. 1, 54–63. ...
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