A SageMath Package for Analytic Combinatorics in Several Variables: Beyond the Smooth Case
By: Benjamin Hackl , Andrew Luo , Stephen Melczer and more
Potential Business Impact:
Computers now solve harder math problems about patterns.
The field of analytic combinatorics in several variables (ACSV) develops techniques to compute the asymptotic behaviour of multivariate sequences from analytic properties of their generating functions. When the generating function under consideration is rational, its set of singularities forms an algebraic variety -- called the singular variety -- and asymptotic behaviour depends heavily on the geometry of the singular variety. By combining a recent algorithm for the Whitney stratification of algebraic varieties with methods from ACSV, we present the first software that rigorously computes asymptotics of sequences whose generating functions have non-smooth singular varieties (under other assumptions on local geometry). Our work is built on the existing sage_acsv package for the SageMath computer algebra system, which previously gave asymptotics under a smoothness assumption. We also report on other improvements to the package, such as an efficient technique for determining higher order asymptotic expansions using Newton iteration, the ability to use more efficient backends for algebraic computations, and a method to compute so-called critical points for any multivariate rational function through Whitney stratification.
Similar Papers
Effective Asymptotics of Combinatorial Systems
Combinatorics
Computers can now figure out how many ways things can be arranged.
Kolmogorov equations for stochastic Volterra processes with singular kernels
Probability
Helps predict stock prices using math.
Towards understanding Accelerated Stein Variational Gradient Flow -- Analysis of Generalized Bilinear Kernels for Gaussian target distributions
Optimization and Control
Makes computer learning faster and better.