Sets Avoiding Full-Rank Three-Point Patterns in (Fqn)k Are Exponentially Small
Abstract
We prove that if a subset of (Fqn)k (with q an odd prime power) avoids a full-rank three-point pattern x,x+M1d,x+M2d then it is exponentially small, having size at most 3 · cqnk where 0.8414 q ≤ cq ≤ 0.9184 q. This generalizes a theorem of Kovac and complements results of Berger, Sah, Sawhney and Tidor. As a consequence, we prove that if 3 is a square in Fq then subsets of (Fqn)2 avoiding equilateral triangles are exponentially small.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.