A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's conjecture, that the cardinalities of rational distance sets in general position are uniformly bounded, generalizing results of Solymosi–de Zeeuw, Makhul–Shaffaf, Shaffaf and Tao. In the process, we give a criterion for certain varieties with non-canonical singularities to be of general type.
Ascher, K., Braune, L., Turchet, A. (2020). The Erdős–Ulam problem, Lang's conjecture and uniformity. BULLETIN OF THE LONDON MATHEMATICAL SOCIETY, 52(6), 1053-1063 [10.1112/blms.12381].
The Erdős–Ulam problem, Lang's conjecture and uniformity
Turchet A.
2020-01-01
Abstract
A rational distance set is a subset of the plane such that the distance between any two points is a rational number. We show, assuming Lang's conjecture, that the cardinalities of rational distance sets in general position are uniformly bounded, generalizing results of Solymosi–de Zeeuw, Makhul–Shaffaf, Shaffaf and Tao. In the process, we give a criterion for certain varieties with non-canonical singularities to be of general type.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
