Search arXiv⌕ Search

arXiv · 2501.11148

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, \ell)$ to be the minimum number of differences in an $n$-element set with the `local property' that every $k$-element subset has at least $\ell$ differences; we study the asymptotic behavior of $g(n, k, \ell)$ as $k$ and $\ell$ are fixed and $n \to \infty$. The quadratic threshold is the smallest $\ell$ (as a function of $k$) for which $g(n, k, \ell) = Ω(n^2)$; its value is known when $k$ is even. In this paper, we show that for $k$ even, when $\ell$ is one below the quadratic threshold, we have $g(n, k, \ell) = O(n^c)$ for an absolute constant $c < 2$ -- i.e., at the quadratic threshold, the `exponent of $n$ in $g(n, k, \ell)$' jumps by a constant independent of $k$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sanjana Das. 2025-01-19. Exponents in the local properties problem for difference sets have a gap at 2. https://arxiv.org/abs/2501.11148

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗