Wiki
Wiki

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 KK, $N=N(K)\in\mathbb N\cup{\infty}$ is the smallest number for which there is a point P∈∂KP\in\partial K such that every circle with centre PP meets ∂K\partial K in at most NN points. For n∈N∪{∞}n\in\mathbb N\cup\{\infty\}, J(K,n)J(K,n) is the set of points P∈∂KP\in\partial K for which some circle centred at PP meets ∂K\partial K in at least nn points; by Theorem 1.2, N(K)N(K) is the largest NN with J(K,N)=∂KJ(K,N)=\partial K.

Theorem 1.1 (printed p. 254). "There is a planar convex body KK with N(K)=6N(K)=6."

In this notation Erdős's 1946 statement, quoted by the paper on p. 253, is N(K)≤2N(K)\le2 for every convex body KK. 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 (2k+1)(2k+1)-gon; it conjectures that N(K)N(K) is bounded by a constant independent of KK, "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 A1=(1000,0)A_1=(1000,0), A2=(906,114)A_2=(906,114), A3=(645,359)A_3=(645,359), A4=(−498,871)A_4=(-498,871) and their rotations by 2π/32\pi/3 and 4π/34\pi/3 about the origin, with a fifth point A5A_5 near A4A_4 (and its rotations) supplied by Lemma 3.1 at the acute angle ∠A3A4B1\angle A_3A_4B_1. Lemma 3.2 places, for points near the broken line A4B1B2B3A_4B_1B_2B_3, a centred circle meeting the broken line C1C2C3C4C_1C_2C_3C_4 in at least 6 points, checked by direct computation; Lemma 3.1 handles the rest of the side [A3,A4][A_3,A_4]. The paper states that the midpoint of [A3A4][A_3A_4] is not in J(K,7)J(K,7), which gives N(K)≤6N(K)\le6. 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.