2000 character limit reached
Density of integral sets with missing differences (1212.0209v2)
Published 2 Dec 2012 in math.NT and math.CO
Abstract: Motzkin posed the problem of finding the maximal density $\mu(M)$ of sets of integers in which the differences given by a set $M$ do not occur. The problem is already settled when $|M|\leq 2$ and $M$ is a finite arithmetic progression. In this paper, we determine $\mu(M)$ when $M$ has some other structure. For example, we determine $\mu(M)$ when $M$ is a finite geometric progression.