Moonflowers and efficient code sparsification

Shachar Lovett, Raghu Meka, Yimeng Wang

We introduce \emph{moonflowers}, a weaker analogue of sunflowers. A family of sets $S_1,\dots ,S_k$ is a $k$-moonflower if each set $S_i$ contains at least one element that is abse…