Combinatorics of permutations
QA165 .B66 2012
- Unknown QA165 .B66 2012
- Includes bibliographical references (p. 435-452) and index.
- In one line and close : permutations as linear orders
- In one line and anywhere : permutations as linear orders : inversions
- In many circles : permutations as products of cycles
- In any way but this : pattern avoidance : the basics
- In this way, but nicely : pattern avoidance : follow-up
- Mean and insensitive : random permutations
- Permutations and the rest : algebraic combinatorics of permutations
- Get them all : algorithms and permutations
- How did we get here? : permutations as genome rearrangements.
- "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.
- Publication date
- Miklós Bóna.
- Discrete mathematics and its applications
- "A Chapman & Hall book."