Identifier
Values
[1] => [[1]] => [1] => [1] => 0
[2] => [[1,2]] => [1,2] => [1,2] => 0
[1,1] => [[1],[2]] => [2,1] => [2,1] => 1
[3] => [[1,2,3]] => [1,2,3] => [1,2,3] => 0
[2,1] => [[1,3],[2]] => [2,1,3] => [2,1,3] => 1
[1,1,1] => [[1],[2],[3]] => [3,2,1] => [3,2,1] => 2
[4] => [[1,2,3,4]] => [1,2,3,4] => [1,2,3,4] => 0
[3,1] => [[1,3,4],[2]] => [2,1,3,4] => [2,1,3,4] => 1
[2,2] => [[1,2],[3,4]] => [3,4,1,2] => [3,4,1,2] => 4
[2,1,1] => [[1,4],[2],[3]] => [3,2,1,4] => [3,2,1,4] => 2
[1,1,1,1] => [[1],[2],[3],[4]] => [4,3,2,1] => [4,3,2,1] => 3
[5] => [[1,2,3,4,5]] => [1,2,3,4,5] => [1,2,3,4,5] => 0
search for individual values
searching the database for the individual values of this statistic
/ search for generating function
searching the database for statistics with the same generating function
click to show known generating functions       
Description
The number of Bruhat lower covers of a permutation.
This is, for a signed permutation $\pi$, the number of signed permutations $\tau$ having a reduced word which is obtained by deleting a letter from a reduced word from $\pi$.
Map
reading tableau
Description
Return the RSK recording tableau of the reading word of the (standard) tableau $T$ labeled down (in English convention) each column to the shape of a partition.
Map
reading word permutation
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.
Map
to signed permutation
Description
The signed permutation with all signs positive.