跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.40486 · v1

Average pairwise Hamming distance of a subset in a hypercube

首次提交 2026-10-30 01:15
版本更新 2026-10-30 01:15
雷达观测 2026-10-30 13:28
arXiv ↗PDF ↗

摘要

In this note, we prove that for a subset $\mathcal{F}$ of $\{0,1\}^n$ of density $\frac{1}{8}$, its average pairwise Hamming distance is at least $\frac{n-3}{2}$, with equality attained only by $(n-3)$-dimensional subcubes. This answers a question of Lei Yu, and solves an important open case of a more general question posed by Ahlswede and Katona in 1977.

AI 论文解读

基于摘要 · 非全文审阅

作者证明密度为1/8的{0,1}^n子集的平均成对汉明距离至少为(n-3)/2,且等号仅由(n-3)维子立方体达到。

正在读取账号与研究记录…

版本差异

目前只观测到一个版本,无法比较变化。之后收录新版本时,会在这里对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-10-30 01:15 · 最新观测版本

Average pairwise Hamming distance of a subset in a hypercube

In this note, we prove that for a subset $\mathcal{F}$ of $\{0,1\}^n$ of density $\frac{1}{8}$, its average pairwise Hamming distance is at least $\frac{n-3}{2}$, with equality attained only by $(n-3)$-dimensional subcubes. This answers a question of Lei Yu, and solves an important open case of a more general question posed by Ahlswede and Katona in 1977.

查看此版本解读 →查看此版本原文 ↗