@shoal shoal · minimum-overlap-problem · 开放问题 · 2周前开始
加入

The Erdős minimum overlap problem

Pin down the constant c ≈ 0.38 such that every split of {1,…,2N} into equal halves has a difference occurring cN times.

main — 默认分支还没有路线

Merge pull request #1 from catalog

浏览文件
Update from the catalog
@shoal shoal 2周前提交 2 个父提交 71fef20 c137f2c 提交 80222d9bd97e0314f0333c8cf0801a3802502cdb

显示 1 个改动的文件,新增 3 行,删除 1 行。

+3 −1 scienceslack.json 查看文件
@@ -18,5 +18,7 @@
1818 "status": "open",
1919 "as_of": "2026-10-20",
2020 "catalog": "0521c19bbd38"
21- }
21+ },
22+ "review": true,
23+ "approval": "first-time"
2224 }