Search arXivSearch

arXiv · 2512.21427

Counting $C_2 \wr S_4$ fields with a power saving error term

Abstract

Let $N_d(G,X)$ denote the number of degree $d$ extensions of $\mathbb{Q}$ with Galois closure $G$ and $|Δ_K|\leq X$. Malle's conjecture predicts an asymptotic of the form $N_d(G,X)\sim CX^α(\log X)^β$. Previously, Klüners proved Malle's conjecture for $G=C_2 \wr S_4$. His proof gives a power savings of $O(X^{7/8})$. We improve Klüners' result by establishing a stronger power saving error term for the count of such fields. Specifically, we show $N_8(C_2\wr S_4,X)=CX+O(X^{3/4-1/30})$. Additionally, we obtain new bounds on $N_8(G,X)$ for the groups $S_4$, $C_2^3 \rtimes S_4$, $GL_2 (\mathbb{F}_3)$, and $Q_8\rtimes S_4$ as permutation subgroups of $S_8$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sambhabi Bose, Kevin J. McGown, Ishan Panpaliya, Natalie Welling, Laney Williams. 2025-12-24. Counting $C_2 \wr S_4$ fields with a power saving error term. https://arxiv.org/abs/2512.21427

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