International audienceAmong all sequences that satisfy a divide-and-conquer recurrence, those which are rational with respect to a numeration system are certainly the most basic and the most essential. Nevertheless, until recently this specific class of sequences has not been systematically studied from the asymptotic standpoint. We recall how a mechanical process designed by the author permits to compute their asymptotic expansions. The process is based on linear algebra, and involves computing Jordan normal forms, joint spectral radii, and solving dilation equations. The main contribution of the present article is the comparison between our algebraic method and the classical analytic number theory approach. Moreover, we develop new ways t...
We study higher-dimensional interlacing Fibonacci sequen\-ces, generated via both Chebyshev type fun...
The summatory function of a q-regular sequence in the sense of Allouche and Shallit is analysed asym...
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best in...
Abstract. The generating series of a radix-rational sequence is a rational formal power series from ...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
AbstractWe give algorithms to compute the asymptotic expansion of solutions of linear recurrences wi...
The purpose of this thesis is to study a class of power series, which we call Mahlerian, solutions t...
AbstractThe asymptotic behaviour of many univariate functions can only be expressed in generalized a...
AbstractWe derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min1⩽j...
We give an asymptotic expansion for the Taylor coe±cients of L(P(z)) where L(z) is analytic in the ...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
Fredman and Knuth have treated certain recurrences, such as $M(0) = 1$ and\[M(n + 1) = \mathop {\mi...
Analysis of AlgorithmsInternational audienceWe analyse the asymptotic behaviour in the mean of a non...
This thesis gives some asymptotic formulae associated with some non-negative multiplicative function...
The main subject of the present paper is to define the four algebraic operations - additions, subtra...
We study higher-dimensional interlacing Fibonacci sequen\-ces, generated via both Chebyshev type fun...
The summatory function of a q-regular sequence in the sense of Allouche and Shallit is analysed asym...
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best in...
Abstract. The generating series of a radix-rational sequence is a rational formal power series from ...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
AbstractWe give algorithms to compute the asymptotic expansion of solutions of linear recurrences wi...
The purpose of this thesis is to study a class of power series, which we call Mahlerian, solutions t...
AbstractThe asymptotic behaviour of many univariate functions can only be expressed in generalized a...
AbstractWe derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min1⩽j...
We give an asymptotic expansion for the Taylor coe±cients of L(P(z)) where L(z) is analytic in the ...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
Fredman and Knuth have treated certain recurrences, such as $M(0) = 1$ and\[M(n + 1) = \mathop {\mi...
Analysis of AlgorithmsInternational audienceWe analyse the asymptotic behaviour in the mean of a non...
This thesis gives some asymptotic formulae associated with some non-negative multiplicative function...
The main subject of the present paper is to define the four algebraic operations - additions, subtra...
We study higher-dimensional interlacing Fibonacci sequen\-ces, generated via both Chebyshev type fun...
The summatory function of a q-regular sequence in the sense of Allouche and Shallit is analysed asym...
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best in...