On the Fourier tails of bounded functions over the discrete cube

In this paper we consider bounded real-valued functions over the discrete cube, f: {−1, 1}ⁿ → [−1, 1]. Such functions arise naturally in theoretical computer science, combinatorics, and the theory of social choice. It is often interesting to understand when these functions essentially depend on few coordinates.