On the general no-three-in-line problem

Abstract: In this paper we show that the number of points that can be placed in the grid

n i m e s n i m e s c d o t s i m e s n (d t i m e s) = n^{d}

for all

d i n m a t h b b N

with

d g e q 2

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

d g e q 3

.

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)