We provide an upper bound of the size of a subset A of F_p^n that does not admit a k-star of 3-APs (three-term arithmetic progressions). Namely, the subset A is assumed to contain no configuration of k 3-APs, sharing the middle term, such that all 2k+1 terms are distinct. In the proof, we adapt a new method in the recent work of Sauermann.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。