加载中…
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ász-Sauermann.

生成讲解博客的中文版本

生成AI智能校验的中文版本