Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (printed p. 254): for a planar convex body , $N=N(K)\in\mathbb N\cup{\infty}$ is the smallest number for which there is a point such that every circle with centre meets in at most points. For , is the set of points for which some circle centred at meets in at least points; by Theorem 1.2, is the largest with .
Theorem 1.1 (printed p. 254). "There is a planar convex body with ."
In this notation Erdős's 1946 statement, quoted by the paper on p. 253, is for every convex body . The paper remarks (p. 254) that it fails for every acute triangle, where each boundary point is the centre of a circle meeting the boundary 4 times, and for every regular -gon; it conjectures that is bounded by a constant independent of , "probably by 6" (p. 254).
Source. I. Bárány and E. Roldán-Pensado, A question from a famous paper of Erdős, Discrete Comput. Geom. 50 (2013), 253--261, doi:10.1007/s00454-013-9507-z; the definitions and Theorem 1.1 on printed p. 254. The edition read is identified on the source card.
Read depth. Claims checked: the definitions and the theorem were read clause by clause on the page image. The proof (p. 259) was read for structure only; its "direct computation" was not repeated, and nothing here is independently reviewed.
Proof pointer
§ 3, p. 259, using Lemmas 3.1 and 3.2 (p. 258). The body is a 15-gon with threefold rotational symmetry, built from the points , , , and their rotations by and about the origin, with a fifth point near (and its rotations) supplied by Lemma 3.1 at the acute angle . Lemma 3.2 places, for points near the broken line , a centred circle meeting the broken line in at least 6 points, checked by direct computation; Lemma 3.1 handles the rest of the side . The paper states that the midpoint of is not in , which gives . Not checked here.
Dependencies
Lemmas 3.1 and 3.2 (p. 258) of the paper.
Bears on
- Problem 982: Erdős's 1946 paper poses three conjectures on p. 248, each stated as stronger than the one before; the problem's vertex bound is the consequence it draws from the second, and the convex-curve statement is the third. The theorem shows that the number 2 in the convex-curve statement cannot be replaced by anything below 6. It is a statement about points of a convex curve and their centred circles, says nothing about distinct distances from a vertex of a convex polygon, and leaves the problem's statement undecided.