Searcharxiv⌕ Search

arXiv · 2611.14226

Counting Rational Points on Cayley's Cubic Surface

Abstract

We study rational points of bounded maximum-coordinate height on the split four-nodal Cayley cubic surface over \(\mathbb Q\), with its nine lines removed. Writing \(U\) for this open subset and \(N_U(B)\) for its counting function, we establish \[ N_U(B)\sim c_{\mathrm{Peyre}}B(\log B)^6. \] The argument starts from the universal-torsor parametrization and combines two counting methods over complementary ranges of the auxiliary variables. The two-dimensional lattice count is controlled by averages of reciprocal shortest-vector lengths and character-moment bounds, while Poisson summation treats the complementary parameter range. The main contribution is the uniform control needed to combine these methods when the size parameters of the auxiliary variables vary independently: the estimates retain every coprimality condition, the original height weight, and the full set of auxiliary tuples contributing to the geometric error. Divisibility estimates without an additional power of the height parameter control the sieve tail and justify removing the sieve after taking the height limit. We track the derivative losses and boundary contributions throughout the summation, and identify the common continuous main term with Peyre's constant by computing the effective-cone volume and the real and finite local densities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaodong Zhao. 2026-11-10. Counting Rational Points on Cayley's Cubic Surface. https://searcharxiv.com/abs/2611.14226

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Estimates for the Number of Solutions of Algebraic Diophantine Equations: From the Circle Method to the Manin Conjecture

This work continues the research of the author on estimates for the number of solutions of algebraic diophantine equations by means of the circle method and develops this line in the geometric direction, towards counting integral points on log Fano varieties. It consists of two parts. Part 1 is the corrected version of the previous work. For diagonal equations $c_1x^{k_1} +...+c_sx^{k_s} = n$ with natural coefficients, upper asymptotic estimates for the number of natural solutions in the range $s \leq 2^k$, where the classical asymptotics is not applicable, are obtained by the circle method and the Hua lemma. The estimates are refined for $s = 2,3,4$ and various $k_i$; in the range $s > 2^k$ they agree with the classical ones. Part 2 develops the same line: from counting solutions of equations to counting integral points on log Fano varieties, where the circle method fails because of insuf ficient dimension. In the log case, the product in the Peyre constant diverges as a harmonic series. A method of analytic compensation is introduced that cancels the divergent term and returns the problem to the range of applicability of the standard scheme. The main result is a method for computing the Peyre log constant with guar anteed accuracy and certified intervals for the number of integral points whenever an estimate of the remainder of the asymptotics is known. The log constant is computable unconditionally, without the Manin conjecture; the conjecture is needed only to interpret it as the leading term of the asymptotics. An experimental verification for the algebraic torus and the Fermat cubic surface is presented.

math.NT↗

An application of "Selmer group Chabauty" to arithmetic dynamics

We describe how one can use the "Selmer group Chabauty" method developed by the author to show that certain hyperelliptic curves of the form $$ C \colon y^2 = x^{2g+1} + h(x)^2 \,, $$ with $h \in \mathbb{Z}[x]$ such that $\operatorname{deg} h \le g$ and $h(0)$ is odd, have only the "obvious" rational points $\infty$ (the unique point at infinity on the smooth projective model of the curve) and $(0, \pm h(0))$. Let $c \in \mathbb{Q}$ and write $f_c(x) = x^2 + c$. We denote the iterates of $f_c$ by $f_c^{\circ n}$; i.e., we set $f_c^{\circ 0}(x) = x$ and $f_c^{\circ(n+1)}(x) = f_c(f_c^{\circ n}(x))$. As an application of the method, we prove that if $f_c^{\circ 2}$ is irreducible, then $f_c^{\circ 6}$ is also irreducible. Assuming the Generalized Riemann Hypothesis (GRH), it also follows that $f_c^{\circ 10}$ is irreducible.

math.NT↗

Greatest Common Divisors and an Unlikely Intersection Type Conjecture

We prove inequalities involving greatest common divisors of functions at integral points with respect to numerically parallel divisors, generalizing a result of Wang and Yasufuku (after work of Bugeaud-Corvaja-Zannier, Corvaja-Zannier, and the second author). In addition to proving results in a broader context than previously considered, we also study the exceptional set in this setting, for both the counting function and the proximity function. Based on our study of exceptional sets, we propose new conjectures connected to the topic of unlikely intersections. We prove special cases of the conjectures on abelian varieties and the algebraic torus, including a completely explicit result in the former case, and provide a link between the conjectures and exceptional sets for inequalities involving greatest common divisors.

math.NT↗