Roth-type theorems in $K_{s,t}$-free sets
Combinatorics
2026-01-27 v1 Number Theory
Abstract
We show that for all integers , any -free subset of with size must contain a nontrivial solution to every fixed translation-invariant linear equation in at least five variables. This extends earlier results for Sidon sets due to Conlon-Fox-Sudakov-Zhao and Prendiville to the full family of -free sets. We also study the corresponding problem in vector spaces over finite fields. In we obtain stronger quantitative bounds, including polylogarithmic savings, by combining Fourier-analytic transference with polynomial-method input from the arithmetic cycle-removal lemma of Fox-Lov\'asz-Sauermann.
Cite
@article{arxiv.2601.18738,
title = {Roth-type theorems in $K_{s,t}$-free sets},
author = {Yifan Jing and Cosmin Pohoata and Max Wenqiang Xu},
journal= {arXiv preprint arXiv:2601.18738},
year = {2026}
}
Comments
18 pages