"Natural extension of arithmetic algorithms and S-adic system". July 20~24, 2015. edited by Shigeki Akiyama. The papers presented in this volume of RIMS Kôkyûroku Bessatsu are in final form and refereed.The main part of this article is a survey of a complete characterization of linearly recurrent sequences in terms of S-adic sequences which is due to F. Durand (2000, 2003). However, we also discuss almost minimal sequences in connections with S-adic sequences
In this article we derive several consequences of a matricial characterization of P-recursive sequen...
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because...
AbstractThis paper studies properties of almost periodic sequences (also known as uniformly recursiv...
AbstractIn [S. Ferenczi, Rank and symbolic complexity, Ergodic Theory Dynam. Systems 16 (1996) 663–6...
AbstractArithmetical complexity of infinite sequences is the number of all words of a given length w...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
The space of linearly recursive sequences of complex numbers admits two distinguished topologies. N...
In this thesis, I develop a semi-algorithm consisting of an automaton, or rather, an ever-building f...
"Natural extension of arithmetic algorithms and S-adic system". July 20~24, 2015. edited by Shigeki ...
peer reviewedWe show that various aspects of k-automatic sequences such as having an unbordered fa...
"Natural extension of arithmetic algorithms and S-adic system". July 20~24, 2015. edited by Shigeki ...
Let a and b be positive real numbers. Assume that a/b is a rational number. Let v be a finite zero-s...
AbstractDavenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate re...
We study sequences of positive numbers satisfying a reverse Minkowski condition. In particular, we c...
15 pages. Version longue, 34 pages : https://specfun.inria.fr/bostan/BoMo20.pdfInternational audienc...
In this article we derive several consequences of a matricial characterization of P-recursive sequen...
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because...
AbstractThis paper studies properties of almost periodic sequences (also known as uniformly recursiv...
AbstractIn [S. Ferenczi, Rank and symbolic complexity, Ergodic Theory Dynam. Systems 16 (1996) 663–6...
AbstractArithmetical complexity of infinite sequences is the number of all words of a given length w...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
The space of linearly recursive sequences of complex numbers admits two distinguished topologies. N...
In this thesis, I develop a semi-algorithm consisting of an automaton, or rather, an ever-building f...
"Natural extension of arithmetic algorithms and S-adic system". July 20~24, 2015. edited by Shigeki ...
peer reviewedWe show that various aspects of k-automatic sequences such as having an unbordered fa...
"Natural extension of arithmetic algorithms and S-adic system". July 20~24, 2015. edited by Shigeki ...
Let a and b be positive real numbers. Assume that a/b is a rational number. Let v be a finite zero-s...
AbstractDavenport-Schinzel sequences DS(s) are finite sequences of some symbols with no immediate re...
We study sequences of positive numbers satisfying a reverse Minkowski condition. In particular, we c...
15 pages. Version longue, 34 pages : https://specfun.inria.fr/bostan/BoMo20.pdfInternational audienc...
In this article we derive several consequences of a matricial characterization of P-recursive sequen...
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because...
AbstractThis paper studies properties of almost periodic sequences (also known as uniformly recursiv...