Boolean product polynomials, Schur positivity, and Chern plethysm
Abstract
Let 1≤ k ≤ n and let Xn = (x1, …, xn) be a list of n variables. The Boolean product polynomial Bn,k(Xn) is the product of the linear forms Σi ∈ S xi where S ranges over all k-element subsets of \1, 2, …, n\. We prove that Boolean product polynomials are Schur positive. We do this via a new method of proving Schur positivity using vector bundles and a symmetric function operation we call Chern plethysm. This gives a geometric method for producing a vast array of Schur positive polynomials whose Schur positivity lacks (at present) a combinatorial or representation theoretic proof. We relate the polynomials Bn,k(Xn) for certain k to other combinatorial objects including derangements, positroids, alternating sign matrices, and reverse flagged fillings of a partition shape. We also relate Bn,n-1(Xn) to a bigraded action of the symmetric group Sn on a divergence free quotient of superspace.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.