Abstract

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; andthe 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.

Highlights

  • Sequences defined as the sum of outputs written by a transducer when reading a q-ary expansion of the input;

  • We study the asymptotic behaviour of the summatory function of a qregular sequence x(n)

  • For the reader who wants to overcome convergence problems with the Mellin– Perron summation formula in other contexts involving periodic fluctuations, we note that the pseudo-Tauberian argument (Proposition 14.1) is completely independent of our application to q-regular sequences; the only prerequisite is the knowledge on the existence of the fluctuation and sufficient knowledge on analyticity and growth of the Dirichlet generating function

Read more

Summary

Synopsis

We study the asymptotic behaviour of the summatory function of a qregular sequence x(n). At this point, we give a short overview of the notion of q-regular sequences and our main result. Regular sequences are intimately related to the q-ary expansion of their arguments. While (1.1) gives the shape of the asymptotic form, gathering as much information as possible on the periodic fluctuations k j is required to have a full picture To this aim, we will give a description of the Fourier coefficients of the k j which allows to compute them algorithmically and to describe these periodic fluctuations with high precision.

How to Read This Paper
User-Friendly Main Result and a First Example Application
Condensed Main Result
Asymptotics of Regular Sequences
Overview of the Results
Heuristic Approach
High Level Overview of the Proof
Relation to Previous Work
Overview of the Examples
Transducers
Esthetic Numbers
Dependence on Residue Classes
Symmetrically Arranged Eigenvalues
Pascal’s Rhombus
Further Examples
Full Results
Problem Statement
Definitions and Notations
Decomposition into Periodic Fluctuations
Dirichlet Series
Fourier Coefficients
Fluctuations of Symmetrically Arranged Eigenvalues
Remarks on the Definitions
Constants for Theorem B
Transducer and Automata
Sums of Output Labels
Some Perron–Frobenius Theory
Analysis of Output Sums of Transducers
Proof of Corollary F
A q-Linear Representation
Full Asymptotics
Eigenvectors
Proof of the Asymptotic Result
10 Pascal’s Rhombus
10.1 Recurrence Relations and 2-Regular Sequences
10.2 Full Asymptotics
10.3 Proof of the Asymptotic Result
10.4 Dirichlet Series and Meromorphic Continuation
10.5 Fourier Coefficients
11 Additional Notations
12 Decomposition into Periodic Fluctuations
12.1 Upper Bound for Eigenvalues of C
12.2 Explicit Expression for the Summatory Function
12.3 Proof of Theorem B
12.4 Proof of Theorem C
13 Meromorphic Continuation of the Dirichlet Series
14.1 Pseudo-Tauberian Theorem
14.2 Proof of Theorem E
15 Proof of Theorem A
Part IV: Computational Aspects
17 Strategy for Computing the Fourier Coefficients
18.1 Bounding the Error
18.2 Choices of Parameters
19 Non-vanishing Coefficients

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.