We consider shifts of a set A⊆N by elements from another set B⊆N, and prove intersection properties according to the relative asymptotic size of A and B. A consequence of our main theorem is the following: If A={a_n} is such that a_n=o(n^(k/k−1)), then the k-recurrence set R_k(A)={x∣|A∩(A+x)|≥k} contains the distance sets of arbitrarily large finite sets.

### Intersections of shifted sets

#### Abstract

We consider shifts of a set A⊆N by elements from another set B⊆N, and prove intersection properties according to the relative asymptotic size of A and B. A consequence of our main theorem is the following: If A={a_n} is such that a_n=o(n^(k/k−1)), then the k-recurrence set R_k(A)={x∣|A∩(A+x)|≥k} contains the distance sets of arbitrarily large finite sets.
##### Scheda breve Scheda completa Scheda completa (DC)
2015
DI NASSO, Mauro
File in questo prodotto:
File
4861-13827-1-PB.pdf

accesso aperto

Tipologia: Versione finale editoriale
Licenza: Creative commons
Dimensione 283.9 kB
Utilizza questo identificativo per citare o creare un link a questo documento: `https://hdl.handle.net/11568/774911`
• ND
• 0
• 0