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

2014/06/25 by Zofia Stȩpień, Aleksander Misiak, Stȩpień, Zofia +7
Mathematics · #05B99 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05B99

paper · pdf · doi:10.48550/arxiv.1406.6713

arxiv created 2015/09/01 · arxiv updated 2015/09/02

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× n discrete torus. In the situation when gcd(m,n) is a prime, we completely solve the problem.

Related

• The no-three-in-line problem on a torus
• No-three-in-line problem on a torus: periodicity
• On the general no-three-in-line problem
• No-Three-in-a-Θ: Variations on the No-Three-in-a-Line Problem
• Corner-free sets via the torus