Identifier
-
Mp00080:
Set partitions
—to permutation⟶
Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000314: Permutations ⟶ ℤ
Values
{{1}} => [1] => [1] => 1
{{1,2}} => [2,1] => [2,1] => 1
{{1},{2}} => [1,2] => [1,2] => 2
{{1,2,3}} => [2,3,1] => [3,1,2] => 1
{{1,2},{3}} => [2,1,3] => [2,1,3] => 2
{{1,3},{2}} => [3,2,1] => [3,2,1] => 1
{{1},{2,3}} => [1,3,2] => [2,3,1] => 2
{{1},{2},{3}} => [1,2,3] => [1,2,3] => 3
{{1,2,3,4}} => [2,3,4,1] => [4,1,2,3] => 1
{{1,2,3},{4}} => [2,3,1,4] => [3,1,2,4] => 2
{{1,2,4},{3}} => [2,4,3,1] => [4,2,3,1] => 1
{{1,2},{3,4}} => [2,1,4,3] => [3,2,4,1] => 2
{{1,2},{3},{4}} => [2,1,3,4] => [2,1,3,4] => 3
{{1,3,4},{2}} => [3,2,4,1] => [4,2,1,3] => 1
{{1,3},{2,4}} => [3,4,1,2] => [1,4,2,3] => 2
{{1,3},{2},{4}} => [3,2,1,4] => [3,2,1,4] => 2
{{1,4},{2,3}} => [4,3,2,1] => [4,3,2,1] => 1
{{1},{2,3,4}} => [1,3,4,2] => [2,4,1,3] => 2
{{1},{2,3},{4}} => [1,3,2,4] => [2,3,1,4] => 3
{{1,4},{2},{3}} => [4,2,3,1] => [4,1,3,2] => 1
{{1},{2,4},{3}} => [1,4,3,2] => [3,4,2,1] => 2
{{1},{2},{3,4}} => [1,2,4,3] => [2,3,4,1] => 3
{{1},{2},{3},{4}} => [1,2,3,4] => [1,2,3,4] => 4
{{1,2,3,4,5}} => [2,3,4,5,1] => [5,1,2,3,4] => 1
{{1,2,3,4},{5}} => [2,3,4,1,5] => [4,1,2,3,5] => 2
{{1,2,3,5},{4}} => [2,3,5,4,1] => [5,2,3,4,1] => 1
{{1,2,3},{4,5}} => [2,3,1,5,4] => [4,2,3,5,1] => 2
{{1,2,3},{4},{5}} => [2,3,1,4,5] => [3,1,2,4,5] => 3
{{1,2,4,5},{3}} => [2,4,3,5,1] => [5,2,3,1,4] => 1
{{1,2,4},{3,5}} => [2,4,5,1,3] => [1,3,5,2,4] => 3
{{1,2,4},{3},{5}} => [2,4,3,1,5] => [4,2,3,1,5] => 2
{{1,2,5},{3,4}} => [2,5,4,3,1] => [5,3,4,2,1] => 1
{{1,2},{3,4,5}} => [2,1,4,5,3] => [3,2,5,1,4] => 2
{{1,2},{3,4},{5}} => [2,1,4,3,5] => [3,2,4,1,5] => 3
{{1,2,5},{3},{4}} => [2,5,3,4,1] => [5,2,1,4,3] => 1
{{1,2},{3,5},{4}} => [2,1,5,4,3] => [4,3,5,2,1] => 2
{{1,2},{3},{4,5}} => [2,1,3,5,4] => [3,2,4,5,1] => 3
{{1,2},{3},{4},{5}} => [2,1,3,4,5] => [2,1,3,4,5] => 4
{{1,3,4,5},{2}} => [3,2,4,5,1] => [5,2,1,3,4] => 1
{{1,3,4},{2,5}} => [3,5,4,1,2] => [1,5,3,4,2] => 2
{{1,3,4},{2},{5}} => [3,2,4,1,5] => [4,2,1,3,5] => 2
{{1,3,5},{2,4}} => [3,4,5,2,1] => [5,4,1,2,3] => 1
{{1,3},{2,4,5}} => [3,4,1,5,2] => [4,5,1,2,3] => 2
{{1,3},{2,4},{5}} => [3,4,1,2,5] => [1,4,2,3,5] => 3
{{1,3,5},{2},{4}} => [3,2,5,4,1] => [5,3,2,4,1] => 1
{{1,3},{2,5},{4}} => [3,5,1,4,2] => [2,5,3,4,1] => 2
{{1,3},{2},{4,5}} => [3,2,1,5,4] => [4,3,2,5,1] => 2
{{1,3},{2},{4},{5}} => [3,2,1,4,5] => [3,2,1,4,5] => 3
{{1,4,5},{2,3}} => [4,3,2,5,1] => [5,3,2,1,4] => 1
{{1,4},{2,3,5}} => [4,3,5,1,2] => [1,5,3,2,4] => 2
{{1,4},{2,3},{5}} => [4,3,2,1,5] => [4,3,2,1,5] => 2
{{1,5},{2,3,4}} => [5,3,4,2,1] => [5,4,1,3,2] => 1
{{1},{2,3,4,5}} => [1,3,4,5,2] => [2,5,1,3,4] => 2
{{1},{2,3,4},{5}} => [1,3,4,2,5] => [2,4,1,3,5] => 3
{{1,5},{2,3},{4}} => [5,3,2,4,1] => [5,3,1,4,2] => 1
{{1},{2,3,5},{4}} => [1,3,5,4,2] => [3,5,2,4,1] => 2
{{1},{2,3},{4,5}} => [1,3,2,5,4] => [3,4,2,5,1] => 3
{{1},{2,3},{4},{5}} => [1,3,2,4,5] => [2,3,1,4,5] => 4
{{1,4,5},{2},{3}} => [4,2,3,5,1] => [5,1,3,2,4] => 1
{{1,4},{2,5},{3}} => [4,5,3,1,2] => [1,5,4,2,3] => 2
{{1,4},{2},{3,5}} => [4,2,5,1,3] => [1,4,5,2,3] => 3
{{1,4},{2},{3},{5}} => [4,2,3,1,5] => [4,1,3,2,5] => 2
{{1,5},{2,4},{3}} => [5,4,3,2,1] => [5,4,3,2,1] => 1
{{1},{2,4,5},{3}} => [1,4,3,5,2] => [3,5,2,1,4] => 2
{{1},{2,4},{3,5}} => [1,4,5,2,3] => [2,1,5,3,4] => 2
{{1},{2,4},{3},{5}} => [1,4,3,2,5] => [3,4,2,1,5] => 3
{{1,5},{2},{3,4}} => [5,2,4,3,1] => [5,2,4,3,1] => 1
{{1},{2,5},{3,4}} => [1,5,4,3,2] => [4,5,3,2,1] => 2
{{1},{2},{3,4,5}} => [1,2,4,5,3] => [2,3,5,1,4] => 3
{{1},{2},{3,4},{5}} => [1,2,4,3,5] => [2,3,4,1,5] => 4
{{1,5},{2},{3},{4}} => [5,2,3,4,1] => [5,1,2,4,3] => 1
{{1},{2,5},{3},{4}} => [1,5,3,4,2] => [3,5,1,4,2] => 2
{{1},{2},{3,5},{4}} => [1,2,5,4,3] => [3,4,5,2,1] => 3
{{1},{2},{3},{4,5}} => [1,2,3,5,4] => [2,3,4,5,1] => 4
{{1},{2},{3},{4},{5}} => [1,2,3,4,5] => [1,2,3,4,5] => 5
{{1,2,3,4,5,6}} => [2,3,4,5,6,1] => [6,1,2,3,4,5] => 1
{{1,2,3,4,5},{6}} => [2,3,4,5,1,6] => [5,1,2,3,4,6] => 2
{{1,2,3,4,6},{5}} => [2,3,4,6,5,1] => [6,2,3,4,5,1] => 1
{{1,2,3,4},{5,6}} => [2,3,4,1,6,5] => [5,2,3,4,6,1] => 2
{{1,2,3,4},{5},{6}} => [2,3,4,1,5,6] => [4,1,2,3,5,6] => 3
{{1,2,3,5,6},{4}} => [2,3,5,4,6,1] => [6,2,3,4,1,5] => 1
{{1,2,3,5},{4,6}} => [2,3,5,6,1,4] => [1,3,4,6,2,5] => 4
{{1,2,3,5},{4},{6}} => [2,3,5,4,1,6] => [5,2,3,4,1,6] => 2
{{1,2,3,6},{4,5}} => [2,3,6,5,4,1] => [6,3,4,5,2,1] => 1
{{1,2,3},{4,5,6}} => [2,3,1,5,6,4] => [4,2,3,6,1,5] => 2
{{1,2,3},{4,5},{6}} => [2,3,1,5,4,6] => [4,2,3,5,1,6] => 3
{{1,2,3,6},{4},{5}} => [2,3,6,4,5,1] => [6,2,3,1,5,4] => 1
{{1,2,3},{4,6},{5}} => [2,3,1,6,5,4] => [5,3,4,6,2,1] => 2
{{1,2,3},{4},{5,6}} => [2,3,1,4,6,5] => [4,2,3,5,6,1] => 3
{{1,2,3},{4},{5},{6}} => [2,3,1,4,5,6] => [3,1,2,4,5,6] => 4
{{1,2,4,5,6},{3}} => [2,4,3,5,6,1] => [6,2,3,1,4,5] => 1
{{1,2,4,5},{3,6}} => [2,4,6,5,1,3] => [1,4,6,3,5,2] => 3
{{1,2,4,5},{3},{6}} => [2,4,3,5,1,6] => [5,2,3,1,4,6] => 2
{{1,2,4,6},{3,5}} => [2,4,5,6,3,1] => [6,2,5,1,3,4] => 1
{{1,2,4},{3,5,6}} => [2,4,5,1,6,3] => [5,2,6,1,3,4] => 2
{{1,2,4},{3,5},{6}} => [2,4,5,1,3,6] => [1,3,5,2,4,6] => 4
{{1,2,4,6},{3},{5}} => [2,4,3,6,5,1] => [6,3,4,2,5,1] => 1
{{1,2,4},{3,6},{5}} => [2,4,6,1,5,3] => [2,4,6,3,5,1] => 3
{{1,2,4},{3},{5,6}} => [2,4,3,1,6,5] => [5,3,4,2,6,1] => 2
{{1,2,4},{3},{5},{6}} => [2,4,3,1,5,6] => [4,2,3,1,5,6] => 3
{{1,2,5,6},{3,4}} => [2,5,4,3,6,1] => [6,3,4,2,1,5] => 1
>>> Load all 278 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 left-to-right-maxima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a left-to-right-maximum if there does not exist a $j < i$ such that $\sigma_j > \sigma_i$.
This is also the number of weak exceedences of a permutation that are not mid-points of a decreasing subsequence of length 3, see [1] for more on the later description.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a left-to-right-maximum if there does not exist a $j < i$ such that $\sigma_j > \sigma_i$.
This is also the number of weak exceedences of a permutation that are not mid-points of a decreasing subsequence of length 3, see [1] for more on the later description.
Map
major-index to inversion-number bijection
Description
Return the permutation whose Lehmer code equals the major code of the preimage.
This map sends the major index to the number of inversions.
This map sends the major index to the number of inversions.
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!