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
After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green,...
<p>The average-distance problem is to find the best way to approximate (or represent) a given measur...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
A rational distance set is a subset of the plane such that the distance between any two points is a ...
Abstract. We prove that the fibered power conjecture of Caporaso et al. (Conjecture H, [CHM], §6) to...
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets sta...
AbstractLet G be the graph obtained from all the rational points in the d-space Ed by connecting eve...
AbstractA point set is separated if the minimum distance between its elements is one. Two numbers ar...
In this thesis we give results on unit and rational distances, structure results for surfaces contai...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...
. We prove that the fibered power conjecture of Caporaso et al. (Conjecture H, [CHM], x6) together w...
AbstractWe prove that any rational subset K of Aω is the set of cluster points of Aω equipped with s...
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
Abstract. Nathaniel Dean [6] asks the following: is it possible to find four non-concyclic points on...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green,...
<p>The average-distance problem is to find the best way to approximate (or represent) a given measur...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
A rational distance set is a subset of the plane such that the distance between any two points is a ...
Abstract. We prove that the fibered power conjecture of Caporaso et al. (Conjecture H, [CHM], §6) to...
In this paper we investigate the Erdös/Falconer distance conjecture for a natural class of sets sta...
AbstractLet G be the graph obtained from all the rational points in the d-space Ed by connecting eve...
AbstractA point set is separated if the minimum distance between its elements is one. Two numbers ar...
In this thesis we give results on unit and rational distances, structure results for surfaces contai...
Distance sets Given a set E ⊂ Rd, the distance set of E is the set of all distances realised by pair...
. We prove that the fibered power conjecture of Caporaso et al. (Conjecture H, [CHM], x6) together w...
AbstractWe prove that any rational subset K of Aω is the set of cluster points of Aω equipped with s...
[EN] Using the general notion of distance function introduced in an earlier paper, a construction of...
Abstract. Nathaniel Dean [6] asks the following: is it possible to find four non-concyclic points on...
In this paper, we prove that a set of N points in R^2 has at least c^N_(logN) distinct distances, th...
After showing that the General Cayley\u2013Bacharach Conjecture formulated by D. Eisenbud, M. Green,...
<p>The average-distance problem is to find the best way to approximate (or represent) a given measur...
AbstractIn this paper we study the generalized Erdős–Falconer distance problems in the finite field ...
DOI
Add to ORKG