Pith. sign in

REVIEW 1 cited by

Note on a theorem of Professor X

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.14328 v1 pith:KHHIQFYO submitted 2021-09-29 math.NT math.AG

classification math.NTmath.AG
keywords mathfraksiegelcdotfinitenessintegralmathrmmordellnote
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Between his arrival in Frankfurt in $1922$ and and his proof of his famous finiteness theorem for integral points in $1929$, Siegel had no publications. He did, however, write a letter to Mordell in $1926$ in which he explained a proof of the finiteness of integral points on hyperelliptic curves. Recognizing the importance of this argument (and Siegel's views on publication), Mordell sent the relevant extract to be published under the pseudonym "X". The purpose of this note is to explain how to optimize Siegel's $1926$ technique to obtain the following bound. Let $K$ be a number field, $S$ a finite set of places of $K$, and $f\in \mathfrak{o}_{K,S}[t]$ monic of degree $d\geq 5$ with discriminant $\Delta_f\in \mathfrak{o}_{K,S}^\times$. Then: $$\#|\{(x,y) : x,y\in \mathfrak{o}_{K,S}, y^2 = f(x)\}|\leq 2^{\mathrm{rank}\,\mathrm{Jac}(C_f)(K)}\cdot O(1)^{d^3\cdot ([K:\mathbb{Q}] + \#|S|)}.$$ This improves bounds of Evertse-Silverman and Bombieri-Gubler from $1986$ and $2006$, respectively. The main point underlying our improvement is that, informally speaking, we insist on "executing the descents in the presence of only one root (and not three) until the last possible moment".

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Random Multiplicative Functions and Making Squares from Polynomial Values

    math.NT 2026-07 accept novelty 7.0 of 10

    Central limit theorems are proved for sums of Rademacher and extended Rademacher random multiplicative functions along polynomial values P(n), by establishing paucity of solutions to P(n₁)P(n₂)P(n₃)P(n₄) = □.

Pith tools