Search arXivSearch

arXiv · 2310.13999

Bounds for the local properties problem for difference sets

Abstract

We consider the local properties problem for difference sets: we define $g(n, k, \ell)$ to be the minimum value of $\lvert A - A\rvert$ over all $n$-element sets $A \subseteq \mathbb{R}$ with the `local property' that $\lvert A' - A'\rvert \geq \ell$ for all $k$-element subsets $A' \subseteq A$. We view $k$ and $\ell$ as fixed, and study the asymptotic behavior of $g(n, k, \ell)$ as $n \to \infty$. One of our main results concerns the quadratic threshold, i.e., the minimum value of $\ell$ such that $g(n, k, \ell) = Ω(n^2)$; we determine this value exactly for even $k$, and we determine it up to an additive constant for odd $k$. We also show that for all $1 < c \leq 2$, the `threshold' for $g(n, k, \ell) = Ω(n^c)$ is quadratic in $k$; conversely, for $\ell$ quadratic in $k$, we obtain upper and lower bounds of the form $n^c$ for (not necessarily equal) constants $c > 1$. In particular, this provides the first nontrivial upper bounds in the regime where $\ell$ is quadratic in $k$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sanjana Das. 2025-09-02. Bounds for the local properties problem for difference sets. https://arxiv.org/abs/2310.13999

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO