A generalization of a theorem of Erdos-R\'enyi to m-fold sums and differences
Abstract
Let m≥ 2 be a positive integer. Given a set E(ω )⊂eq N we define rN(m)(ω ) to be the number of ways to represent N∈ Z as any combination of sums and differences of m distinct elements of E(ω ). In this paper, we prove the existence of a "thick" set E(ω ) and a positive constant K such that rN(m)(ω )<K for all N∈ Z. This is a generalization of a known theorem by Erdos and R\'enyi. We also apply our results to harmonic analysis, where we prove the existence of certain thin sets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.