Search arXivSearch

arXiv · 2606.08865

The Dirichlet spectrum with respect to $L_1$ norm is $\left[\frac12,1\right]$

Abstract

We prove that the one-dimensional Dirichlet spectrum with respect to approximation in $L_1$ norm $\mathbb{D}^{[1]}$ satisfies $$ \mathbb{D}^{[1]}=\left[\frac12,1\right]. $$ This is equivalent to the fact that the Minkowski spectrum $\mathbb M$, associated with the Minkowski diagonal continued fraction, satisfies $$ \mathbb M=\left[\frac14,\frac12\right]. $$ Further, we show that level sets $$ Θ_m=\{α\in(0,1)\setminus\mathbb Q:\mathfrak m(α)=m\}, $$ where $\mathfrak{m}(α)$ is the Minkowski constant of $α$, have Hausdorff dimension strictly greater than $1/2$ for any $m\in(1/4,1/2]$, while $\dim_H Θ_{1/4}=\frac{1}{2}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nikita Shulga. 2026-06-07. The Dirichlet spectrum with respect to $L_1$ norm is $\left[\frac12,1\right]$. https://arxiv.org/abs/2606.08865

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