摘要
The aim of this paper is to investigate the size properties of a planar set whose distance set has some prescribed arithmetic combinatorics. Such research is motivated by the conjecture that the disk has no more than 3 orthogonal exponentials. By proving a shifted version of ErdSs-Solymosi＇s theorem on the distance sets, we give some grounds on the conjecture. The results obtained here extend the corresponding results of Iosevich and Jaming in a simple manner.
The aim of this paper is to investigate the size properties of a planar set whose distance set has some prescribed arithmetic combinatorics. Such research is motivated by the conjecture that the disk has no more than 3 orthogonal exponentials. By proving a shifted version of ErdSs-Solymosi＇s theorem on the distance sets, we give some grounds on the conjecture. The results obtained here extend the corresponding results of Iosevich and Jaming in a simple manner.
基金
Supported by Key Project of Ministry of Education of China （Grant No. 108117） and National Natural Science Foundation of China （Grant No. 10871123）
