A note on the no-three-in-line problem on a torus
Abstract
In this paper we show that at most 2 (m,n) points can be placed with no three in a line on an m× n discrete torus. In the situation when (m,n) is a prime, we completely solve the problem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.