Search arXivSearch

arXiv · 2308.04099

On the $p$-divisibility of even $K$-groups of the ring of integers of a cyclotomic field

Abstract

Let $k$ be a given positive odd integer and $p$ an odd prime. In this paper, we shall give a sufficient condition when a prime $p$ divides the order of the groups $K_{2k}(\mathbb{Z}[ζ_m+ζ_m^{-1}])$ and $K_{2k}(\mathbb{Z}[ζ_m])$, where $ζ_m$ is a primitive $m$th root of unity. When $F$ is a $p$-extension contained in $\mathbb{Q}(ζ_l)$ for some prime $l$, we also establish a necessary and sufficient condition for the order of $K_{2(p-2)}(\mathcal{O}_F)$ to be divisible by $p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meng Fai Lim. 2025-08-05. On the $p$-divisibility of even $K$-groups of the ring of integers of a cyclotomic field. https://doi.org/10.1007/s11139-025-01177-5

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