Courtade Kumar Conjecture Solved? Two AI-Assisted Proofs End a 13-Year Wait
A one-bit summary can combine thousands of inputs, compute parity, take a threshold, or apply some elaborate Boolean rule. The Courtade Kumar conjecture says that for preserving information about a noisy copy of the input, this cleverness buys you nothing. The best one-bit summary is simply one original bit. Mathematically, let Xbe uniform on {-ⓜ,11}^n, … Read more