Diagrams and Essential Sets for Signed Permutations
Diagrams and Essential Sets for Signed Permutations
复制标题
有符号排列的图表和基本集
DOI：
--
复制
发表时间：
2016
影响因子：
0.7
通讯作者：
David Anderson
中科院分区：
文献类型：
--
作者：
David Anderson
我们介绍了图和基本集的签署置换，扩展了普通置换的类似概念。 特别是，我们表明，本质集提供了一个最小的列表的排名条件定义的舒伯特品种或退化轨迹对应于一个有符号的置换。 我们的本质集是在双射与偏序集理论的版本定义的雷纳，吴，和勇，从而给出了一个明确的，图形的方法来计算后者。
We introduce diagrams and essential sets for signed permutations, extending the analogous notions for ordinary permutations. In particular, we show that the essential set provides a minimal list of rank conditions defining the Schubert variety or degeneracy locus corresponding to a signed permutation. Our essential set is in bijection with the poset-theoretic version defined by Reiner, Woo, and Yong, and thus gives an explicit, diagrammatic method for computing the latter.