Papers
Topics
Authors
Recent
Search
2000 character limit reached

Refinements of Peck's theorem on simultaneous approximation to algebraic numbers

Published 24 Sep 2026 in math.NT | (2609.29360v1)

Abstract: Let nn be an integer with n≥2n\ge2, and let EE be a real algebraic number field of degree n+1n+1 over Q{\mathbb Q}. Let α<em>1,…,αnα<em>1, \ldots , α_n be real numbers in EE such that (1,α1,…,αn)(1,α_1,\ldots,α_n) is a linear basis of EE over Q{\mathbb Q}. Let ν1,…,ν</em>n−1ν_1, \ldots, ν</em>{n-1} be real numbers satisfying $$0&lt;\max_{1\le i\le n-1}ν<em>i\le2\min</em>{1\le i\le n-1}ν<em>i,\quad ν_1+ \ldots +ν</em>{n-1}=1. $$ We establish that there exist a real number CC, depending only on α<em>1,…,αnα<em>1, \ldots , α_n, and infinitely many integers Q≥2Q \ge 2 satisfying the inequalities Q<sup>1/n∥</sup>Qαi∥≤C(log⁡Q)<sup>−νi,</sup>1≤i≤n−1,Q<sup>1/n∥</sup>Qαn∥≤C.Q<sup>{1/n}\Vert</sup> Qα_i\Vert \le C (\log Q)<sup>{-ν_i},</sup> \quad 1\le i\le n-1, \quad Q<sup>{1/n}\Vert</sup> Qα_n\Vert\le C. This answers partially a conjecture of Peck, who proved in 1961 this statement in the particular case where ν1=…=ν</em>n−1=1/(n−1)ν_1 = \ldots = ν</em>{n-1} = 1/ (n-1). We also improve a result from 2004 of de Mathan and Teulié on a question of simultaneous Diophantine approximation involving a non-Archimedean valuation.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.