On finite difference sets
Let \(A\) denote a finite subset of \({\mathbb{R}}^n\). The difference set of \(A\) is given by \(A-A=\{a-b:a,b\in A\}\). The affine dimension of \(A\), denoted by \(d=\dim A\), is defined as the dimension of the smallest affine subspace containing \(A\). \textit{G. A. Freiman}, \textit{A. Heppes}, and \textit{B. Uhrin} derived the general lower bound \(| A-A|\geq(d+1)| A| +{1\over 2}d(d+1)\) which is sharp for \(d=1,2\) [Proc. Conf. Number Theory, Budapest 1987, Colloq. Math. Soc. János Bolyai 51, 125-139 (1990; Zbl 0707.11011)]. They also conjectured that \(\dim A=3\) implies \(| A-A|\geq 4.5| A|-9\). In the paper under review, this estimate is proved, and it is also shown that it is best possible. Moreover, the precise structure of those finite sets \(A\) with difference set of lowest power is described: If \(\dim A=2\), then \(A=P+\{0,v\}\) where \(P\) denotes an arithmetic progression with difference \(\delta\) and \(\{\delta,v\}\) is linearly independent. If \(\dim A=3\), then \(A=P+\{0,v\}+\{0,w\}\) where the set \(\{\delta,v,w\}\) is linearly independent.
- A Brunn-Minkowski inequality for the integer lattice
- A generalization of the discrete version of Minkowski's fundamental theorem
- scientific article; zbMATH DE number 4160820 (Why is no real title available?)
- Projecting Difference Sets on the Positive Orthant
- Difference sets in higher dimensions
- On theorems of Wirsing and Sanders
- An upper bound for d-dimensional difference sets
- Estimating the cardinality of a difference subset of the discrete multi-torus \(\mathbb Z_3^n\)
- Difference sets in \(\mathbb{R}^d\)
This page was built for publication: On finite difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271964)
