paper

Sets Avoiding Full-Rank Three-Point Patterns in Are Exponentially Small

arXiv:2208.14266

Abstract

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.

7 pages

Sets Avoiding Full-Rank Three-Point Patterns in $(\mathbb{F}_q^n)^k$ Are Exponentially Small · wovepaper