A representation-theoretic computation of the rank of 1-intersection incidence matrices: 2-subsets vs. n-subsets
Abstract
Let Wk,ni(m) denote a matrix with rows and columns indexed by the k-subsets and n-subsets, respectively, of an m-element set. The row S, column T entry of Wk,ni(m) is 1 if |S T| = i, and is 0 otherwise. We compute the rank of the matrix W2,n1(m) over any field by making use of the representation theory of the symmetric group. We also give a simple condition under which Wk,ni(m) has large p-rank.
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.