Add to ORKGAbstract Here, we give upper and lower bounds on the count of positive integers n ≤ x dividing the nth term of a nondegenerate linearly recurrent sequence with simple roots
AbstractWe investigate when the sequence of binomial coefficients (ki) modulo a prime p, for a fixed...
We investigate when the sequence of binomial coefficients binom(k,i) modulo a prime p, for a fixed p...
AbstractWe obtain an upper bound on exponential sums of a new type with linear recurrence sequences....
We give upper and lower bounds on the count of positive integers n <= x dividing the nth term of a n...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
AbstractWe derive an upper bound for the minimal length of a linear recurrence satisfied by a sequen...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
AbstractWe prove that there are only finitely many terms of a non-degenerate linear recurrence seque...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
We prove that there are only finitely many terms of a non-degenerate linear recurrence sequence whic...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
this paper is to characterize linear binary recursive sequences which possess the similar property a...
We obtain an upper bound on exponential sums of a new type with linear recurrence sequences. We appl...
summary:The paper demonstrates a way how to find a formula for the nth term of a sequence that is gi...
15 pages. Version longue, 34 pages : https://specfun.inria.fr/bostan/BoMo20.pdfInternational audienc...
AbstractWe investigate when the sequence of binomial coefficients (ki) modulo a prime p, for a fixed...
We investigate when the sequence of binomial coefficients binom(k,i) modulo a prime p, for a fixed p...
AbstractWe obtain an upper bound on exponential sums of a new type with linear recurrence sequences....
We give upper and lower bounds on the count of positive integers n <= x dividing the nth term of a n...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
AbstractWe derive an upper bound for the minimal length of a linear recurrence satisfied by a sequen...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
AbstractWe prove that there are only finitely many terms of a non-degenerate linear recurrence seque...
International audienceWe improve by one exponential W. M. Schmidt's estimate for the Skolem-Mahler-L...
We prove that there are only finitely many terms of a non-degenerate linear recurrence sequence whic...
Let Gn be a k-th (k ≥ 2) order linear recurrence sequence of integers defined by initial terms G0,.....
this paper is to characterize linear binary recursive sequences which possess the similar property a...
We obtain an upper bound on exponential sums of a new type with linear recurrence sequences. We appl...
summary:The paper demonstrates a way how to find a formula for the nth term of a sequence that is gi...
15 pages. Version longue, 34 pages : https://specfun.inria.fr/bostan/BoMo20.pdfInternational audienc...
AbstractWe investigate when the sequence of binomial coefficients (ki) modulo a prime p, for a fixed...
We investigate when the sequence of binomial coefficients binom(k,i) modulo a prime p, for a fixed p...
AbstractWe obtain an upper bound on exponential sums of a new type with linear recurrence sequences....