On the general no-three-in-line problem

arXiv2106.15621MaRDI QIDQ6505136FDOQ6505136

Authors: Theophilus Agama 

Abstract: In this paper we show that the number of points that can be placed in the grid $nimesnimescdotsimesn(dtimes)=n^d$ for all $dinmathbbN$ with $dgeq2$ such that no three points are collinear satisfies the lower bound �egin{align} gg_d n^{d-1}sqrt[2d]{d}. onumber end{align}This pretty much extends the result of the no-three-in-line problem to all dimension $dgeq3$.

Mathematics Subject Classification ID

Discrete geometry (52Cxx)

This page was built for publication: On the general no-three-in-line problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6505136)