Combinatorics of permutations

Select an Action

Title:

Author:

Bóna, Miklós.

ISBN:

9781439850510

9781439850527

Personal Author:

Bóna, Miklós.

Edition:

2nd ed.

Publication Information:

Physical Description:

458 pages : illustrations ; 25 cm.

Series:

Discrete mathematics and its applications

Discrete mathematics and its applications.

General Note:

"A Chapman & Hall book."

Contents:

1. In one line and close : permutations as linear orders -- 2. In one line and anywhere : permutations as linear orders : inversions -- 3. In many circles : permutations as products of cycles -- 4. In any way but this : pattern avoidance : the basics -- 5. In this way, but nicely : pattern avoidance : follow-up -- 6. Mean and insensitive : random permutations -- 7. Permutations and the rest : algebraic combinatorics of permutations -- 8. Get them all : algorithms and permutations -- 9. How did we get here? : permutations as genome rearrangements.

Abstract:

"A 2006 CHOICE Outstanding Academic Title, this text provides comprehensive coverage of permutations. The second edition features a new chapter on modeling genomes by using permutations. Along with new applications such as genome sorting, this edition includes a set of warm-up exercises to ease readers into a problem solving mode as well as new sections addressing the growth rate of permutation classes, permutation tableaux, superpatterns, and alternating subsequences. The text also discusses pattern avoidance, inversions, and linear orders"-- Provided by publisher.

Subject Term:

Permutations.

Electronic Access:

Cover image http://jacketsearch.tandf.co.uk/common/jackets/covers/websmall/978143985/9781439850510.jpg

Copies:

Available:*

Library	Material Type	Item Barcode	Shelf Number	Copy	Status
Searching... 1:IIEMSA	1:GEN-BOOK	33168025776945	511.64 B697C 2012	1	Searching... Unknown

Bound With These Titles

On Order

Summary

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.

Expanded Chapters
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.

New Chapter
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.