Subsets of the grid with no isosceles triangles
How many points can be chosen from the n × n grid so that no three of them form an isosceles triangle, flat ones included?
Summary
Problem 59 of the AlphaEvolve repository of problems (Georgiev, Gómez-Serrano, Tao and Wagner, 2025). C(n) is the size of the largest subset of the n × n grid in which no three distinct points a, b, c have |a − b| = |b − c|. The source asks for upper and lower bounds on C(n) that are as strong as possible.
Source
Open, as listed by AlphaEvolve repository of problems, problem 59 · AlphaEvolve repository of problems. Checked 20 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.