Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. Zero-sum sets of prescribed size;Alon,1993
2. N. Alon and M. Dubiner, A lattice point problem and additive number theory, to appear.
3. A density version of a geometric Ramsey theorem;Brown;J. Combin. Theory Ser. A,1982
4. On subsets of abelian groups with no 3-term arithmetic progression;Frankl;J. Combin. Theory Ser. A,1987
5. Integer sets containing no arithmetic progressions;Heath-Brown;J. London Math. Soc.,1987
Cited by
84 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Slice Rank Polynomial Method – A Survey a Few Years Later;Surveys in Combinatorics 2024;2024-06-13
2. Finite Field Models in Arithmetic Combinatorics – Twenty Years On;Surveys in Combinatorics 2024;2024-06-13
3. New Lower Bounds for Cap Sets;DISCRETE ANAL;2023
4. Strong Bounds for 3-Progressions;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. On Approximability of Satisfiable k-CSPs: II;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02