English

Roth-type theorems in $K_{s,t}$-free sets

Combinatorics 2026-01-27 v1 Number Theory

Abstract

We show that for all integers 2st2\le s\le t, any Ks,tK_{s,t}-free subset of [N][N] with size Ω(n11/s)\Omega(n^{1-1/s}) 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 Ks,tK_{s,t}-free sets. We also study the corresponding problem in vector spaces over finite fields. In Fqn\mathbb F_q^n 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.

Keywords

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

R2 v1 2026-07-01T09:20:50.183Z