A numerical transcendental method in algebraic geometry
arXiv:1811.10634 · doi:10.1137/18M122861X
Abstract
Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of numerical error in terms of an intrinsic measure of complexity of each surface. The method applies more generally to the computation of the lattice generated by Hodge cycles of middle dimension on smooth projective hypersurfaces. We demonstrate the method by a systematic study of thousands of quartic surfaces (K3s) defined by sparse polynomials. As an application, we count the number of rational curves of a given degree lying on each surface. For quartic surfaces we also compute the endomorphism ring of their transcendental lattice.
arXiv comment25 pages
References in corpus (10)
- Knots and Numbers in Theory to 7 Loops and Beyond
- A Fast Approach to Creative Telescoping
- Computing periods of rational integrals
- Rigorous computation of the endomorphism ring of a Jacobian
- A database of genus 2 curves over the rational numbers
- On the computation of the Picard group for surfaces
- Computing Néron-Severi groups and cycle class groups
- Computing Periods of Hypersurfaces
- Computing the geometric endomorphism ring of a genus 2 Jacobian
- Kummer surfaces and the computation of the Picard group
Cited by in corpus (7)
- Computing Periods of Hypersurfaces
- Deep Learning Gauss-Manin Connections
- Effective obstruction to lifting Tate classes from positive characteristic
- On reconstructing subvarieties from their periods
- A semi-numerical algorithm for the homology lattice and periods of complex elliptic surfaces over the projective line
- Effective homology and periods of complex projective hypersurfaces
- Separation of periods of quartic surfaces