2022
DOI: 10.1515/forum-2021-0203
|View full text |Cite
|
Sign up to set email alerts
|

Iwasawa invariants for elliptic curves over ℤ p -extensions and Kida's formula

Abstract: This paper aims at studying the Iwasawa λ-invariant of the p-primary Selmer group. We study the growth behavior of p-primary Selmer groups in p-power degree extensions over non-cyclotomic ℤ p {\mathbb{Z}_{p}} -extensions of a number fiel… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

1
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 33 publications
1
1
0
Order By: Relevance
“…This allows us to prove that μ is always zero and give an upper bound on λ under the hypothesis that is larger than the number of loops in a bouquet (see Corollary 4.3 and Theorem 4.13 for the precise statements). Without this hypothesis, we show that both μ and λ can be arbitrarily large (see Lemma 2.17), which mirrors similar results in the setting of Iwasawa theory of number fields and elliptic curves (see [11], [13], [15], [18]). (b) Let t be the number of loops in a bouquet.…”
Section: Resultssupporting
confidence: 82%
See 1 more Smart Citation
“…This allows us to prove that μ is always zero and give an upper bound on λ under the hypothesis that is larger than the number of loops in a bouquet (see Corollary 4.3 and Theorem 4.13 for the precise statements). Without this hypothesis, we show that both μ and λ can be arbitrarily large (see Lemma 2.17), which mirrors similar results in the setting of Iwasawa theory of number fields and elliptic curves (see [11], [13], [15], [18]). (b) Let t be the number of loops in a bouquet.…”
Section: Resultssupporting
confidence: 82%
“…The derived multigraphs are again seen to be connected for all n by choosing a suitable spanning tree T in Theorem 2. 15. One can choose the spanning tree T to pass through all vertices in the following order v 1 , v t , v t−1 , .…”
mentioning
confidence: 99%