Counting Lines with Vinberg's algorithm
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909611406131200 |
|---|---|
| author | Degtyarev, Alex Rams, Sławomir |
| author_facet | Degtyarev, Alex Rams, Sławomir |
| contents | We combine classical Vinberg's algorithms with the lattice-theoretic/arithmetic approach from arXiv:1706.05734 [math.AG] to give a method of classifying large line configurations on complex quasi-polarized K3-surfaces. We apply our method to classify all complex K3-octic surfaces with at worst Du Val singularities and at least 32 lines. The upper bound on the number of lines is 36, as in the smooth case, with at most 32 lines if the singular locus is non-empty. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2104_04583 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Counting Lines with Vinberg's algorithm Degtyarev, Alex Rams, Sławomir Algebraic Geometry Primary: 14J28, Secondary: 14J27, 14N25 We combine classical Vinberg's algorithms with the lattice-theoretic/arithmetic approach from arXiv:1706.05734 [math.AG] to give a method of classifying large line configurations on complex quasi-polarized K3-surfaces. We apply our method to classify all complex K3-octic surfaces with at worst Du Val singularities and at least 32 lines. The upper bound on the number of lines is 36, as in the smooth case, with at most 32 lines if the singular locus is non-empty. |
| title | Counting Lines with Vinberg's algorithm |
| topic | Algebraic Geometry Primary: 14J28, Secondary: 14J27, 14N25 |
| url | https://arxiv.org/abs/2104.04583 |