Boolean product polynomials and Schur-positivity

arXiv: Combinatorics(2018)

引用 23|浏览22
暂无评分
摘要
We study a family of symmetric polynomials that we refer to as the Boolean product polynomials. The motivation for studying these polynomials stems from the computation of the characteristic polynomial of the real matroid spanned by the nonzero vectors in $mathbb{R}^n$ all of whose coordinates are either $0$ or $1$. To this end, one approach is to compute the zeros of the Boolean product polynomials over finite fields. The zero loci of these polynomials cut out hyperplane arrangements known as resonance arrangements, which show up in the context of double Hurwitz polynomials. By relating the Boolean product polynomials to certain total Chern classes of vector bundles, we establish their Schur-positivity by appealing to a result of Pragacz relying on earlier work on numerical positivity by Fulton-Lazarsfeld. Subsequently, we study a two-alphabet version of these polynomials from the viewpoint of Schur-positivity. As a special case of these polynomials, we recover symmetric functions first studied by Du0027esarmu0027enien and Wachs in the context of descents in derangements.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要