Real Analysis in Computer Science: A collection of Open Problems
Yuval Filmus, Hamed Hatami, Steven Heilman, Elchanan Mossel, Sushant Sachdeva, Andrew Wan, Karl Wimmer · 2014
We list a collection of open problems in real analysis in computer science, which complements, updates and extends a previous list curated by Ryan O’Donnell (2012). The object of study in these problems are boolean functions f :f0; 1g n !f0; 1g, and their analytic and combinatorial properties. Many of the questions originate from in theoretical computer science or the theory of voting. The formulation of many of the questions has a strong combinatorial and analytical avor including the use of the discrete Fourier expansion.