Suppose $X$ is a subset of $\{1, \cdots, n\}$ such that the equation $ax_i+bx_j=cx_k+dx_{\ell}$ where $a+b=c+d,$ $a,b,c,d \in \mathbb{N}$ and $x_i, x_j, x_k, x_{\ell} \in X,$ has only trivial solution. A solution is trivial if $x_i=x_j=x_{k}=x_{\ell}.$

What can we say about the size of $X?$ Is this possible that $|X|\geq n^{1-o(1)}$?

I think the answer is related to Sidon Sets, but I could not find any references. Any help is greatly appreciated.

  • are $a,b,c,d$ fixed? Else there are solutions like $a=c,b=d$, $x_i=x_k$, $x_j=x_l$. – Fedor Petrov Oct 7 at 19:53
  • also maybe you need the reverse inequality for $|X|$? – Fedor Petrov Oct 7 at 20:01
  • @FedorPetrov: No, I need a lower bound. – Kim Oct 7 at 20:02
  • Then "is it true" must be read as "is it possible"? And what is $\epsilon$? – Fedor Petrov Oct 7 at 20:07
  • what does it mean "$\epsilon$ is a positive constant depends on $n$?" – Fedor Petrov Oct 7 at 20:53
up vote 6 down vote accepted

Such $X$ do indeed exist, and are explicitly constructed in I.Z. Ruzsa, Solving a linear equation in a set of integers, Acta Arith., LXV.3 (1993), pp. 259-282, Theorem 7.5. The whole paper is devoted to upper and lower bounds on sizes of solution-free sets to equations such as the one you are asking about. A mathscinet forward search from that paper should yield further results.

  • 5
    specifically Theorem 7.5 in this paper seems to the answer original question – Fedor Petrov Oct 8 at 14:36
  • Thank you, Fedor! I knew that the answer was in there, but did not have time this morning to find the exact place. I have updated the answer. – Alex B. Oct 8 at 16:10
  • @AlexB : May I ask you a question about this paper? – Kim Oct 24 at 17:08
  • @Kim: you can just ask a separate question here on MO. I am unlikely to be of much help. It has been 13 years since I read that paper - I was a 2nd year undergraduate. – Alex B. Oct 24 at 21:03

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.