The right acute angles problem?

Abstract

The Danzer--Gr\"unbaum acute angles problem asks for the largest size of a set of points in Rd 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 2d-1+1 and 2d-1, 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 F(α) = d ∞ f(d,α)1/d, where f(d,α) is the largest set of points in Rd with no angle greater than α. Then the question is to find c:= α π/2-F(α). Although one may expect that c=2 in view of the result of Gerencs\'er and Harangi, the best lower bound we could get is c 2. We also solve a related problem of Erdos and F\"uredi on the "stability" of the acute angles problem and refute another conjecture stated in the same paper.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…