Asymptotic Analysis of Regular Sequences

• Published in: Algorithmica Vol. 82; no. 3; pp. 429 - 508
• Main Authors: Heuberger, Clemens, Krenn, Daniel
• Format: Journal Article
• Language: English
• Published: New York Springer US 2020; Springer Nature B.V
• Subjects: Algorithm Analysis and Problem Complexity; Algorithms; Asymptotic properties; Computer Science; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Dirichlet problem; Eigenvalues; Mathematical analysis; Mathematics of Computing; Matrix methods; Number theory; Periodic variations; Scaling factors; Special Issue on Analysis of Algorithms; Theory of Computation; Transducer; Regular sequence; Tauberian theorem; Pascal’s rhombus; 68Q45; Esthetic numbers; 68R05; Summatory function; 11A63; Mellin–Perron summation; 05A16
• ISSN: 0178-4617; 1432-0541
• DOI: 10.1007/s00453-019-00631-3

In this article,
q
-regular sequences in the sense of Allouche and Shallit are analysed asymptotically. It is shown that the summatory function of a regular sequence can asymptotically be decomposed as a finite sum of periodic fluctuations multiplied by a scaling factor. Each of these terms corresponds to an eigenvalue of the sum of matrices of a linear representation of the sequence; only the eigenvalues of absolute value larger than the joint spectral radius of the matrices contribute terms which grow faster than the error term. The paper has a particular focus on the Fourier coefficients of the periodic fluctuations: they are expressed as residues of the corresponding Dirichlet generating function. This makes it possible to compute them in an efficient way. The asymptotic analysis deals with Mellin–Perron summations and uses two arguments to overcome convergence issues, namely Hölder regularity of the fluctuations together with a pseudo-Tauberian argument. Apart from the very general result, three examples are discussed in more detail:
sequences defined as the sum of outputs written by a transducer when reading a
q
-ary expansion of the input;
the amount of esthetic numbers in the first 
N
natural numbers; and
the number of odd entries in the rows of Pascal’s rhombus.
For these examples, very precise asymptotic formulæ are presented. In the latter two examples, prior to this analysis only rough estimates were known.