Combinatorics of Permutations

Regular price €72.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Miklos Bona
Adjacent Transposition
advanced undergraduate textbook
Age Group_Uncategorized
Age Group_Uncategorized
analytic methods
Author_Miklos Bona
automatic-update
Binary Words
Black Edges
Bruhat Order
Category1=Non-Fiction
Category=PBD
Category=PBV
Category=PBW
Category=TJFM
Category=TQ
Category=UMB
Category=UY
COP=United Kingdom
Cycle Graph
Delivery_Delivery within 10-20 working days
discrete mathematics
Edit Distance
eq_bestseller
eq_computing
eq_isMigrated=2
eq_nobargain
eq_non-fiction
extremal combinatorics
Ferrers Shape
Fixed Point Free Involutions
genome rearrangement theory
Gray Edge
Hooklength Formula
Identity Permutation
Internal Node
Language_English
Left Subtree
Maximal Chains
Minimal Counterexample
Noncrossing Partitions
Odd Columns
Odd Cycles
PA=Available
Permutation Classes
permutation patterns in biology
Price_€50 to €100
PS=Active
Simplicial Complex
softlaunch
sorting algorithms
Stack Word
Staircase Shape
Standard Young Tableaux
Top Left Corner
Vice Versa

Product details

  • ISBN 9781032223506
  • Weight: 453g
  • Dimensions: 156 x 234mm
  • Publication Date: 26 Aug 2024
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
  • Language: English
Secure checkout Fast Shipping Easy returns

A 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, third edition continues to clearly show the usefulness of this subject for both students and researchers.

The research in combinatorics of permutations has advanced rapidly since this book was published in a first edition. Now the third edition offers not only updated results, it remains the leading textbook for a course on the topic.

Coverage is mostly enumerative, but there are algebraic, analytic, and topological parts as well, and applications.

Since the publication of the second edition, there is tremendous progress in pattern avoidance (Chapters 4 and 5). There is also significant progress in the analytic combinatorics of permutations, which will be incorporated.

•A completely new technique from extremal combinatorics disproved a long-standing conjecture, and this is presented in Chapter 4.

•The area of universal permutations has undergone a lot of very recent progress, and that has been noticed outside the academic community as well. This also influenced the revision of Chapter 5.

•New results in stack sorting are added to Chapter 8.

•Chapter 9 applications to biology has been revised.

The author’s other works include Introduction to Enumerative and Analytic Combinatorics, second edition (CHOICE "Outstanding Academic Title") and Handbook of Enumerative Combinatorics, published by CRC Press. The author also serves as Series Editor for CRC’s Discrete Mathematics and Its Applications.

Miklós Bóna received his Ph.D in mathematics from the Massachusetts Institute of Technology in 1997. Since 1999, he has taught at the University of Florida, where, in 2010, he was inducted into the Academy of Distinguished Teaching Scholars. Professor Bóna has mentored numerous graduate and undergraduate students. He is the author of four books and more than 65 research articles, mostly focusing on enumerative and analytic combinatorics. His book, Combinatorics of Permutations, won a 2006 Outstanding Title Award from Choice, the journal of the American Library Association. He is also an editor-in-chief for the Electronic Journal of Combinatorics, and for two book series at CRC Press.

More from this author