Combinatorics of Permutations
Sorozatcím: Discrete Mathematics and Its Applications;
-
10% KEDVEZMÉNY?
- A kedvezmény csak az 'Értesítés a kedvenc témákról' hírlevelünk címzettjeinek rendeléseire érvényes.
- Kiadói listaár GBP 56.99
-
28 124 Ft (26 785 Ft + 5% áfa)
Az ár azért becsült, mert a rendelés pillanatában nem lehet pontosan tudni, hogy a beérkezéskor milyen lesz a forint árfolyama az adott termék eredeti devizájához képest. Ha a forint romlana, kissé többet, ha javulna, kissé kevesebbet kell majd fizetnie.
- Kedvezmény(ek) 10% (cc. 2 812 Ft off)
- Kedvezményes ár 25 312 Ft (24 107 Ft + 5% áfa)
Iratkozzon fel most és részesüljön kedvezőbb árainkból!
Feliratkozom
28 124 Ft
Beszerezhetőség
Becsült beszerzési idő: A Prosperónál jelenleg nincsen raktáron, de a kiadónál igen. Beszerzés kb. 3-5 hét..
A Prosperónál jelenleg nincsen raktáron.
Why don't you give exact delivery time?
A beszerzés időigényét az eddigi tapasztalatokra alapozva adjuk meg. Azért becsült, mert a terméket külföldről hozzuk be, így a kiadó kiszolgálásának pillanatnyi gyorsaságától is függ. A megadottnál gyorsabb és lassabb szállítás is elképzelhető, de mindent megteszünk, hogy Ön a lehető leghamarabb jusson hozzá a termékhez.
A termék adatai:
- Kiadás sorszáma 3
- Kiadó Chapman and Hall
- Megjelenés dátuma 2024. augusztus 26.
- ISBN 9781032223506
- Kötéstípus Puhakötés
- Terjedelem528 oldal
- Méret 234x156 mm
- Súly 453 g
- Nyelv angol
- Illusztrációk 101 Illustrations, black & white; 101 Line drawings, black & white 708
Kategóriák
Rövid leírás:
The new edition of this award-winning, graduate textbook is upated throughout. Including mostly enumerative combinatorics,yet there are algebraic, analytic, and topological parts as well, and many applications. The author continues to reveal the usefulness of the subject for both students and researchers.
TöbbHosszú leírás:
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.
TöbbTartalomjegyzék:
Foreward
Preface to the First Edition
Preface to the Second Edition
Preface to the Third Edition
Acknowledgements
Introduction: No Way around It.
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
Do Not Look Just Yet: Solutions to Odd-Numbered Exercises
References
List of Frequently Used Notation
Index
