Bijection between bigrassmannian permutations maximal below a permutation and its essential set
Summary: Bigrassmannian permutations are known as permutations which have precisely one left descent and one right descent. They play an important role in the study of Bruhat order. Fulton introduced the essential set of a permutation and studied its combinatorics. As a consequence of his work, it turns out that the essential set of bigrassmannian permutations consists of precisely one element. In this article, we generalize this observation for essential sets of arbitrary permutations. Our main theorem says that there exists a bijection between bigrassmanian permutations maximal below a permutation and its essential set. For the proof, we make use of two equivalent characterizations of bigrassmannian permutations by Lascoux-Schützenberger and Reading.
- Diagrams and essential sets for signed permutations
- The Prism tableau model for Schubert polynomials
- Convex \((0, 1)\)-matrices and their epitopes
- Bigrassmannian permutations and Verma modules
- On comparability of bigrassmannian permutations
- The size of Fulton's essential set
- A Bruhat atlas for the Mehta-van der Kallen stratification of T^ GL_n/B
This page was built for publication: Bijection between bigrassmannian permutations maximal below a permutation and its essential set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976681)
