Size of orthogonal sets of exponentials for the disk
Alex Iosevich, Mihail N. Kolountzakis

TL;DR
This paper investigates the size limitations of orthogonal exponential sets for the disk, establishing bounds based on pairwise distances and improving previous results on their maximum size within a disk.
Contribution
The authors prove that the size of orthogonal exponential sets is linearly bounded by the distance between elements and provide an improved upper bound on their size in a disk.
Findings
Size of orthogonal exponential sets is O(t) when elements are t apart.
Maximum size of such sets in a disk of radius R is O(R^{2/3}).
Improves previous bounds on the size of orthogonal exponential sets.
Abstract
Suppose has the property that any two exponentials with frequency from are orthogonal in the space , where is the unit disk. Such sets are known to be finite but it is not known if their size is uniformly bounded. We show that if there are two elements of which are distance apart then the size of is . As a consequence we improve a result of Iosevich and Jaming and show that has at most elements in any disk of radius .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
