The right acute angles problem?
Andrey Kupavskii, Dmitriy Zakharov

TL;DR
This paper explores a variant of the Danzer–Grünbaum acute angles problem, analyzing the asymptotic behavior of the maximum size of point sets with no large angles in high dimensions, and addresses related stability questions.
Contribution
It introduces a new limit-based variant of the problem, provides bounds for the asymptotic growth rate, and resolves a related stability problem while refuting a previous conjecture.
Findings
Established that the limit c is at least √2.
Provided bounds for the growth rate function F(α).
Solved a stability problem and refuted a conjecture.
Abstract
The Danzer--Gr\"unbaum 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\'er 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\'er and Harangi, the best lower bound we could get is . We also solve a related problem…
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.
