96 problems
For each integer , determine … where … In particular, determine the exact value of ; the supplied report claims , excluding…
For every integer , let . For every integer with , the number of pairs satisfying and…
Let and let be the Grassmann graph whose vertices are the -dimensional subspaces of . A function on the vertices is Boolean degree if it…
Let and satisfy , and let be the family of Boolean functions defined by … where , together with arbitrary Boolean functions…
Optimal-scale conjecture. For each there is an such that, for every monotone , there exists
Let and let be an integer. For , let denote its noise stability and let denote the influence of…
For , let be the collection of odd, transitive-symmetric functions . Let denote Fourier coefficients, and let…
Patterson–Wiedemann conjecture.
Let be a positive integer, let denote the transform set consisting of choices between the identity transform and the Hadamard transform , and let the cli…
Friedgut–Kahn–Kalai–Keller antipodal correlation conjecture. For every increasing , if is antipodal, then
Friedgut–Kahn–Kalai–Keller spectral correlation conjecture. For any increasing Boolean functions ,
Let with an even positive integer, let be a generator of , and for define on by…
Let with an even positive integer, let be the finite field of order , and for each define … where …
Kalai–Keller–Mossel correlation conjecture. For every increasing and balanced family , there exists an increasing linear-threshold family…
Let be Boolean-valued and let . Define … and let be the binary entropy function. Binary-entropy lower-bound…
Let , let be positive, and let be Boolean-valued. Write … and . Keller–Mossel–Schla…
Let be Boolean-valued, with spectral entropy … and total influence . Friedgut–Kalai's…
Let be non-negative integers with and . Let denote the first matching number associated with the paired construction for Boolean fu…
Minimum Fourier entropy–influence conjecture. There exists a constant such that, for every and every Boolean function ,
Let satisfy and . Let and be the functions defined in the paper. The explicit lower-bound conjecture. One…
For , define … with . The kappa inequalities. The following two assertions hold: for , ; and the functi…
Let , let be obtained by passing through a binary symmetric channel with crossover probability , and let…
The candidate function conjecture. The function belongs to the class . If true, this would establish the most-informative Boolean function conjecture for balanced func…
The Hellinger conjecture. Under these assumptions,
Let be uniformly distributed on the Boolean hypercube, and let be obtained by passing each bit of throug…