2015
DOI: 10.1093/imrn/rnv006
|View full text |Cite
|
Sign up to set email alerts
|

An Algorithm to Compute Automorphism Groups of K3 Surfaces and an Application to Singular K3 Surfaces

Abstract: Abstract. Let X be a complex algebraic K3 surface or a supersingular K3 surface in odd characteristic. We present an algorithm by which, under certain assumptions on X, we can calculate a finite set of generators of the image of the natural homomorphism from the automorphism group of X to the orthogonal group of the Néron-Severi lattice of X. We then apply this algorithm to certain complex K3 surfaces, among which are singular K3 surfaces whose transcendental lattices are of small discriminants. IntroductionTh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
62
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 23 publications
(63 citation statements)
references
References 26 publications
1
62
0
Order By: Relevance
“…In Section 4, we give a computational characterization of the image of the natural homomorphism ϕ X k from Aut(X k ) to O(S k ) and prove Proposition 1.1. In Section 5, we confirm that the requirements to use Borcherds method given in [32] are fulfilled in the cases of our singular K3 surfaces X k , obtain a finite set of generators of Aut(X k ) in the form of matrices in O(S k ) by this method, and prove Theorems 1.4 and 1.5. The embedding of S k into the even unimodular hyperbolic lattice L 26 of rank 26 given in Table 5.1 is the key of this method.…”
Section: Introductionsupporting
confidence: 67%
See 1 more Smart Citation
“…In Section 4, we give a computational characterization of the image of the natural homomorphism ϕ X k from Aut(X k ) to O(S k ) and prove Proposition 1.1. In Section 5, we confirm that the requirements to use Borcherds method given in [32] are fulfilled in the cases of our singular K3 surfaces X k , obtain a finite set of generators of Aut(X k ) in the form of matrices in O(S k ) by this method, and prove Theorems 1.4 and 1.5. The embedding of S k into the even unimodular hyperbolic lattice L 26 of rank 26 given in Table 5.1 is the key of this method.…”
Section: Introductionsupporting
confidence: 67%
“…In fact, a part of the result on Aut(X 2 ) has been obtained in [32]. In [32], however, we did not discuss the problem of converting a matrix in O(S X ) to a geometric automorphism of X. In the present article, we give a method to derive geometric information of automorphisms from their action on S X .…”
Section: Introductionmentioning
confidence: 96%
“…Finally, the item ε refers to those involutions studied in detail in Section 5.4 and listed in [5]) to calculate aut(X) of a K3 surface X and its action on N X . The details of the algorithms in the computation below are explained in [32]. Suppose that we have a primitive embedding ι X : S X ֒→ L 26 .…”
Section: 2mentioning
confidence: 99%
“…For example, if [ι X ] ⊥ contains a (−2)-vector, then this condition is fulfilled. Condition (B) implies that each ι * X R ⊥ 26 -chamber D in P X has only a finite number of walls (see [32]). More precisely, if D is induced by a Conway chamber C, then the set of vectors defining walls of D can be calculated from the Weyl vector w C corresponding to C by Theorem 2.8.2.…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation