Algebraic approximations to linear combinations of S-units
Abstract
Let ⊂ × be a finitely generated multiplicative group of algebraic numbers, let α1,…,αm be non-zero algebraic numbers, and let >0 be fixed. In this paper, we prove that there exist only finitely many tuples (u1, …, um, q, p)∈ m×Z2 with d = [Q(u1, …, um):Q] such that for any two tuples (u1,…,um) and (u'1,…,u'm), we have ui1ui2≠ u'i1u'i2 for 1≤ i1≠ i2≤ m and it is stable under Galois conjugation over , \|α1 qu1|, …, |αm qum|\>1, the tuple (α1qu1, …, αmq um) is not pseudo-Pisot and \[0< |Σi=1m αiq ui - p|<1(Πi=1mH( ui)) |q|md+,\] where H(ui) denotes the absolute Weil height. This result extends one of the main results of Corvaja-Zannier corv. In addition, we prove a result similar to [Theorem 1.4]kul in a more general setting. In our proofs, we exploit the subspace theorem based on the work of Corvaja-Zannier.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.