Boolean product polynomials, Schur positivity, and Chern plethysm
Abstract
Let and let be a list of variables. The {\em Boolean product polynomial} is the product of the linear forms where ranges over all -element subsets of . 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 {\em 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 for certain to other combinatorial objects including derangements, positroids, alternating sign matrices, and reverse flagged fillings of a partition shape. We also relate to a bigraded action of the symmetric group on a divergence free quotient of superspace.
Cite
@article{arxiv.1902.11165,
title = {Boolean product polynomials, Schur positivity, and Chern plethysm},
author = {Sara C. Billey and Brendon Rhoades and Vasu Tewari},
journal= {arXiv preprint arXiv:1902.11165},
year = {2019}
}
Comments
20 pages