The discrete Fourier transform is a widely used tool in the
analysis of Boolean functions. One can view the Fourier transform
of a Boolean function $f:\{0,1\}^n \to \{0,1\}$ as a distribution
over sets $S \subseteq [n]$. The Fourier-tail at level $k...