We prove two results concerning solvability of a linear equation in sets of integers. In particular, it is shown that for every k∊ℕ, there is a noninvariant linear equation in k variables such that if A⫅{1,…,N} has no solution to the equation then , for some absolute constant c>0, provided that N is large enough.
[1] Chang, M.-C. 2002 Polynomial bounds in Freiman's theorem Duke Math. J. 113 399–419 .
[2] Roth, K. F. 1953 On certain sets of integers J. London Math. Soc. 28 104–109 .
[3] Ruzsa, I. Z. 1993 Solving linear equations in sets of integers. I Acta Arith. 65 259–282.
[4] Ruzsa, I. Z. 1995 Solving linear equations in sets of integers. II Acta Arith. 72 385–397.
[5] Schoen, T. 2005 Linear equations in ℤp Bull. London Math. Soc. 37 495–501 .
[6] Szemerédi, E. 1975 On sets of integers containing no k elements in arithmetic progression Acta Arth. 27 199–245.