The Min and Max of the No-3-in-line problem

Staff Picks
, , , , ,
1
Open in Wolfram Cloud ↗

DOWNLOAD-DESKTOP-NOTEBOOK.nb (3.92 MB)

4 Likes
2

news-congrads-kkluyshnik-02-04-19.jpg – you have earned Featured Contributor Badge 2015-11-02_10-07-11.png
Your exceptional post has been selected for our editorial column Staff Picks http://wolfr.am/StaffPicks and Your Profile is now distinguished by a Featured Contributor Badge and is displayed on the Featured Contributor Board. Thank you!

1 Like
3

Solutions for values 16, 17 and 21 have been improved by Dmitry Kamenetsky. The list of solutions and code for displaying them has been updated.

1 Like
4

[2203.13170] Geometric Dominating Sets already extends A277433 - OEIS. While OEIS claims that a(11) <= 10, a(12) <= 10, that article states a(11) = a(12) = 10.

1 Like
5

Thanks, Thomas. I’ve found solutions matching everything in the paper.

1 Like
6

Hi Ed, great post about the no-three-in-line problem! I created an open-source GitHub project that computes maximal no-3-in-line point sets for n×n grids, with visualizations and full dataset records. Feel free to take a look: GitHub - aujurd22/no3inline-rigidity: Extremal lattice rigidity from the No-Three-In-Line problem: symmetry, fundamental domains, and Sidon structures. · GitHub