TY - JOUR
T1 - The right acute angles problem?
AU - Kupavskii, Andrey
AU - Zakharov, Dmitriy
N1 - Funding Information:
Research supported by the grant of the Ministry of Education and Science of the Russian FederationN 075-15-2019-1926.
Publisher Copyright:
© 2020 Elsevier Ltd
PY - 2020/10
Y1 - 2020/10
N2 - The Danzer–Grünbaum acute angles problem asks for the largest size of a set of points in Rd that determines only acute angles. There has been a lot of progress recently due to the results of the second author and of Gerencsér and Harangi, and now the problem is essentially solved. In this note, we suggest the following variant of the problem, which is one way to “save” the problem. Let F(α)=limd→∞f(d,α)1∕d, where f(d,α) is the largest number of points in Rd with no angle greater than or equal to α. Then the question is to find c≔limα→π∕2− F(α). It is an intriguing question whether c is equal to 2 as one may expect in view of the result of Gerencsér and Harangi. In this paper we prove the lower bound c⩾2. We also solve a related problem of Erdős and Füredi on the “stability” of the acute angles problem and refute another conjecture stated in the same paper.
AB - The Danzer–Grünbaum acute angles problem asks for the largest size of a set of points in Rd that determines only acute angles. There has been a lot of progress recently due to the results of the second author and of Gerencsér and Harangi, and now the problem is essentially solved. In this note, we suggest the following variant of the problem, which is one way to “save” the problem. Let F(α)=limd→∞f(d,α)1∕d, where f(d,α) is the largest number of points in Rd with no angle greater than or equal to α. Then the question is to find c≔limα→π∕2− F(α). It is an intriguing question whether c is equal to 2 as one may expect in view of the result of Gerencsér and Harangi. In this paper we prove the lower bound c⩾2. We also solve a related problem of Erdős and Füredi on the “stability” of the acute angles problem and refute another conjecture stated in the same paper.
UR - http://www.scopus.com/inward/record.url?scp=85083805553&partnerID=8YFLogxK
U2 - 10.1016/j.ejc.2020.103144
DO - 10.1016/j.ejc.2020.103144
M3 - Article
AN - SCOPUS:85083805553
VL - 89
JO - European Journal of Combinatorics
JF - European Journal of Combinatorics
SN - 0195-6698
M1 - 103144
ER -