vix.ing · top · new · best · stats · spec

Algebraic approximations to linear combinations of S-units

2025/06/03 by P.S. Nair, Nair, Parvathi S, Veekesh Kumar +3 · 1 citation
Computer Science · #11J68 (Primary ) 11J87 #11R06 (Secondary) #FOS: Mathematics #Matrix Theory and Algorithms #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2506.02898

openalex publication_date 2025/06/03 · openalex created_date 2025/10/14 · openalex updated_date 2026/07/28

Abstract

Let Γ⊂ \Q× 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×ℤ2 with d = [ℚ(u1, …, um):ℚ] such that for any two tuples (u1,…,um) and (u'1,…,u'm), we have \fracui1ui2≠ \fracu'i1u'i2 for 1≤ i1≠ i2≤ m and it is stable under Galois conjugation over \Q, max\|α1 qu1|, …, |αm qum|\>1, the tuple (α1qu1, …, αmq um) is not pseudo-Pisot and 0lt; |∑i=1m αiq ui - p|lt;\frac1(∏i=1mH( ui))ε |q|md+ε, where H(ui) denotes the absolute Weil height. This result extends one of the main results of Corvaja-Zannier \citecorv. In addition, we prove a result similar to \cite[Theorem 1.4]kul in a more general setting. In our proofs, we exploit the subspace theorem based on the work of Corvaja-Zannier.

Citations

Cited by

Related