Search arXivSearch

arXiv · 2507.14617

A Minkowski-type theorem on distances to cusps: the class number one case

Abstract

In the study of Euclidean lattices, the product of the successive minima is bounded from above and below by explicit quantities. This result is known as Minkowski's second theorem, and can be refined to include Hermite's constant in the upper bound, which measures how short a non-zero vector can be in a given lattice. A version of this result exists in the context of number fields, where lattices are replaced with rigid adelic spaces, and successive minima with the Roy--Thunder minima. In this paper, drawing on the analogy between rank $2$ Euclidean lattices and points in $\mathbb{H}$, we will see an analogy between $2$-dimensional rigid adelic spaces and points in $\mathbb{H}^n$, and use that to translate the Minkowski-type theorem on Roy--Thunder minima into a theorem on the distances to cusps in $\mathbb{H}^n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mathieu Dutour. 2025-07-19. A Minkowski-type theorem on distances to cusps: the class number one case. https://arxiv.org/abs/2507.14617

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