Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Algorithm and symbolic combinatorics: an invitation to analytic combinatorics in several variables
Melczer S., Springer International Publishing, New York, NY, 2021. 436 pp. Type: Book (978-3-030670-79-5)
Date Reviewed: Aug 17 2022

Analytic combinatorics is a powerful branch of modern mathematics with several applications to physics and computer science, not to speak of mathematics itself. Melczer has done a good job of mathematically encompassing the issues related to computation and complexity in this domain, adopting an algorithmic approach to explain the underlying computer algebra and its associated software.

After a helpful literature review of open problems on the topic, the author addresses analytic combinatorics in several variables (ACSV), both for smooth and non-smooth points. I found the theory and applications to be quite lucidly explained, with helpful worksheets for the SageMath and Maple computer algebra systems.

The book has three parts and an introductory chapter 1. Part 1, “Background and Information” (chapters 2 to 4) covers generating functions and analytic combinatorics, multivariate series and diagonals, and lattice path enumeration. Part 2, “Smooth ACSV and Aapplications” (again, three chapters) looks at the theory of ACSV for smooth points, lattice walks, and automated analytic combinatorics. Finally, Part 3, “Non-Smooth ACSV” (chapters 8 to 10) discusses topics such as poles on a hyperplane arrangement, multiple points, and lattice paths.

The target readership includes graduate and advanced undergraduate students of mathematics and computer science, as well as researchers of these and allied areas. Given that Pemantle and Wilson’s textbook Analytic combinatorics in several variables [1] is meant more for researchers, Melczer’s, in contrast, serves more pedagogical interests and is therefore a welcome addition to the literature. The prerequisite for understanding this useful book is sound knowledge of advanced calculus and mathematical analysis (including analysis of sequences and series).

Reviewer:  Soubhik Chakraborty Review #: CR147488
1) Pemantle, R.; Wilson, M. C. Analytic combinatorics in several variables. Cambridge University Press, Cambridge, UK, 2013.
Bookmark and Share
  Featured Reviewer  
 
Combinatorial Algorithms (G.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Combinatorial Algorithms": Date
The complexity of combinatorial problems with succinct input representation
Wagner K. (ed) Acta Informatica 23(3): 325-356, 1986. Type: Article
Dec 1 1988
An optimal algorithm for parallel selection
Akl S. Information Processing Letters 19(1): 47-50, 1984. Type: Article
Nov 1 1985
A performance guarantee for the greedy set-partitioning algorithm
E G. J., Langston M. Acta Informatica 21(4): 409-415, 1984. Type: Article
May 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 2004 Reviews.com™
Terms of Use
| Privacy Policy