A lower bound for the k‐multicolored sum‐free problem in Zmn-Reference-Cited by-同舟云学术

A lower bound for the k‐multicolored sum‐free problem in Zmn

Published:2018-12-16 Issue:1 Volume:119 Page:55-103
ISSN:0024-6115
Container-title:Proceedings of the London Mathematical Society
language:en
Short-container-title:Proc. London Math. Soc.

Author:

Lovász László Miklós¹,Sauermann Lisa²

Affiliation:

1. Department of Mathematics Massachusetts Institute of Technology Headquarters Office Simons Building (Building 2) Room 106, 77 Massachusetts Avenue Cambridge MA 02139‐4307 USA

2. Department of Mathematics Stanford University 450 Serra Mall, Building 380 Stanford CA 94305‐2125 USA

Funder

National Science Foundation

Publisher

Wiley

Subject

General Mathematics

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1112/plms.12223

Reference35 articles.

1. N.Alon ‘Testing subgraphs in large graphs’ 42nd IEEE Symposium on Foundations of Computer Science (IEEE Computer Society Los Alamitos CA 2001)434–441.

2. On sunflowers and matrix multiplication

3. On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

4. M.Bennett ‘Bounds on sizes of caps inAG(n q)via the croot‐lev‐pach polynomial method’ Preprint 2018 arXiv:1806.05303.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Removal lemmas and approximate homomorphisms;Combinatorics, Probability and Computing;2022-01-24

2. On the size of subsets of $$\mathbb{F}_p^n$$ without p distinct elements summing to zero;Israel Journal of Mathematics;2021-05-07

3. The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings;The Electronic Journal of Combinatorics;2020-07-24

4. On subsets of the hypercube with prescribed Hamming distances;Journal of Combinatorial Theory, Series A;2020-04

5. New applications of the polynomial method: The cap set conjecture and beyond;Bulletin of the American Mathematical Society;2018-10-01