Intersections of shifted sets

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

\(k\)-recurrence sets asymptotic density delta-sets

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Density, gaps, topology (11B05) Recurrences (11B37)

Abstract: We consider shifts of a set

A s u b s e t e q m a t h b b N

by elements from another set

B s u b s e t e q m a t h b 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 m i d | A c a p (A + x) | g e k

contains the distance sets of arbitrarily large finite sets.

Review text

Summary: We consider shifts of a set \(A\subseteq\mathbb{N}\) by elements from~another set \(B\subseteq\mathbb{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\mid |A\cap(A+x)|\geq k\}\)~contains the distance sets~ of arbitrarily large finite sets.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Intersections of shifted sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344827)