Name
Abstract | ||
|---|---|---|
We prove that if A subset of [N] does not contain any solution to the equation x(1) +...+x(k) = y(1) + ... +y(k) with distinct x(1), ... x(k), y(1), ..., y(k) is an element of A, then vertical bar A vertical bar <= 16k(3/2)N(1/k), provided N >=(2k(2))(2k). This problem was first considered by Ruzsa, and this upper bound improves the previously best known upper bound of (1/4 + o(k)(1))k(2)N(1/k) which was proved by Timmons. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1137/18M1189439 | SIAM JOURNAL ON DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
weak Sidon sets,sets,avoiding linear equations,combinatorial number theory | Journal | 33 |
Issue | ISSN | Citations |
2 | 0895-4801 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomasz Schoen | 1 | 36 | 12.04 |
| Ilya d. Shkredov | 2 | 10 | 1.32 |