Combinatorics of Permutations, Second Edition
A Unified Account of Permutations in Modern Combinatorics
A 2006 CHOICE Outstanding Academic Title, the first edition of this bestseller was lauded for its detailed yet engaging treatment of permutations. Providing more than enough material for a one-semester course, Combinatorics of Permutations, Second Edition continues to clearly show the usefulness of this subject for both students and researchers and is recommended for undergraduate libraries by the MAA.
Much of the book has been significantly revised and extended. This edition includes a new section on alternating permutations and new material on multivariate applications of the exponential formula. It also discusses several important results in pattern avoidance as well as the concept of asymptotically normal distributions.
An entirely new chapter focuses on three sorting algorithms from molecular biology. This emerging area of combinatorics is known for its easily stated and extremely difficult problems, which sometimes can be solved using deep techniques from seemingly remote branches of mathematics.
Additional Exercises and Problems
All chapters in the second edition have more exercises and problems. Exercises are marked according to level of difficulty and many of the problems encompass results from the last eight years.
474 pages; ISBN 9781439850527
, or download in
Title: Combinatorics of Permutations, Second Edition
Author: Miklos Bona
Alan M. Turing 2012 US$ 13.00 210 pages
Thinking Functionally with Haskell 2014 US$ 37.00 358 pages
Microsoft SQL Server 2012 High-Performance T-SQL Using Window Functions 2012 US$ 29.99 244 pages
- Academic > Mathematics > Algebra > Magic squares
- Academic > Mathematics > General > Vinogradov, Ivan Matveevich, 1891-
- Academic > Mathematics > General > Mathematics; Periodicals
- Academic > Mathematics > General > Mathematics; Study and teaching
- Computers > Programming > Algorithms
- Computers > Data Modeling & Design
- Computers > Operating Systems