Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000545: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 2
[2,1] => 1
[1,2,3] => 6
[1,3,2] => 4
[2,1,3] => 4
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 1
[1,2,3,4] => 20
[1,2,4,3] => 12
[1,3,2,4] => 16
[1,3,4,2] => 10
[1,4,2,3] => 10
[1,4,3,2] => 4
[2,1,3,4] => 12
[2,1,4,3] => 4
[2,3,1,4] => 10
[2,3,4,1] => 6
[2,4,1,3] => 8
[2,4,3,1] => 4
[3,1,2,4] => 10
[3,1,4,2] => 8
[3,2,1,4] => 4
[3,2,4,1] => 4
[3,4,1,2] => 4
[3,4,2,1] => 2
[4,1,2,3] => 6
[4,1,3,2] => 4
[4,2,1,3] => 4
[4,2,3,1] => 2
[4,3,1,2] => 2
[4,3,2,1] => 1
[1,2,3,4,5] => 66
[1,2,3,5,4] => 36
[1,2,4,3,5] => 48
[1,2,4,5,3] => 31
[1,2,5,3,4] => 31
[1,2,5,4,3] => 12
[1,3,2,4,5] => 48
[1,3,2,5,4] => 16
[1,3,4,2,5] => 48
[1,3,4,5,2] => 30
[1,3,5,2,4] => 32
[1,3,5,4,2] => 16
[1,4,2,3,5] => 48
[1,4,2,5,3] => 32
[1,4,3,2,5] => 16
[1,4,3,5,2] => 16
[1,4,5,2,3] => 25
Description
The number of parabolic double cosets with minimal element being the given permutation. For $w \in S_n$, this is $$\big| W_I \tau W_J\ :\ \tau \in S_n,\ I,J \subseteq S,\ w = \min\{W_I \tau W_J\}\big|$$ where $S$ is the set of simple transpositions, $W_K$ is the parabolic subgroup generated by $K \subseteq S$, and $\min\{W_I \tau W_J\}$ is the unique minimal element in weak order in the double coset $W_I \tau W_J$. [1] contains a combinatorial description of these parabolic double cosets which can be used to compute this statistic.