Search arXivSearch

arXiv · 2408.01401

Complex moments of class numbers with fundamental unit restrictions

Abstract

We explore the distribution of class numbers $h(d)$ of indefinite binary quadratic forms, for discriminants $d$ such that the corresponding fundamental unit $\varepsilon_d$ is lower than $d^{1/2+α}$, where $0<α<1/2$. To do so we find an asymptotic formula for $z^{th}$-moments of such $h(d)$'s, over $d\leq x$, uniformly for a complex number $z$ in a range of the form $|z|\leq(\log x)^{1+o(1)}$, $\Re(z)\geq -1$. This is achieved by constructing a probabilistic random model for these values, which we will use to obtain estimates for the distribution function of $h(d)$ over our family. As another application, we give an asymptotic formula for the number of $d$'s such that $h(d)\leq H$ and $\varepsilon_d\leq d^{1/2+α}$ where $H$ is a large real number.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jérémy Dousselin. 2024-08-02. Complex moments of class numbers with fundamental unit restrictions. https://arxiv.org/abs/2408.01401

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