Search arXivSearch

arXiv · 2508.09391

Counting points on a family of degree one del Pezzo surfaces

Abstract

We study rational points on the elliptic surface given by the equation: $$y^2 = x^3 + AxQ(u,v)^2 + BQ(u,v)^3,$$ where $A,B\in \mathbb{Z}$ satisfy that $4A^3-27B^2\neq 0$ and $Q(u,v)$ is a positive-definite quadratic form. We prove asymptotics for a special subset of the rational points, specifically those that are integral with respect to the singularity. This method utilizes Mordell's parameterization of integral points on quadratic twists on elliptic curves, which is based on a syzygy for invariants of binary quartic forms. Let $F(A,B)$ denote the set of binary quartic forms with invariants $-4A$ and $-4B$ under the action of $\textrm{SL}_2(\mathbb{Z})$. We reduce the point-counting problem to the question of determining an asymptotic formula for the correlation sums of representation numbers of binary quadratic and binary quartic forms, where the quartic forms range in $F(A,B)$. These sums are then treated using a connection to modular forms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Katharine Woo. 2026-04-21. Counting points on a family of degree one del Pezzo surfaces. https://arxiv.org/abs/2508.09391

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT