caa a22 4500 445813652 CHVBK 20180317145219.0 cr unu---uuuuu 170323e20110301xx s 000 0 eng 10.1007/s11083-010-9157-1 doi (NATIONALLICENCE)springer-10.1007/s11083-010-9157-1 Kobayashi Masato Department of Mathematics, The University of Tennessee, 37996, Knoxville, TN, USA aut Enumeration of Bigrassmannian Permutations Below a Permutation in Bruhat Order [Elektronische Daten] [Masato Kobayashi] 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-Schützenberger and Reading. Springer Science+Business Media B.V., 2010 Coxeter groups nationallicence Symmetric groups nationallicence Bruhat order nationallicence Bigrassmannian nationallicence Order Springer Netherlands 28/1(2011-03-01), 131-137 0167-8094 28:1<131 2011 28 11083 https://doi.org/10.1007/s11083-010-9157-1 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11083-010-9157-1 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Kobayashi Masato Department of Mathematics, The University of Tennessee, 37996, Knoxville, TN, USA aut NATIONALLICENCE 773 0- Order Springer Netherlands 28/1(2011-03-01), 131-137 0167-8094 28:1<131 2011 28 11083 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer