Search arXivSearch

arXiv · 2508.07894

Some bi-quadratic Pólya fields and large Pólya groups of compositum of simplest cubic and quintic fields

Abstract

The Pólya group $Po(K)$ of an algebraic number field $K$ is the subgroup of the ideal class group $Cl_{K}$ generated by the ideal classes of the products of prime ideals of the same norm. If $Po(K)$ is trivial, then the number field $K$ is said to be a Pólya field. In this article, we furnish three families $\mathbb{Q}(\sqrt{p},\sqrt{qrs})$, $\mathbb{Q}(\sqrt{2p},\sqrt{qrs})$ and $\mathbb{Q}(\sqrt{2p},\sqrt{2qrs})$ of bi-quadratic Pólya fields $K$ involving prime numbers $p,q,r$ and $s$ that satisfy certain quadratic residue conditions. It is worthwhile to note that in each of the fields, exactly five primes ramify in $K/\mathbb{Q}$ and this is the maximum possible number of ramified primes in a Pólya field over $\mathbb{Q}$. Towards the end of the paper, we discuss about large Pólya groups of the compositums of Shank's cubic fields and Lehmer's quintic fields and prove that there are infinitely many such fields with index $1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Md. Imdadul Islam, Debopam Chakraborty, Jaitra Chattopadhyay. 2025-08-11. Some bi-quadratic Pólya fields and large Pólya groups of compositum of simplest cubic and quintic fields. https://arxiv.org/abs/2508.07894

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