2018
DOI: 10.48550/arxiv.1809.04316
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

On superspecial abelian surfaces and type numbers of totally definite quaternion algebras

Abstract: In this paper we determine the number of endomorphism rings of superspecial abelian surfaces over a field Fq of odd degree over Fp in the isogeny class corresponding to the Weil q-number ± √ q . This extends earlier works of T.-C. Yang and the present authors on the isomorphism classes of these abelian surfaces, and also generalizes the classical formula of Deuring for the number of endomorphism rings of supersingular elliptic curves. Our method is to explore the relationship between the type and class numbers… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 22 publications
0
2
0
Order By: Relevance
“…Compared to the previous case, End(X π ) is no longer necessarily a maximal order in End 0 (X π ) even in the case n = 1 [57, Theorem 6.2], which causes new difficulties. The number of endomorphism rings (up to isomorphism) of members of Isog( √ p ) is calculated in [63]. We produce the counterpart of (1.11) for the set PPAV( √ p ).…”
Section: Introductionmentioning
confidence: 99%
“…Compared to the previous case, End(X π ) is no longer necessarily a maximal order in End 0 (X π ) even in the case n = 1 [57, Theorem 6.2], which causes new difficulties. The number of endomorphism rings (up to isomorphism) of members of Isog( √ p ) is calculated in [63]. We produce the counterpart of (1.11) for the set PPAV( √ p ).…”
Section: Introductionmentioning
confidence: 99%
“…n O F [ √ −1 ], O F [ √ −ε ] O F ( , B1,2 Here B 1,2 ⊂ F ( √ −1 ) is the order defined in (7.3), and O F [ √ −ε ] coincides with the ring of integers of F ( √ −ε ) = F ( √ −2 ) by Lemma 7.2.5. For each B ∈ B n , we sett(C n , B) := #{ O ′ ∈ Tp(H) | O ′⋆ ⋆ ⋆ ≃ C n , and Emb(B, O ′ ) = ∅}.It is shown in[48, Corollary 3.5] (see also Remark 3.6) that(8.8) h(C n , B) = h(F )t(C n , B) ∀B ∈ B n .The main tool to compute h(C n , B) (and in turn t(C n , B)) is equation(3.19). In the current setting, we haved(H) = O F and hence ω(H) = 0.…”
mentioning
confidence: 99%