2 citations · 3 across the 6 of their papers we have counts for
6 papers
Distinct Angles in General Position
Henry L. Fleischmann, Sergei V. Konyagin, Steven J. Miller +3
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erdős' distinct angle problem, the problem of finding the minimum numb…
Distinct Angle Problems and Variants
Henry L. Fleischmann, Hongyi B. Hu, Faye Jackson +4
The Erdős distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erdős' distinct angle problem, the problem of finding the minimum number of dis…
Optimal Point Sets Determining Few Distinct Angles
Henry L. Fleischmann, Steven J. Miller, Eyvindur A. Palsson +2
We characterize the largest point sets in the plane which define at most 1, 2, and 3 angles. For the largest size of a point set admitting at most angles, we prove $P(2)…
Angle chains and pinned variants
Eyvindur Ari Palsson, Steven Senger, Charles Wolf
We study a variant of the Erd\H os unit distance problem, concerning angles between successive triples of points chosen from a large finite point set. Specifically, given a large f…
On the number of ordinary lines determined by sets in complex space
Abdul Basit, Zeev Dvir, Shubhangi Saraf +1
Kelly's theorem states that a set of points affinely spanning must determine at least one ordinary complex line (a line passing through exactly two of the points…
Finite field Kakeya and Nikodym sets in three dimensions
Ben Lund, Shubhangi Saraf, Charles Wolf
We give improved lower bounds on the size of Kakeya and Nikodym sets over . We also propose a natural conjecture on the minimum number of points in the union of a n…