This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains.
After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions.
Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Stephen Melczer is an Assistant Professor in the Department of Combinatorics and Optimization at the University of Waterloo. Prior to joining Waterloo, he was a CRM-ISM postdoctoral fellow at the Université du Québec à Montréal, a postdoctoral fellow at the University of Pennsylvania, and a visiting scholar at the University of Illinois Urbana-Champaign. His research adapts methods from algebraic and differential geometry, analysis, and topology to create effective tools for combinatorics, mathematics, and computer science. He received doctorates from the École normale supérieure de Lyon and the University of Waterloo in 2017, and is a recipient of a Governor General Silver Academic Medal.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783030670825_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020026127
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book uses new mathematical tools to examine broad computability and complexity questions inenumerative combinatorics, with applications to other areas of mathematics, theoretical computer science,and physics. A focus on effective algorithms leads to the development of computer algebra software of use toresearchers in these domains.After a survey of current results and open problems on decidability in enumerative combinatorics, the textshows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables(ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory,applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, throughexamples and general theory, how results from stratified Morse theorycan help refine some of thesecomputability questions.Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text. 440 pp. Englisch. N° de réf. du vendeur 9783030670825
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics.This book uses new mathematical too. N° de réf. du vendeur 541924719
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. 1st ed. 2021 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26395062694
Quantité disponible : 4 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Taschenbuch. Etat : Neu. An Invitation to Analytic Combinatorics | From One to Several Variables | Stephen Melczer | Taschenbuch | xviii | Englisch | 2021 | Springer | EAN 9783030670825 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. N° de réf. du vendeur 120842084
Quantité disponible : 5 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 402363001
Quantité disponible : 4 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. Neuware -This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains.After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theorycan help refine some of these computability questions.Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 440 pp. Englisch. N° de réf. du vendeur 9783030670825
Quantité disponible : 2 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18395062700
Quantité disponible : 4 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book uses new mathematical tools to examine broad computability and complexity questions inenumerative combinatorics, with applications to other areas of mathematics, theoretical computer science,and physics. A focus on effective algorithms leads to the development of computer algebra software of use toresearchers in these domains.After a survey of current results and open problems on decidability in enumerative combinatorics, the textshows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables(ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory,applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, throughexamples and general theory, how results from stratified Morse theorycan help refine some of thesecomputability questions.Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text. N° de réf. du vendeur 9783030670825
Quantité disponible : 1 disponible(s)