Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 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

The Haight-Ruzsa method for sets with more differences than multiple sums (1604.03015v1)

Published 11 Apr 2016 in math.NT

Abstract: Let $h$ be a positive integer and let $\varepsilon > 0$. The Haight-Ruzsa method produces a positive integer $m*$ and a subset $A$ of the additive abelian group $\mathbf{Z}/m*\mathbf{Z}$ such that the difference set is large in the sense that $A-A = \mathbf{Z}/m*\mathbf{Z}$ and $h$-fold sumset is small in the sense that $|hA| < \varepsilon m*$. This note describes, and in a modest way extends, the Haight-Ruzsa argument, and constructs sets with more differences than multiple sums in other additive abelian groups.

Summary

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