Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

library/additive_combinatorics/steinerberger_2022_remarks_erdos_distinct_subset_sums_problem

Full paper in Markdown.


Stefan Steinerberger, Some Remarks on the Erdős Distinct Subset Sums Problem. arXiv:2208.12182 (2022).

Reading basis. The statements and mechanisms below were checked against the full paper in Markdown. No claim of proof verification is made.

Exact analytic characterization

For positive reals a1,…,aka_1,\ldots,a_k, put

I(a1,…,ak)=∫R(sin⁡2πx2πx)2∏i=1kcos⁡2(2πaix) dx.I(a_1,\ldots,a_k)= \int_{\mathbb R}\left(\frac{\sin 2\pi x}{2\pi x}\right)^2 \prod_{i=1}^k\cos^2(2\pi a_i x)\,dx.

Theorem 1 in §2.1 states

I(a1,…,ak)≥2−k−1,I(a_1,\ldots,a_k)\geq 2^{-k-1},

with equality if and only if the 2k2^k subset sums are pairwise at distance at least 11. The exact equality mechanism is in §3.1, from the opening paragraph through the display ending in 2−k−12^{-k-1}: for the signed-sum law μ\mu and h=121[−1,1]h=\frac12\mathbf 1_{[-1,1]}, the density h∗μh*\mu is a sum of 2k2^k translated interval indicators. Its squared L2L^2 norm is at least the sum of the diagonal terms, and equality holds exactly when those intervals do not overlap. Their centres are then 22-separated, which is equivalent to the original subset sums being 11-separated. The remainder of §3.1 identifies this norm with the Fourier integral above by Plancherel and μ^(x)=∏icos⁡(2πaix)\widehat\mu(x)=\prod_i\cos(2\pi a_i x).

For positive integers, Corollary 1 in §2.1, proved in §3.2, gives the periodic form

∫01∏i=1kcos⁡2(2πaix) dx≥2−k,\int_0^1\prod_{i=1}^k\cos^2(2\pi a_i x)\,dx\geq 2^{-k},

again with equality exactly when all subset sums are distinct. Thus the equality condition is not merely a consequence attached to an estimate: it is an exact Fourier-analytic test for dissociation after the relevant separation normalization.

Signed sums and the near-Gaussian mechanism

Order the steps so that ak=max⁡iaia_k=\max_i a_i. Let X=∑i=1kεiaiX=\sum_{i=1}^k\varepsilon_i a_i, with independent uniform signs, let μ\mu be its law, and write σ2=∑iai2\sigma^2=\sum_i a_i^2. Distinct integer subset sums make the 2k2^k values of XX distinct and 22-separated. Consequently h∗μh*\mu takes only the values 00 and 2−k−12^{-k-1}, the latter on 2k2^k disjoint intervals of length 22, while the matching Gaussian has density

γ(x)=12πσexp⁡(−x22σ2).\gamma(x)=\frac{1}{\sqrt{2\pi}\sigma} \exp\left(-\frac{x^2}{2\sigma^2}\right).

Theorem 2 in §2.3 says that, if ak2≤ck−1/2σ2a_k^2\leq c k^{-1/2}\sigma^2, then

∫R(h∗μ−γ)2=∫∣x∣≥1/(4ak)(sin⁡2πx2πx)2∏i=1kcos⁡2(2πaix) dx+o(2−k).\int_{\mathbb R}(h*\mu-\gamma)^2 =\int_{|x|\geq 1/(4a_k)} \left(\frac{\sin 2\pi x}{2\pi x}\right)^2 \prod_{i=1}^k\cos^2(2\pi a_i x)\,dx+o(2^{-k}).

The local Fourier comparison behind this identity is Lemma 3 in §3.4; §3.5 then removes the negligible Gaussian tail. Under the stronger hypothesis ak2≤ck−2/3−εσ2a_k^2\leq c k^{-2/3-\varepsilon}\sigma^2, §3.6 uses Berry--Esseen convergence on intervals. The two-level density h∗μh*\mu must then imitate the local mass of γ\gamma, forcing the quantitative L2L^2 discrepancy recorded by the proposition in §3.6:

∫R(h∗μ−γ)2 dx≥(1+o(1))2−12π σ.\int_{\mathbb R}(h*\mu-\gamma)^2\,dx \geq (1+o(1))\frac{\sqrt2-1}{2\sqrt\pi\,\sigma}.

Combining that discrepancy with the exact integral gives Corollary 2:

ak≥(1−o(1))2π2kk.a_k\geq (1-o(1))\sqrt{\frac{2}{\pi}}\frac{2^k}{\sqrt{k}}.

What this supplies for Problem 963

Apply Corollary 2 to a dissociated kk-element subset B⊆{1,…,N}B\subseteq\{1,\ldots,N\}. Its largest element is at most NN, so

N≥(1−o(1))2π2kk.N\geq (1-o(1))\sqrt{\frac{2}{\pi}}\frac{2^k}{\sqrt{k}}.

After inversion, every such BB satisfies

k≤log⁡2N+12log⁡2log⁡2N+12log⁡2 ⁣(π2)+o(1).k\leq \log_2N+\frac12\log_2\log_2N +\frac12\log_2\!\left(\frac{\pi}{2}\right)+o(1).

Together with the powers-of-two construction, this places the largest dissociated subset of the initial interval between ⌊log⁡2N⌋+1\lfloor\log_2N\rfloor+1 and log⁡2N+12log⁡2log⁡2N+O(1)\log_2N+\frac12\log_2\log_2N+O(1). In the minimization defining E0963, the initial interval is therefore one admissible competitor and yields an upper benchmark for f(N)f(N).

It does not give the requested lower bound for every NN-element real set. Cardinality alone puts no bound on the magnitudes or span of an arbitrary ambient set, so the inequality for the largest member of a chosen dissociated subset cannot be converted into a bound depending only on ∣A∣|A|. Translation also does not preserve dissociation when the compared subsets have different cardinalities. Most importantly, nothing in the paper proves that an initial interval minimizes the largest dissociated-subset size among all ambient sets. The paper therefore controls interval competitors, not the worst arbitrary ambient set quantified over in E0963.

Source: https://arxiv.org/abs/2208.12182.