On large subsets of $F_q^n$ with no three-term arithmetic progression · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1605.09223/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTOn large subsets of $F_q^n$ with no three-term arithmetic progression — mentioned by delhantyhttps://news.ycombinator.com/item?id=11811418urn:hackerpapers:mention:1605.09223:11811418Wed, 01 Jun 2016 00:57:00 GMT<p>Another good link concerned with this problem is from OEIS: https://oeis.org/A090245 &quot;Maximum numbers of cards that would have no SET in an n-attribute version of the SET card game&quot; The OEIS links appear to have been updated to reflect the recent breakthrough of Ellenberg and Gijswijt, including their unified paper arXiv:1605.09223 from May 30.</p><p><a href="https://hackerpaper.kaipfister.de/p/1605.09223/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.CO