From 83f5f6f7440030323702a4d61ae443bfe21a0208 Mon Sep 17 00:00:00 2001 From: Taksh Date: Sun, 6 Sep 2026 21:44:54 +0530 Subject: [PATCH] =?UTF-8?q?Credit=20Beigel=E2=80=93Gasarch=20for=20the=202?= =?UTF-8?q?05/12=20Furstenberg=E2=80=93S=C3=A1rk=C3=B6zy=20construction.?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit The recorded exponent 1/2(1+log 12 / log 205) is Theorem 3.7 of arXiv:0804.4892 (2008), with an explicit 12-element residue class modulo 205. Lewko 2015 publishes the same exponent independently and should not be the sole citation. --- README.md | 1 + constants/4b.md | 4 ++-- 2 files changed, 3 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index c2c630fc..a07cc92d 100644 --- a/README.md +++ b/README.md @@ -158,6 +158,7 @@ Bounds for which the level of available verification is currently at minimal lev - [15a](https://teorth.github.io/optimizationproblems/constants/15a.html) **improved upper bound:** $C_{15a} \leq 2.371177$ by [E. Dupont, M. Eisenberger, B. Kozlovskii, A. Mehrabian, F. J. R. Ruiz, A. See, R. Zhou, J. Alman, V. Vassilevska Williams, M. Balog](https://arxiv.org/abs/2608.16884), 17 Aug 2026. - [43](https://teorth.github.io/optimizationproblems/constants/43a.html) **improved lower bound (unverified):** $C_{43} \geq 0.860*$ (exact $43/50$; certificate-layer result conditional on the lemma set of [KHSHGW2026](https://arxiv.org/abs/2601.22365)) by [J. Savva](https://doi.org/10.5281/zenodo.22223485), 1 Sep 2026. - [88a](https://teorth.github.io/optimizationproblems/constants/88a.html) **improved upper bound:** $C_{88a} \leq 186$ via $\mathrm{DHL}[40,2]$, by [OpenAI](https://cdn.openai.com/pdf/51126fac-1b68-4128-9666-c908bcc16033/short_gaps.pdf), 30 Aug 2026, with a Lean 4 formalization conditional on three declared axioms. +- [4b](https://teorth.github.io/optimizationproblems/constants/4b.html) **attribution correction:** the $205/12$ lower bound $C_{4b}\ge 0.733412$ is due to [R. Beigel and W. Gasarch](https://arxiv.org/abs/0804.4892), 2008; the same exponent was later published independently by [M. Lewko](https://doi.org/10.37236/4656), 2015. ## Maintainers diff --git a/constants/4b.md b/constants/4b.md index 8361394f..b450f4a0 100644 --- a/constants/4b.md +++ b/constants/4b.md @@ -16,7 +16,7 @@ Let $r(N)$ be the maximum size of a subset $A\subset\\{1,\dots,N\\}$ with no non | ----- | --------- | -------- | | $\tfrac12$ | Trivial / folklore (see [BG2008]) | Can use an arithmetic progression of spacing $p \asymp \sqrt{N}$ | | $\frac12\!\left(1+\frac{\log 7}{\log 65}\right)\approx 0.733077$ | [Ruz1984] | Base-expansion construction | -| $\frac12\!\left(1+\frac{\log 12}{\log 205}\right)\approx 0.733412$ | [Lew2015] | Improves modulus and residue set in base expansion | +| $\frac12\!\left(1+\frac{\log 12}{\log 205}\right)\approx 0.733412$ | [BG2008] | Base-expansion with modulus $205$ and residue set $S=\{0,2,8,14,77,79,85,96,103,109,111,181\}$ (Theorem 3.7). The same exponent was published independently in [Lew2015] | ## Additional comments and links @@ -41,4 +41,4 @@ Let $r(N)$ be the maximum size of a subset $A\subset\\{1,\dots,N\\}$ with no non ## Contribution notes -ChatGPT 5.2 Pro was used to prepare an initial version of this page. \ No newline at end of file +ChatGPT 5.2 Pro was used to prepare an initial version of this page. The $205/12$ row was reattributed after checking arXiv:0804.4892 Theorem 3.7 against the Lewko 2015 EJC abstract, which records the same exponent. \ No newline at end of file