The right acute angles problem?
arXiv:1910.00798
Abstract
The Danzer--Grünbaum acute angles problem asks for the largest size of a set of points in that determines only acute angles. Recently, the problem was essentially solved thanks to the results of the second author and of Gerencsér and Harangi: now, the lower and the upper bounds are and , respectively. The lower-bound construction is surprisingly simple. In this note, we suggest the following variant of the problem, which is one way to "save" the problem. Put , where is the largest set of points in with no angle greater than . Then the question is to find Although one may expect that in view of the result of Gerencsér and Harangi, the best lower bound we could get is . We also solve a related problem of Erdos and Füredi on the "stability" of the acute angles problem and refute another conjecture stated in the same paper.
Minor corrections