An Invitation to Analytic Combinatorics:From One to Several Variables (Texts & Monographs in Symbolic Computation)
Publisher Finelybook 出版社：Springer; 1st ed. 2021 edition (December 23, 2020)
pages 页数：436 pages
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.
未经允许不得转载：finelybook » Algorithmic and Symbolic Combinatorics:An Invitation to Analytic Combinatorics in Several Variables
- Microsoft Power BI Cookbook: Gain expertise in Power BI with over 90 hands-on recipes, tips, and use cases, 2nd Edition
- React Cookbook: Recipes for Mastering the React Framework
- Pandas in Action
- Introduction to Machine Learning, 4th Edition
- Deep Learning: A Visual Approach
- Nature-Inspired Computing Paradigms in Systems