This paper is motivated by a link between algebraic proof<br />complexity and the representation theory of the finite symmetric<br />groups. Our perspective leads to a series of non-traditional<br />problems in the representation theory of Sn.<br />Most of our technical results concern the structure of "uniformly"<br />generated submodules of permutation modules. We consider<br />(for example) sequences Wn of submodules of the permutation<br />modules M(n−k;1k) and prove that if the modules Wn are<br />given in a uniform way - which we make precise - the dimension<br />p(n) of Wn (as a vector space) is a single polynomial with rational<br />coefficients, for all but finitely many "singular" values of n. Furthermore, we show that dim(Wn) < p(n) for each singular value of n >= 4k. The results have a non-traditional flavor arising from the study of the irreducible structure of the submodules Wn beyond isomorphism types. We sketch the link between our structure theorems and proof complexity questions, which can be viewed as special cases of the famous NP vs. co-NP problem in complexity theory. In particular, we focus on the efficiency of proof systems for showing membership in polynomial ideals, for example, based on Hilbert's Nullstellensatz.
Uniformly Generated Submodules of Permutation Modules