Exponents in the local properties problem for difference sets have a gap at 2
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, ) to be the minimum number of differences in an n-element set with the `local property' that every k-element subset has at least differences; we study the asymptotic behavior of g(n, k, ) as k and are fixed and n ∞. The quadratic threshold is the smallest (as a function of k) for which g(n, k, ) = (n2); its value is known when k is even. In this paper, we show that for k even, when is one below the quadratic threshold, we have g(n, k, ) = O(nc) for an absolute constant c < 2 -- i.e., at the quadratic threshold, the `exponent of n in g(n, k, )' jumps by a constant independent of k.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.