Add to ORKGWe study the growth behaviour of rational linear recurrence sequences. We show that for loworder sequences, divergence is decidable in polynomial time. We also exhibit a polynomial-time algorithm which takes as input a divergent rational linear recurrence sequence and computes effective fine-grained lower bounds on the growth rate of the sequence
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely th...
Abstract. We describe an algorithm that takes as input a complex sequence (un) given by a linear rec...
We study the growth behaviour of rational linear recurrence sequences. We show that for loworder seq...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
In this thesis we study three topics within the broad fi eld of nonlinear recurrences. First we will...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because...
This paper provides a survey of the dissertation of the first named author [6]. The thesis deals wit...
25 pagesInternational audienceWe describe an algorithm that takes as input a complex sequence $(u_n)...
AbstractThis is an expository account of a constructive theorem on the shortest linear recurrences o...
AbstractWe give algorithms to compute the asymptotic expansion of solutions of linear recurrences wi...
AbstractWe derive an upper bound for the minimal length of a linear recurrence satisfied by a sequen...
AbstractWe describe an algorithm that takes as input a complex sequence (un) given by a linear recur...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely th...
Abstract. We describe an algorithm that takes as input a complex sequence (un) given by a linear rec...
We study the growth behaviour of rational linear recurrence sequences. We show that for loworder seq...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
In this thesis we study three topics within the broad fi eld of nonlinear recurrences. First we will...
Recurrence sequences are of great intrinsic interest and have been a central part of number theory f...
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because...
This paper provides a survey of the dissertation of the first named author [6]. The thesis deals wit...
25 pagesInternational audienceWe describe an algorithm that takes as input a complex sequence $(u_n)...
AbstractThis is an expository account of a constructive theorem on the shortest linear recurrences o...
AbstractWe give algorithms to compute the asymptotic expansion of solutions of linear recurrences wi...
AbstractWe derive an upper bound for the minimal length of a linear recurrence satisfied by a sequen...
AbstractWe describe an algorithm that takes as input a complex sequence (un) given by a linear recur...
In the following chapter we address the techniques for the resolution of some celebrated recurrence ...
AbstractWe relate sequences generated by recurrences with polynomial coefficients to interleaving an...
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely th...
Abstract. We describe an algorithm that takes as input a complex sequence (un) given by a linear rec...