A note on the no-three-in-line problem on a torus

Abstract

In this paper we show that at most $2\gcd (m,n)$ points can be placed with no three in a line on an $m\times n$ discrete torus. In the situation when $\gcd (m,n)$ is a prime, we completely solve the problem.

References in corpus (1)

• The no-three-in-line problem on a torus