Algorithmic complexity of Greenberg’s conjecture

Let k be a totally real number field and p a prime. We show that the “complexity” of Greenberg’s conjecture ( λ = μ = 0 ) is governed (under Leopoldt’s conjecture) by the finite torsion group T k of the Galois group of the maximal abelian p -ramified pro- p -extension of  k , by means of images, in...

Celý popis