A note on the no-three-in-line problem on a torus
classification
🧮 math.CO
keywords
problemtoruscompletelydiscretelineno-three-in-linenoteplaced
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.