Perfect powers in polynomial power sums
Clemens Fuchs, Sebastian Heintze

TL;DR
This paper proves that non-degenerate simple polynomial linear recurrence sequences of order at least two cannot contain arbitrarily large powers of polynomials, and in the binary case, only finitely many sequence elements are perfect powers.
Contribution
It establishes bounds on the exponents and indices of polynomial powers within such recurrence sequences, extending understanding of polynomial perfect powers in these sequences.
Findings
No large polynomial powers appear in sequences of order ≥ 2.
In binary sequences, only finitely many elements are perfect powers.
The bounds depend solely on the sequence's parameters.
Abstract
We prove that a non-degenerate simple linear recurrence sequence of polynomials satisfying some further conditions cannot contain arbitrary large powers of polynomials if the order of the sequence is at least two. In other words we will show that for large enough there is no polynomial of degree such that is an element of . The bound for depends here only on the sequence . In the binary case we prove even more. We show that then there is a bound on the index of the sequence such that only elements with index can be a proper power.
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.
