Diagrams and essential sets for signed permutations (Q1671672)

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.