1975
DOI: 10.1007/bfb0097582
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm for determining the type of a singular fiber in an elliptic pencil

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
581
0
11

Year Published

1982
1982
2017
2017

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 449 publications
(595 citation statements)
references
References 0 publications
3
581
0
11
Order By: Relevance
“…To see that the last two types cannot occur, simply note that E 0 (K p ) isp-divisible (cf. [25]) but E(K p ) is not, by the analogue of Lemma 2.5(ii) forp.…”
Section: Lemma 22 (I) Every Prime Inmentioning
confidence: 92%
“…To see that the last two types cannot occur, simply note that E 0 (K p ) isp-divisible (cf. [25]) but E(K p ) is not, by the analogue of Lemma 2.5(ii) forp.…”
Section: Lemma 22 (I) Every Prime Inmentioning
confidence: 92%
“…Then minimalizing is achieved by running Tate's algorithm [18] which consequently gives relations between the coefficients of a 1 , D ′ and ∆, or in some cases like ours leads to a contradiction. By inspection of (6), the polynomial a 1 encodes singular or supersingular fibers.…”
Section: Proof Of Theorem 11 In the Square Casementioning
confidence: 90%
“…It is trivial, but crucial to note that if X is smooth, the fibers of π are the residual cubics, so they consist of at most 3 components. By the classification of Kodaira [4] and Tate [9], this allows for six different types of singular fibers, listed below with corresponding vanishing order v of ∆:…”
Section: Ramification Type 2mentioning
confidence: 99%