Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A generalization of a theorem of Erdős-Rényi to $m$-fold sums and differences (1404.2648v2)

Published 9 Apr 2014 in math.NT

Abstract: Let $m\geq 2$ be a positive integer. Given a set $E(\omega )\subseteq \mathbb{N}$ we define $r_{N}{(m)}(\omega )$ to be the number of ways to represent $N\in \mathbb{Z}$ as any combination of sums $\textit{ and }$ differences of $m$ distinct elements of $E(\omega )$. In this paper, we prove the existence of a "thick" set $E(\omega )$ and a positive constant $K$ such that $r_{N}{(m)}(\omega )<K$ for all $N\in \mathbb{Z}$. This is a generalization of a known theorem by Erd\H{o}s and R\'enyi. We also apply our results to harmonic analysis, where we prove the existence of certain thin sets.

Summary

We haven't generated a summary for this paper yet.