Search arXivSearch

arXiv · 1903.02922

Genus theory and $ε$-conjectures on p-class groups

Abstract

We suspect that the ``genus part'' of the class number of a number field K may be an obstruction for an ``easy proof'' of the classical p-rank epsilon-conjecture for p-class groups and, a fortiori, for a proof of the ``strong epsilon-conjecture'': \# (Cl\_K \otimes \Z\_p) <<\_(d,p,epsilon) ($\sqrt$D\_K)^epsilon for all K of degree d. We analyze the weight of genus theory in this inequality by means of an infinite family of degree p cyclic fields with many ramified primes, then we prove the p-rank epsilon-conjecture: \# (Cl\_K \otimes \F\_p) <<\_(d,p,epsilon) ($\sqrt$D\_K)^epsilon, for d=p and the family of degree p cyclic extensions (Theorem 2.5) then sketch the case of arbitrary base fields. The possible obstruction for the strong form, in the degree p cyclic case, is the order of magnitude of the set of ``exceptional'' p-classes given by a well-known non-predictible algorithm, but controled thanks to recent density results due to Koymans--Pagano. Then we compare the epsilon-conjectures with some p-adic conjectures, of Brauer- Siegel type, about the torsion group T\_K of the Galois group of the maximal abelian p-ramified pro-p-extension of totally real number fields K. We give numerical computations with the corresponding PARI/GP programs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Georges Gras. 2019-07-08. Genus theory and $ε$-conjectures on p-class groups. https://doi.org/10.1016/j.jnt.2019.07.008

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