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.
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vos droits au titre de la garantie légale : Chaque consommateur de l'UE bénéficie d'au moins deux ans de protection au titre de la garantie légale pour tout bien de consommation vendu dans l'UE. Voir plus
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur a3a93561b962714b5299f5f1596e351a
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur GB-9783030670825
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 44146531-n
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur GB-9783030670825
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 44146531-n
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 44146531
Quantité disponible : 15 disponible(s)
Vendeur : Speedyhen, Hertfordshire, Royaume-Uni
Etat : NEW. N° de réf. du vendeur NW9783030670825
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 44146531
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9783030670825_new
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)