Search arXivSearch

arXiv · 2608.22373

The normalized approximation function for multiple zeta-star values

Abstract

Motivated by the classical Lagrange spectrum and the reciprocal formulation of the Lagrange spectrum in continued-fraction theory, we introduce a normalized approximation function $\mathcal{N}(α)$ for approximation by multiple zeta-star values. At each depth, the approximation error is minimized over all admissible indices and normalized by the binary scale determined by their weights. The function $\mathcal{N}(α)$ is then obtained by taking the limit inferior as the depth tends to infinity. Using the order structure of multiple zeta-star values, we establish the regularity and generic behavior of this function. We prove that the depthwise approximation functions are upper semicontinuous, that $\mathcal{N}$ is Borel measurable, and that its zero set is a dense $G_δ$ subset of $(1,+\infty)$. We also derive a natural-prefix approximation estimate showing that a large next digit produces an exceptionally good normalized approximation. Combined with the author's metric resultson Diophantine approximation of multiple zeta-star values, this gives a full-measure theorem under a logarithmically reinforced divergence condition and, in particular, proves that $\mathcal{N}(α)=0$ for Lebesgue almost every $α>1$. Finally, we give some basic properties of the image of the normalized approximation function and show that the image $\mathrm{Im}(\mathcal{N})$ is dense on the extended half-line $[0,+\infty]$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiangtao Li. 2026-08-23. The normalized approximation function for multiple zeta-star values. https://arxiv.org/abs/2608.22373

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT