Algebraic approximations to linear combinations of powers: an extension of results by Mahler and Corvaja-Zannier (1511.08525v1)
Abstract: For every complex number $x$, let $\Vert x\Vert_{\mathbb{Z}}:=\min{|x-m|:\ m\in\mathbb{Z}}$. Let $K$ be a number field, let $k\in\mathbb{N}$, and let $\alpha_1,\ldots,\alpha_k$ be non-zero algebraic numbers. In this paper, we completely solve the problem of the existence of $\theta\in (0,1)$ such that there are infinitely many tuples $(n,q_1,\ldots,q_k)$ satisfying $\Vert q_1\alpha_1n+\ldots+q_k\alpha_kn\Vert_{\mathbb{Z}}<\thetan$ where $n\in\mathbb{N}$ and $q_1,\ldots,q_k\in K*$ having small logarithmic height compared to $n$. In the special case when $q_1,\ldots,q_k$ have the form $q_i=qc_i$ for fixed $c_1,\ldots,c_k$, our work yields results on algebraic approximations of $c_1\alpha_1n+\ldots+c_k\alpha_kn$ of the form $\displaystyle \frac{m}{q}$ with $m\in \mathbb{Z}$ and $q\in K*$ (where $q$ has small logarithmic height compared to $n$). Various results on linear recurrence sequences also follow as an immediate consequence. The case $k=1$ and $q_1$ is essentially a rational integer was obtained by Corvaja and Zannier and settled a long-standing question of Mahler. The use of the Subspace Theorem based on work of Corvaja-Zannier together with several modifications play an important role in the proof of our results.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.