Computing error bounds for asymptotic expansions of regular P-recursive sequences

12/22/2022
by   Ruiwen Dong, et al.
0

Over the last several decades, improvements in the fields of analytic combinatorics and computer algebra have made determining the asymptotic behaviour of sequences satisfying linear recurrence relations with polynomial coefficients largely a matter of routine, under assumptions that hold often in practice. The algorithms involved typically take a sequence, encoded by a recurrence relation and initial terms, and return the leading terms in an asymptotic expansion up to a big-O error term. Less studied, however, are effective techniques giving an explicit bound on asymptotic error terms. Among other things, such explicit bounds typically allow the user to automatically prove sequence positivity (an active area of enumerative and algebraic combinatorics) by exhibiting an index when positive leading asymptotic behaviour dominates any error terms. In this article, we present a practical algorithm for computing such asymptotic approximations with rigorous error bounds, under the assumption that the generating series of the sequence is a solution of a differential equation with regular (Fuchsian) dominant singularities. Our algorithm approximately follows the singularity analysis method of Flajolet and Odlyzko, except that all big-O terms involved in the derivation of the asymptotic expansion are replaced by explicit error terms. The computation of the error terms combines analytic bounds from the literature with effective techniques from rigorous numerics and computer algebra. We implement our algorithm in the SageMath computer algebra system and exhibit its use on a variety of applications (including our original motivating example, solution uniqueness in the Canham model for the shape of genus one biomembranes).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/16/2020

Sequence Positivity Through Numeric Analytic Continuation: Uniqueness of the Canham Model for Biomembranes

We prove solution uniqueness for the genus one Canham variational proble...
research
09/16/2022

Error bounds for the asymptotic expansion of the partition function

Asymptotic study on the partition function p(n) began with the work of H...
research
07/07/2016

Rigorous Multiple-Precision Evaluation of D-Finite Functions in SageMath

We present a new open source implementation in the SageMath computer alg...
research
11/16/2021

Complete topological asymptotic expansion for L_2 and H^1 tracking-type cost functionals in dimension two and three

In this paper, we study the topological asymptotic expansion of a topolo...
research
09/15/2017

Analytic Combinatorics in Several Variables: Effective Asymptotics and Lattice Path Enumeration

The field of analytic combinatorics, which studies the asymptotic behavi...
research
10/24/2017

Explicit error bounds for lattice Edgeworth expansions

Motivated, roughly, by comparing the mean and median of an IID sum of bo...
research
07/02/2022

Asymptotics of multivariate sequences IV: generating functions with poles on a hyperplane arrangement

Let F be the quotient of an analytic function with a product of linear f...

Please sign up or login with your details

Forgot password? Click here to reset