Multiplicative dependence in linear recurrence sequences
Attila B\'erczes, Lajos Hajdu, Alina Ostafe, Igor E. Shparlinski

TL;DR
This paper establishes an upper bound on the number of s-tuples within certain ranges for which elements of a broad class of integer linear recurrence sequences are multiplicatively dependent.
Contribution
It provides a new upper bound on the frequency of multiplicative dependence among elements of linear recurrence sequences within specified intervals.
Findings
Derived an explicit upper bound for multiplicative dependence in recurrence sequences.
Applicable to a wide class of integer linear recurrence sequences.
Enhances understanding of multiplicative relations in recurrence sequences.
Abstract
For a wide class of integer linear recurrence sequences , we give an upper bound on the number of -tuples such that the corresponding elements in the sequence are multiplicatively dependent.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Algorithms and Data Compression · Embedded Systems Design Techniques
