| Description |
1 online resource (426 pages) |
| Series |
Texts & monographs in symbolic computation |
|
Texts and monographs in symbolic computation.
|
| Contents |
Introduction -- Background and Motivation -- Smooth ACSV and Applications -- Non-Smooth ACSV |
| Summary |
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 |
| Bibliography |
Includes bibliographical references |
| Notes |
Print version record |
| Subject |
Combinatorial analysis.
|
|
Computable functions.
|
|
Computable functions
|
|
Combinatorial analysis
|
|
Algorithms
|
|
Computer science -- Mathematics
|
|
Discrete mathematics
|
|
Physics
|
| Form |
Electronic book
|
| ISBN |
9783030670801 |
|
3030670805 |
|
