2010/05/12 by Masato Kobayashi · 1 citation
Biochemistry, Genetics and Molecular Biology · Mathematics · #Advanced Combinatorial Mathematics #Finite Group Theory Research #Genome Rearrangement Algorithms #math.CO #math.GR #msc:Primary--20F55 #msc:Secondary--20B30
paper · pdf · doi:10.1007/s11083-010-9157-1
published as Order (Published online on May 13, 2010) · 7 pages.
openalex publication_date 2010/05/12 · arxiv created 2010/05/18 · arxiv updated 2010/05/20 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/29
In theory of Coxeter groups, bigrassmannian elements are well known as elements which have precisely one left descent and precisely one right descent. In this article, we prove formulas on enumeration of bigrassmannian permutations weakly below a permutation in Bruhat order in the symmetric groups. For the proof, we use equivalent characterizations of bigrassmannian permutations by Lascoux-Schutzenberger and Reading.