Search arXivSearch

arXiv · 2503.15727

Greenberg's conjecture and Iwasawa module of Real biquadratic fields I

Abstract

The main aim of this paper is to investigate Greenberg's conjecture for real biquadratic fields. More precisely, we propose the following problem: What are real biquadratic number fields $k$ such that ${\rm rank}(A(k_\infty)) = {\rm rank}(A(k_1))$?, where $A(k_\infty)$ is the $2$-Iwasawa module of $k$ and $A(k_1)$ is the $2$-class group of $k_1$ the first layer of the cyclotomic $\mathbb Z_2$-extension of $k$. Moreover, we give several families of real biquadratic fields $k$ such that $A(k_\infty)$ is trivial or isomorphic to $\mathbb Z/2^{n} \mathbb Z$ or $\mathbb Z/2\mathbb Z \times\mathbb Z/2^n \mathbb Z$, where $n$ is a given positive integer. The reader can also find some results concerning the $2$-rank of the class group of certain real triquadratic fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohamed Mahmoud Chems-Eddin. 2025-10-14. Greenberg's conjecture and Iwasawa module of Real biquadratic fields I. https://doi.org/10.1016/j.jnt.2025.09.015

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