Pemantle / Wilson / Melczer | Analytic Combinatorics in Several Variables | Buch | 978-1-108-83662-3 | sack.de

Buch, Englisch, Band 212, 592 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 1100 g

Reihe: Cambridge Studies in Advanced Mathematics

Pemantle / Wilson / Melczer

Analytic Combinatorics in Several Variables


2. Auflage 2024
ISBN: 978-1-108-83662-3
Verlag: Cambridge University Press

Buch, Englisch, Band 212, 592 Seiten, Format (B × H): 157 mm x 235 mm, Gewicht: 1100 g

Reihe: Cambridge Studies in Advanced Mathematics

ISBN: 978-1-108-83662-3
Verlag: Cambridge University Press


Discrete structures model a vast array of objects ranging from DNA sequences to internet networks. The theory of generating functions provides an algebraic framework for discrete structures to be enumerated using mathematical tools. This book is the result of 25 years of work developing analytic machinery to recover asymptotics of multivariate sequences from their generating functions, using multivariate methods that rely on a combination of analytic, algebraic, and topological tools. The resulting theory of analytic combinatorics in several variables is put to use in diverse applications from mathematics, combinatorics, computer science, and the natural sciences. This new edition is even more accessible to graduate students, with many more exercises, computational examples with Sage worksheets to illustrate the main results, updated background material, additional illustrations, and a new chapter providing a conceptual overview.

Pemantle / Wilson / Melczer Analytic Combinatorics in Several Variables jetzt bestellen!

Weitere Infos & Material


Part I. Combinatorial Enumeration: 1. Introduction; 2. Generating functions; 3. Univariate asymptotics; Part II. Mathematical Background: 4. Fourier–Laplace integrals in one variable; 5. Multivariate Fourier–Laplace integrals; 6. Laurent series, amoebas, and convex geometry; Part III. Multivariate Enumeration: 7. Overview of analytic methods for multivariate generating functions; 8. Effective computations and ACSV; 9. Smooth point asymptotics; 10. Multiple point asymptotics; 11. Cone point asymptotics; 12. Combinatorial applications; 13. Challenges and extensions; Appendices: A. Integration on manifolds; B. Algebraic topology; C. Residue forms and classical Morse theory; D. Stratification and stratified Morse theory; References; Author index; Subject index.


Wilson, Mark C.
Mark C. Wilson is Senior Teaching Faculty at the College of Information and Computer Sciences at the University of Massachusetts, Amherst. He received his Ph.D. in mathematics from the University of Wisconsin–Madison. He is Editor-in-Chief of 'Notices of the American Mathematical Society' and life member of the Combinatorial Mathematics Society of Australasia.

Pemantle, Robin
Robin Pemantle is Merriam Term Professor of Mathematics at the University of Pennsylvania, working in the fields of probability theory and combinatorics. He received his bachelor's degree from Berkeley and his Ph.D. from MIT. He is a Fellow of the AMS and IMS and a winner of the Rollo Davidson Prize.

Melczer, Stephen
Stephen Melczer is Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo. He received doctorates from the École normale supérieure de Lyon and the University of Waterloo. He is a recipient of a Governor General Silver Academic Medal and previously published the textbook 'An Invitation to Analytic Combinatorics.'



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.