Diagrams and essential sets for signed permutations

From MaRDI portal



Abstract: 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.


Representing a permutation in $S_n$ as a matrix of dots in an $n\times n$ array of boxes, its Rothe diagram is the subset of boxes that remain after striking out the boxes (weakly) south or east of each dot. The boxes of the diagram correspond naturally to the inversions of the permutation, so the number of them is equal to the length of the permutation. In fact, the diagram is a convenient way of encoding a great deal of information about a permutation. \par In this article the author develops an analogous tool for signed permutations. Also he introduces essential sets for signed permutations analogous to ordinary permutations. In particular, he shows that the essential set provides a minimal list of rank conditions defining the Schubert variety or degeneracy locus corresponding to a signed permutation. Finally he gives an explicit, diagrammatic method for computing.











This page was built for publication: Diagrams and essential sets for signed permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671672)