Search arXivSearch

arXiv · 2511.07954

Discriminants and Large Pólya Groups in Septic Number Fields

Abstract

We investigate a new family of cyclic septic fields $\{K_t\}_{t\in\mathbb{Z}}$ arising from the Hashimoto--Hoshi construction. For this family, we compute the discriminant explicitly and characterize their Pólya property under the condition that the polynomial $E(t) = t^{6} + 2t^{5} + 11t^{4} + t^{3} + 16t^{2} + 4t + 8$ takes fifth-power free values. We show that this family contains infinitely many non-Pólya fields for which the cardinality of the Pólya group is unbounded. We also establish that, assuming Bunyakovsky's conjecture for $E(t)$, this family contains infinitely many Pólya fields. We further show that, for any fixed positive integer $m$, there exist infinitely many blocks of $m$ consecutive fields in this family whose cardinality of the Pólya groups can be made arbitrarily large. Finally, we demonstrate that infinitely many fields in this family are non-monogenic with field index one.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nimish Kumar Mahapatra. 2026-02-02. Discriminants and Large Pólya Groups in Septic Number Fields. https://arxiv.org/abs/2511.07954

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