Algorithmic complexity of Greenberg's conjecture - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Algorithmic complexity of Greenberg's conjecture

Résumé

Let k be a totally real number field. We show that the ``complexity'' of Greenberg's conjecture (lambda = mu = 0) is of p-adic nature and is governed by the torsion group T_k of the Galois group of the maximal abelian p-ramified pro-p-extension of k, by means of images, in T_k, of ideal norms along the layers k_n/k of the cyclotomic tower; these images are obtained via the algorithm computing, by ``unscrewing'', the p-class group of k_n (Theorem 5.2). Conjecture 5.4 of equidistribution of these images, finite in number, would show that Greenberg's conjecture, hopeless within the sole framework of Iwasawa's theory, holds true ``with probability 1''. No assumption is made on [k : Q], nor on the decomposition of p in k/Q.
Fichier principal
Vignette du fichier
New-Greenberg.complexity.pdf (330.36 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02541269 , version 1 (13-04-2020)
hal-02541269 , version 2 (13-05-2020)
hal-02541269 , version 3 (22-06-2020)
hal-02541269 , version 4 (15-01-2021)

Identifiants

Citer

Georges Gras. Algorithmic complexity of Greenberg's conjecture. 2020. ⟨hal-02541269v4⟩
104 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More