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 (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 Kova\u{c} 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.
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