On a variant of Pillai's problem II
Kwok Chi Chim, Istv\'an Pink, Volker Ziegler

TL;DR
This paper proves that for certain linear recurrence sequences, only finitely many constants c allow the equation U_n - V_m = c to have multiple solutions, extending understanding of recurrence differences.
Contribution
It establishes finiteness results for the number of constants c with multiple solutions in the difference of two linear recurrence sequences.
Findings
Finitely many c have multiple solutions for U_n - V_m = c
Results extend previous work on recurrence difference equations
Provides new bounds and conditions for solution finiteness
Abstract
In this paper, we show that there are only finitely many such that the equation has at least two distinct solutions , where and are given linear recurrence sequences.
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
Topicssemigroups and automata theory · Coding theory and cryptography · graph theory and CDMA systems
