2 problems

Let $f:\{-1,1\}^n\to\{-1,1\}$ be a transitive-symmetric function, meaning that for every $1\leq i<j\leq n$ there is a permutation $\sigma$ of $[n]$ with $\sigma(i)=j$ such that…

Marginal-improvement conjecture. Removing the row-monomial restriction in this correlated-noise, channel-phase-information setting should improve the data-rate only marginally.