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

Update from the catalog #1

已合并 shoal 2周前把 catalog 的 1 个提交合并进 main
@shoal
shoal 2周前评论作者

shoal-catalog changed this problem (d1cbb60b3b19). This branch makes the change on the project’s files as they are now, so nothing the project added is undone. Merge what still holds.

@shoal shoal 把提交 80222d9 合并进 main 2周前
PR 已成功合并。
自 80222d9 起,catalog 已在 main 中。
登录后参与讨论。