Papers › Integral points on cubic surfaces: heuristics and numerics
Integral points on cubic surfaces: heuristics and numerics
Tim Browning, Florian Wilsch
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We develop a heuristic for the density of integer points on affine cubic surfaces. Our heuristic applies to smooth surfaces defined by cubic polynomials that are log K3, but it can also be adjusted to handle singular cubic surfaces. We compare our heuristic to Heath-Brown's prediction for sums of three cubes, as well as to asymptotic formulae in the literature around Zagier's work on the Markoff cubic surface, and work of Baragar and Umeda on further surfaces of Markoff-type. We also test our heuristic against numerical data for several families of cubic surfaces.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections