English

New lower bounds for cardinalities of higher dimensional difference sets and sumsets

Combinatorics 2022-12-01 v2 Number Theory

Abstract

Let d4d \geq 4 be a natural number and let AA be a finite, non-empty subset of Rd\mathbb{R}^d such that AA is not contained in a translate of a hyperplane. In this setting, we show that AA(2d2+1d1)AOd(A1δ), |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg) |A| - O_{d}(|A|^{1- \delta}), for some absolute constant δ>0\delta>0 that only depends on dd. This provides a sharp main term, consequently answering questions of Ruzsa and Stanchescu up to an Od(A1δ)O_{d}(|A|^{1- \delta}) error term. We also prove new lower bounds for restricted type difference sets and asymmetric sumsets in Rd\mathbb{R}^d.

Keywords

Cite

@article{arxiv.2110.11300,
  title  = {New lower bounds for cardinalities of higher dimensional difference sets and sumsets},
  author = {Akshat Mudgal},
  journal= {arXiv preprint arXiv:2110.11300},
  year   = {2022}
}

Comments

19 pages