Algebraic approximations to linear combinations of powers: an extension of results by Mahler and Corvaja-Zannier
Avinash Kulkarni, Niki Myrto Mavraki, Khoa D. Nguyen

TL;DR
This paper characterizes when algebraic linear combinations of powers can be approximated exponentially well by integers, extending classical results and employing the Subspace Theorem to solve longstanding problems in number theory.
Contribution
It provides a complete characterization of the existence of exponential approximations for algebraic linear combinations of powers, extending prior work by Mahler and Corvaja-Zannier.
Findings
Characterization of exponential approximation conditions
Extension of Mahler and Corvaja-Zannier results
Applications to linear recurrence sequences
Abstract
For every complex number , let . Let be a number field, let , and let be non-zero algebraic numbers. In this paper, we completely solve the problem of the existence of such that there are infinitely many tuples satisfying where and having small logarithmic height compared to . In the special case when have the form for fixed , our work yields results on algebraic approximations of of the form with and (where has small logarithmic height compared to ). Various results on linear recurrence…
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.
