Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.09206

Bounded Ratios of Best Approximations: Sharp Bounds and Spectra of Diophantine Exponents

Maksim Lavrov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We solve Problems 1, 2, and 3 posed by Marnat, Moshchevitin, and Schleischitz (arXiv:2505.15964). We consider totally irrational real n-by-m matrices and two conditions on their sequences of best approximations: (B) bounded successive height ratios and (C) bounded successive error ratios. Under (C), we prove that the ordinary Diophantine exponent is at most m and, when both dimensions are at least two, that the uniform exponent is at most m^2/(m+1). Combining these bounds with known results, we determine the individual spectra of both exponents under (C), with and without the additional assumption (B). When both dimensions are at least two, imposing (B) changes neither spectrum. A key ingredient is a block lemma for consecutive best approximations lying in a fixed rational subspace.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maksim Lavrov. 2026-11-06. Bounded Ratios of Best Approximations: Sharp Bounds and Spectra of Diophantine Exponents. https://arxiv.org/abs/2611.09206

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Qin's Algorithm, Continued Fractions and 2-dimensional Lattices

In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix. In this paper, we investigate the mathematical structure of these states and their connections with continued fractions and two-dimensional lattices. By introducing a signed version of the state, we obtain a natural matrix representation that reveals the convergents of continued fractions and gives direct derivations of several classical results. We then show that the signed states form bases of a family of two-dimensional lattices arising from modular congruences. In particular, we prove that a shortest lattice vector can be obtained from the rows of a signed state or their sum or difference. We also study the monotonicity of the inner products of the state vectors and discuss a subsequent result that locates a shortest vector in one of two consecutive states. It is surprising that a shortest lattice vector is found in a highly structure sequence of states. These results demonstrate that the state structure of Qin's algorithm provides a unified framework for understanding modular inversion, continued fractions, and shortest vectors in two-dimensional lattices.

math.NT↗
arXiv2026

The symmetrized sum of finite $q$-multiple harmonic sums with one exceptional index

In this paper, we give explicit expressions for $q$-harmonic sums on $1-\cdots-1,A,1-\cdots-1$ indices. The case $A=1$ has been extensively studied, and a variety of identities, explicit evaluations, and structural properties are known. Likewise, numerous explicit evaluations are available for $q$-multiple zeta values and $q$-harmonic sums with uniform indices $A-\cdots-A$. Although several methods are available for treating non-uniform indices, explicit evaluations for the pattern $1-\cdots-1,A,1-\cdots-1$ remain comparatively scarce. The case $A=2$ was settled only recently. In this paper, we extend this framework to the general case $A\ge3$ as the total sum with the theory of the elementary symmetric functions, though we do not generally evaluate each summand at a prescribed position of $A$. We obtain explicit formulas in terms of binomial coefficients and degenerate Bernoulli numbers. Some expressions about $2-\cdots-2,A,2-\cdots-2$ are also shown.

math.NT↗