Search arXivSearch

arXiv · 2504.12160

On the counting function of cubic function fields

Abstract

We study the counting function of cubic function fields. Specifically, we derive an asymptotic formula for this counting function including a secondary term and an error term of order $\mathcal{O}\big(X^{2/3+ε}\big)$, which matches the best-known result, due to Bhargava, Taniguchi and Thorne, over $\mathbb{Q}$. Furthermore, we obtain estimates for the refined counting function, where one specifies the splitting behaviour of finitely many primes. Also in this case, our error term matches what is known for number fields. However, in the function field setting, the secondary term becomes more difficult to write down explicitly. Our proof uses geometry of numbers methods, which are especially effective for function fields. In particular, we obtain an exact formula for the number of orbits of cubic forms with fixed absolute discriminant. Moreover, by studying the one-level density of a family of Artin $L$-functions associated to these cubic fields, we prove an unconditional lower bound on the error term in the estimate for the refined counting function. This generalises a conditional result over $\mathbb{Q}$, due to Cho, Fiorilli, Lee and Södergren.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Ahlquist. 2025-06-24. On the counting function of cubic function fields. https://arxiv.org/abs/2504.12160

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