The famous no-three-in-line problem raised by Dudeney [6] in 1917: Is it true that one can select 2n points in [n]2 such that no three are collinear?
Statement
The famous no-three-in-line problem raised by Dudeney [6] in 1917: Is it true that one can select 2n points in [n]2 such that no three are collinear? Variation of no-three-in-line problem Ji Zeng (joint work with Andrew Suk, Yaobin Chen, Xizhi Liu, Jiaxi Nie) 188 Oberwolfach Report 3/2024 d showed that \alphad,k (n) \leq O n ⌊(k+2)/2⌋ , which behaves differently from Θ(nd−k ) for infinitely many values of d and k. The first result of this talk is an improvement of Lefmann’s upper bound. Theorem 1 (Suk–Zeng [15]). For fixed d and k, as n \to \infty, we have d 1 \alphad,k (n) \leq O n 2⌊(k+2)/4⌋ (1− 2⌊(k+2)/4⌋d+1 ) .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.