Indexed metadata

Dense Sets with Prescribed Difference Representation Functions

Wu-Xia Ma, Bing-Ling Wu

Source record

Source: arXiv

Published: Oct 20, 2026

arXiv: 2610.27786

Open original source ↗

Source abstract

For a set AA of positive integers, let dA(n)d_A(n) denote the number of representations of nn as a difference of two elements of AA. We prove that, if lim inf⁡n→∞f(n)≥2\liminf_{n\to\infty}f(n)\geq2, then for every Sidon set BB and every positive function ω(x)ω(x) tending to infinity there is a set A⊆NA\subseteq\N such that dA(n)=f(n)d_A(n)=f(n) for all n∈Nn\in\N and ∣A(x)−B(x/2)∣≤ω(x)|A(x)-B(x/2)|\leqω(x) for all x≥1x\geq1. We also give two extensions that allow f(n)=1f(n)=1 for infinitely many nn. For an infinite Sidon set BB, the same density scale B(x/2)B(x/2) is retained when ff is at least 22 on arbitrarily long intervals centered at elements of 2B2B. If {n:f(n)≥2}\{n:f(n)\geq2\} contains arbitrarily long intervals, the density scale B(x/3)B(x/3) is obtained for every Sidon set BB. The proofs use remote insertion of new representations together with controlled deletions from a Sidon core. As a quantitative consequence, Ruzsa's dense infinite Sidon sequence gives A(x)=x2−1+o(1)A(x)=x^{\sqrt2-1+o(1)} whenever {n:f(n)≥2}\{n:f(n)\geq2\} contains arbitrarily long intervals.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.