Indexed metadata

Average pairwise Hamming distance of a subset in a hypercube

Yijia Fang, Hao Huang

Source record

Source: arXiv

Published: Oct 29, 2026

arXiv: 2610.40486

Open original source ↗

Source abstract

In this note, we prove that for a subset F\mathcal{F} of {0,1}n\{0,1\}^n of density 18\frac{1}{8}, its average pairwise Hamming distance is at least n−32\frac{n-3}{2}, with equality attained only by (n−3)(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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Average pairwise Hamming distance of a subset in a hypercube — Mathematical Frontier Network