Enumeration of bigrassmannian permutations below a permutation in Bruhat order

DOI10.1007/s11083-010-9157-1zbMath1211.05008arXiv1005.3335OpenAlexW3103890535MaRDI QIDQ633226

Masato Kobayashi

Publication date: 31 March 2011

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.3335

zbMATH Keywords

symmetric groupsCoxeter groupsenumerationBruhat orderbigrassmannian permutation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Symmetric groups (20B30)

Related Items (6)

A directed graph structure of alternating sign matrices ⋮ Weighted counting of inversions on alternating sign matrices ⋮ Convex \((0, 1)\)-matrices and their epitopes ⋮ Bigrassmannian permutations and Verma modules ⋮ On comparability of bigrassmannian permutations ⋮ Matrix representation of meet-irreducible discrete copulas

Cites Work

• Sum of lengths of inversions in permutations
• Bases for the Bruhat-Chevalley order on all finite Coxeter groups
• An improved tableau criterion for Bruhat order
• Order dimension, strong Bruhat order and lattice properties for posets

This page was built for publication: Enumeration of bigrassmannian permutations below a permutation in Bruhat order