English

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

Combinatorics 2022-08-31 v1

Abstract

We prove that if a subset of (Fqn)k(\mathbb{F}_q^n)^k (with qq an odd prime power) avoids a full-rank three-point pattern x,x+M1d,x+M2d\vec{x},\vec{x}+M_1\vec{d},\vec{x}+M_2\vec{d} then it is exponentially small, having size at most 3cqnk3 \cdot c_q^{nk} where 0.8414qcq0.9184q0.8414 q \leq c_q \leq 0.9184 q. This generalizes a theorem of Kova\u{c} and complements results of Berger, Sah, Sawhney and Tidor. As a consequence, we prove that if 33 is a square in Fq\mathbb{F}_q then subsets of (Fqn)2(\mathbb{F}_q^n)^2 avoiding equilateral triangles are exponentially small.

Keywords

Cite

@article{arxiv.2208.14266,
  title  = {Sets Avoiding Full-Rank Three-Point Patterns in $(\mathbb{F}_q^n)^k$ Are Exponentially Small},
  author = {Mohamed Omar},
  journal= {arXiv preprint arXiv:2208.14266},
  year   = {2022}
}

Comments

7 pages

R2 v1 2026-06-28T00:24:23.916Z