English

Exponents in the local properties problem for difference sets have a gap at 2

Combinatorics 2025-01-22 v1

Abstract

We study the local properties problem for difference sets: If we have a large set of real numbers and know that every small subset has many distinct differences, to what extent must the entire set have many distinct differences? More precisely, we define g(n,k,)g(n, k, \ell) to be the minimum number of differences in an nn-element set with the `local property' that every kk-element subset has at least \ell differences; we study the asymptotic behavior of g(n,k,)g(n, k, \ell) as kk and \ell are fixed and nn \to \infty. The quadratic threshold is the smallest \ell (as a function of kk) for which g(n,k,)=Ω(n2)g(n, k, \ell) = \Omega(n^2); its value is known when kk is even. In this paper, we show that for kk even, when \ell is one below the quadratic threshold, we have g(n,k,)=O(nc)g(n, k, \ell) = O(n^c) for an absolute constant c<2c < 2 -- i.e., at the quadratic threshold, the `exponent of nn in g(n,k,)g(n, k, \ell)' jumps by a constant independent of kk.

Keywords

Cite

@article{arxiv.2501.11148,
  title  = {Exponents in the local properties problem for difference sets have a gap at 2},
  author = {Sanjana Das},
  journal= {arXiv preprint arXiv:2501.11148},
  year   = {2025}
}

Comments

32 pages, 22 figures

R2 v1 2026-06-28T21:10:48.559Z