PapersIhringer showed that every Boolean degree one function on the Grassmann scheme $J_q(n,k)$ is trivial whenever $\min(k,n-k) \ge 2$ and $n$ is large enough.
We give an exposition of his proof that is more self-contained.
Ihringer’s proof combines a Ramsey-theoretic argument with an inductive argument due to Filmus–Ihringer. We replace the latter part with a direct argument based on restriction.
copy to clipboard
