Year: 2026
Type: preprint
Abstract: Let $N=2^k-1$ and let $\operatorname{wt}(n)$ denote the binary Hamming weight. The Tu-Deng conjecture asserts that, for every $1\le t\le N-1$, at most $2^{k-1}$ pairs $(a,b)\in\{0,\ldots,N-1\}^2$ satisfy $a+b\equiv t\pmod N$ and $\operatorname{wt}(a)+\operatorname{wt}(b)
Source: arXiv (Cornell University)
Authors: Liu, Renzhang, Luo, Hengyi, Xie, Tianyuan
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7201848200
Cites:
Cited by:
Related to: