Multiplicative dependence in linear recurrence sequences

Abstract For a wide class of integer linear recurrence sequences $(u(n))_{n=1}^\infty $ , we give an upper bound on the number of s -tuples $\left (n_1, \ldots , n_s\right ) \in \left ({\mathbb Z}\cap [M+1,M+ N]\right )^s$ such that the corresponding elements $u(n_1), \ldots , u(n_s)$ in the sequence are multiplicatively dependent.

Authors

Institutions

Publication Details

Journal
Canadian Mathematical Bulletin
Published
2025-04-21
DOI
https://doi.org/10.4153/s0008439525000475
Citations
1
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
1.50

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multiplicative dependence in linear recurrence sequences

Alina Ostafe, Lajos Hajdu, Igor E. Shparlinski, Attila Bérczes
1 citations
Canadian Mathematical Bulletin
Computability, Logic, AI Algorithms
1.50
article

Multiplicative dependence in linear recurrence sequences

Alina Ostafe, Lajos Hajdu, Igor E. Shparlinski, Attila Bérczes
article en
1 citations

Abstract

Abstract For a wide class of integer linear recurrence sequences $(u(n))_{n=1}^\infty $ , we give an upper bound on the number of s -tuples $\left (n_1, \ldots , n_s\right ) \in \left ({\mathbb Z}\cap [M+1,M+ N]\right )^s$ such that the corresponding elements $u(n_1), \ldots , u(n_s)$ in the sequence are multiplicatively dependent.

Canadian Mathematical BulletinVol. 68(4)
University of Debrecen (HU), UNSW Sydney (AU), Institute of Mathematics and Informatics (BG), Czech Academy of Sciences, Institute of Mathematics (CZ)
Debreceni Egyetem, Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, Institut des Hautes Études Scientifiques, Université Paris-Saclay
Openalex Percentile: Top 18%
Computability, Logic, AI Algorithms
1.50
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.