Lines on $$K3$$–Quartics Via Triangular Sets

Abstract We prove the sharp upper bound of at most 52 lines on a complex $$K3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>K</mml:mi> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> –surface of degree 4 with a non-empty singular locus. We also classify the configurations of more than 48 lines on smooth complex quartics.

Authors

Institutions

Publication Details

Journal
Discrete & Computational Geometry
Published
2024-10-06
DOI
https://doi.org/10.1007/s00454-024-00690-6
Citations
1
Primary Topic
Finite Group Theory Research
Type
article
Field-Weighted Citation Impact
1.32

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lines on $$K3$$–Quartics Via Triangular Sets

Sławomir Rams, Alex Degtyarev
1 citations
Discrete & Computational Geometry
Finite Group Theory Research
1.32
article

Lines on $$K3$$–Quartics Via Triangular Sets

Sławomir Rams, Alex Degtyarev
article en
1 citations

Abstract

Abstract We prove the sharp upper bound of at most 52 lines on a complex $$K3$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>K</mml:mi> <mml:mn>3</mml:mn> </mml:mrow> </mml:math> –surface of degree 4 with a non-empty singular locus. We also classify the configurations of more than 48 lines on smooth complex quartics.

Discrete & Computational GeometryVol. 73(3)
Jagiellonian University (PL), Bilkent University (TR), Institute of Mathematics (PL)
Narodowe Centrum Nauki, Narodowym Centrum Nauki
Openalex Percentile: Top 22%
Finite Group Theory Research
1.32
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.