Greenberg's conjecture for totally real number fields in terms of algorithmic complexity
Greenberg's conjecture for totally real number fields in terms of algorithmic complexity
Let k be a totally real number field and let k_∞ be its cyclotomic Z_p-extension, p≥2. Generalizing some viewpoints of Taya and others, we show that Greenberg's conjecture (lambda = mu = 0) depends on images, of ideal norms along the stages k_n/k of the tower, in the torsion group …