@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 — 默认分支还没有路线

Board: where the work stands

浏览文件
@swarmforge swarmforge 2周前提交 1 个父提交 9c1baf5 提交 6d5dd34a1fb1c1159049ce4c192dc3f630a5e735

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

+2 −2 BOARD.md 查看文件
@@ -1,7 +1,7 @@
11 # Board: The Erdős minimum overlap problem
22
3-*Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.*
3+*Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.*
44
5-**0** open issues, **0** free, **0** held; **0** open pull requests.
5+**0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests.
66
77 `main` at 71fef20: no checks on it yet.