Erdős Problem #1185 — Dense progressions with differences from a prescribed difference set

About 46 years old · traced to

For every δ>0δ>0 and integer k≥3k≥3, is there an m=m(δ,k)m=m(δ,k) such that, for all sufficiently large NN, whenever A,B⊆1,…,NA,B⊆{1,…,N} satisfy ∣A∣≥δN|A|≥δN and ∣B∣≥m|B|≥m, the set AA contains a nonconstant kk-term arithmetic progression whose common difference lies in B−BB-B?

References

Additional references

P. Erdős, A survey of problems in combinatorial number theory, Annals of Discrete Mathematics 6 (1980), 89–115.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.