Algorithmic complexity of Greenberg's conjecture

From MaRDI portal




Abstract: Let k be a totally real number field and p a prime. We show that the ``complexity of Greenberg's conjecture (lambda=mu=0) is of p-adic nature governed (under Leopoldt's conjecture) by the finite torsion group mathcalTk of the Galois group of the maximal abelian p-ramified pro-p-extension of k, by means of images in mathcalTk of ideal norms from the layers kn of the cyclotomic tower (Theorem (5.2)). These images are obtained via the formal algorithm computing, by ``unscrewing, the p-class group of~kn. Conjecture (5.4) of equidistribution of these images would show that the number of steps bn of the algorithms is bounded as noinfty, so that Greenberg's conjecture, hopeless within the sole framework of Iwasawa's theory, would hold true ``with probability 1. No assumption is made on [k:mathbbQ], nor on the decomposition of p in k/mathbbQ.









This page was built for publication: Algorithmic complexity of Greenberg's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043913)