Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
St000957: Permutations ⟶ ℤ
Values
{{1,2}} => [2,1] => 1
{{1},{2}} => [1,2] => 0
{{1,2,3}} => [2,3,1] => 2
{{1,2},{3}} => [2,1,3] => 1
{{1,3},{2}} => [3,2,1] => 2
{{1},{2,3}} => [1,3,2] => 1
{{1},{2},{3}} => [1,2,3] => 0
{{1,2,3,4}} => [2,3,4,1] => 3
{{1,2,3},{4}} => [2,3,1,4] => 2
{{1,2,4},{3}} => [2,4,3,1] => 3
{{1,2},{3,4}} => [2,1,4,3] => 2
{{1,2},{3},{4}} => [2,1,3,4] => 1
{{1,3,4},{2}} => [3,2,4,1] => 3
{{1,3},{2,4}} => [3,4,1,2] => 4
{{1,3},{2},{4}} => [3,2,1,4] => 2
{{1,4},{2,3}} => [4,3,2,1] => 3
{{1},{2,3,4}} => [1,3,4,2] => 2
{{1},{2,3},{4}} => [1,3,2,4] => 1
{{1,4},{2},{3}} => [4,2,3,1] => 4
{{1},{2,4},{3}} => [1,4,3,2] => 2
{{1},{2},{3,4}} => [1,2,4,3] => 1
{{1},{2},{3},{4}} => [1,2,3,4] => 0
{{1,2,3,4,5}} => [2,3,4,5,1] => 4
{{1,2,3,4},{5}} => [2,3,4,1,5] => 3
{{1,2,3,5},{4}} => [2,3,5,4,1] => 4
{{1,2,3},{4,5}} => [2,3,1,5,4] => 3
{{1,2,3},{4},{5}} => [2,3,1,4,5] => 2
{{1,2,4,5},{3}} => [2,4,3,5,1] => 4
{{1,2,4},{3,5}} => [2,4,5,1,3] => 5
{{1,2,4},{3},{5}} => [2,4,3,1,5] => 3
{{1,2,5},{3,4}} => [2,5,4,3,1] => 4
{{1,2},{3,4,5}} => [2,1,4,5,3] => 3
{{1,2},{3,4},{5}} => [2,1,4,3,5] => 2
{{1,2,5},{3},{4}} => [2,5,3,4,1] => 5
{{1,2},{3,5},{4}} => [2,1,5,4,3] => 3
{{1,2},{3},{4,5}} => [2,1,3,5,4] => 2
{{1,2},{3},{4},{5}} => [2,1,3,4,5] => 1
{{1,3,4,5},{2}} => [3,2,4,5,1] => 4
{{1,3,4},{2,5}} => [3,5,4,1,2] => 5
{{1,3,4},{2},{5}} => [3,2,4,1,5] => 3
{{1,3,5},{2,4}} => [3,4,5,2,1] => 4
{{1,3},{2,4,5}} => [3,4,1,5,2] => 5
{{1,3},{2,4},{5}} => [3,4,1,2,5] => 4
{{1,3,5},{2},{4}} => [3,2,5,4,1] => 4
{{1,3},{2,5},{4}} => [3,5,1,4,2] => 5
{{1,3},{2},{4,5}} => [3,2,1,5,4] => 3
{{1,3},{2},{4},{5}} => [3,2,1,4,5] => 2
{{1,4,5},{2,3}} => [4,3,2,5,1] => 4
{{1,4},{2,3,5}} => [4,3,5,1,2] => 5
{{1,4},{2,3},{5}} => [4,3,2,1,5] => 3
{{1,5},{2,3,4}} => [5,3,4,2,1] => 5
{{1},{2,3,4,5}} => [1,3,4,5,2] => 3
{{1},{2,3,4},{5}} => [1,3,4,2,5] => 2
{{1,5},{2,3},{4}} => [5,3,2,4,1] => 5
{{1},{2,3,5},{4}} => [1,3,5,4,2] => 3
{{1},{2,3},{4,5}} => [1,3,2,5,4] => 2
{{1},{2,3},{4},{5}} => [1,3,2,4,5] => 1
{{1,4,5},{2},{3}} => [4,2,3,5,1] => 5
{{1,4},{2,5},{3}} => [4,5,3,1,2] => 4
{{1,4},{2},{3,5}} => [4,2,5,1,3] => 5
{{1,4},{2},{3},{5}} => [4,2,3,1,5] => 4
{{1,5},{2,4},{3}} => [5,4,3,2,1] => 4
{{1},{2,4,5},{3}} => [1,4,3,5,2] => 3
{{1},{2,4},{3,5}} => [1,4,5,2,3] => 4
{{1},{2,4},{3},{5}} => [1,4,3,2,5] => 2
{{1,5},{2},{3,4}} => [5,2,4,3,1] => 5
{{1},{2,5},{3,4}} => [1,5,4,3,2] => 3
{{1},{2},{3,4,5}} => [1,2,4,5,3] => 2
{{1},{2},{3,4},{5}} => [1,2,4,3,5] => 1
{{1,5},{2},{3},{4}} => [5,2,3,4,1] => 6
{{1},{2,5},{3},{4}} => [1,5,3,4,2] => 4
{{1},{2},{3,5},{4}} => [1,2,5,4,3] => 2
{{1},{2},{3},{4,5}} => [1,2,3,5,4] => 1
{{1},{2},{3},{4},{5}} => [1,2,3,4,5] => 0
{{1,2,3,4,5,6}} => [2,3,4,5,6,1] => 5
{{1,2,3,4,5},{6}} => [2,3,4,5,1,6] => 4
{{1,2,3,4,6},{5}} => [2,3,4,6,5,1] => 5
{{1,2,3,4},{5,6}} => [2,3,4,1,6,5] => 4
{{1,2,3,4},{5},{6}} => [2,3,4,1,5,6] => 3
{{1,2,3,5,6},{4}} => [2,3,5,4,6,1] => 5
{{1,2,3,5},{4,6}} => [2,3,5,6,1,4] => 6
{{1,2,3,5},{4},{6}} => [2,3,5,4,1,6] => 4
{{1,2,3,6},{4,5}} => [2,3,6,5,4,1] => 5
{{1,2,3},{4,5,6}} => [2,3,1,5,6,4] => 4
{{1,2,3},{4,5},{6}} => [2,3,1,5,4,6] => 3
{{1,2,3,6},{4},{5}} => [2,3,6,4,5,1] => 6
{{1,2,3},{4,6},{5}} => [2,3,1,6,5,4] => 4
{{1,2,3},{4},{5,6}} => [2,3,1,4,6,5] => 3
{{1,2,3},{4},{5},{6}} => [2,3,1,4,5,6] => 2
{{1,2,4,5,6},{3}} => [2,4,3,5,6,1] => 5
{{1,2,4,5},{3,6}} => [2,4,6,5,1,3] => 6
{{1,2,4,5},{3},{6}} => [2,4,3,5,1,6] => 4
{{1,2,4,6},{3,5}} => [2,4,5,6,3,1] => 5
{{1,2,4},{3,5,6}} => [2,4,5,1,6,3] => 6
{{1,2,4},{3,5},{6}} => [2,4,5,1,3,6] => 5
{{1,2,4,6},{3},{5}} => [2,4,3,6,5,1] => 5
{{1,2,4},{3,6},{5}} => [2,4,6,1,5,3] => 6
{{1,2,4},{3},{5,6}} => [2,4,3,1,6,5] => 4
{{1,2,4},{3},{5},{6}} => [2,4,3,1,5,6] => 3
{{1,2,5,6},{3,4}} => [2,5,4,3,6,1] => 5
{{1,2,5},{3,4,6}} => [2,5,4,6,1,3] => 6
>>> Load all 411 entries. <<<
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
Description
The number of Bruhat lower covers of a permutation.
This is, for a permutation $\pi$, the number of permutations $\tau$ with $\operatorname{inv}(\tau) = \operatorname{inv}(\pi) - 1$ such that $\tau*t = \pi$ for a transposition $t$.
This is also the number of occurrences of the boxed pattern $21$: occurrences of the pattern $21$ such that any entry between the two matched entries is either larger or smaller than both of the matched entries.
This is, for a permutation $\pi$, the number of permutations $\tau$ with $\operatorname{inv}(\tau) = \operatorname{inv}(\pi) - 1$ such that $\tau*t = \pi$ for a transposition $t$.
This is also the number of occurrences of the boxed pattern $21$: occurrences of the pattern $21$ such that any entry between the two matched entries is either larger or smaller than both of the matched entries.
Map
to permutation
Description
Sends the set partition to the permutation obtained by considering the blocks as increasing cycles.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!