加载中…
We prove that if a subset of (with an odd prime power) avoids a full-rank three-point pattern then it is exponentially small, having size at most where . This generalizes a theorem of Kovauc and complements results of Berger, Sah, Sawhney and Tidor. As a consequence, we prove that if is a square in then subsets of avoiding equilateral triangles are exponentially small.

生成讲解博客的中文版本

生成AI智能校验的中文版本