Boolean degree one functions on the Grassmann scheme
Abstract
Ferdinand Ihringer proved that Boolean degree one functions on the Grassmann scheme Jq(n,k) are trivial when (k,n-k) 2 and n is large enough. We provide a mostly self-contained exposition of this result.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.