Identifier
- St000833: Permutations ⟶ ℤ
Values
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 2
[2,3,1] => 1
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 2
[1,3,4,2] => 1
[1,4,2,3] => 2
[1,4,3,2] => 3
[2,1,3,4] => 3
[2,1,4,3] => 4
[2,3,1,4] => 2
[2,3,4,1] => 1
[2,4,1,3] => 2
[2,4,3,1] => 3
[3,1,2,4] => 3
[3,1,4,2] => 4
[3,2,1,4] => 5
[3,2,4,1] => 4
[3,4,1,2] => 2
[3,4,2,1] => 3
[4,1,2,3] => 3
[4,1,3,2] => 4
[4,2,1,3] => 5
[4,2,3,1] => 4
[4,3,1,2] => 5
[4,3,2,1] => 6
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 2
[1,2,4,5,3] => 1
[1,2,5,3,4] => 2
[1,2,5,4,3] => 3
[1,3,2,4,5] => 3
[1,3,2,5,4] => 4
[1,3,4,2,5] => 2
[1,3,4,5,2] => 1
[1,3,5,2,4] => 2
[1,3,5,4,2] => 3
[1,4,2,3,5] => 3
[1,4,2,5,3] => 4
[1,4,3,2,5] => 5
[1,4,3,5,2] => 4
[1,4,5,2,3] => 2
[1,4,5,3,2] => 3
[1,5,2,3,4] => 3
[1,5,2,4,3] => 4
[1,5,3,2,4] => 5
[1,5,3,4,2] => 4
[1,5,4,2,3] => 5
[1,5,4,3,2] => 6
[2,1,3,4,5] => 4
[2,1,3,5,4] => 5
[2,1,4,3,5] => 6
[2,1,4,5,3] => 5
[2,1,5,3,4] => 6
[2,1,5,4,3] => 7
[2,3,1,4,5] => 3
[2,3,1,5,4] => 4
[2,3,4,1,5] => 2
[2,3,4,5,1] => 1
[2,3,5,1,4] => 2
[2,3,5,4,1] => 3
[2,4,1,3,5] => 3
[2,4,1,5,3] => 4
[2,4,3,1,5] => 5
[2,4,3,5,1] => 4
[2,4,5,1,3] => 2
[2,4,5,3,1] => 3
[2,5,1,3,4] => 3
[2,5,1,4,3] => 4
[2,5,3,1,4] => 5
[2,5,3,4,1] => 4
[2,5,4,1,3] => 5
[2,5,4,3,1] => 6
[3,1,2,4,5] => 4
[3,1,2,5,4] => 5
[3,1,4,2,5] => 6
[3,1,4,5,2] => 5
[3,1,5,2,4] => 6
[3,1,5,4,2] => 7
[3,2,1,4,5] => 7
[3,2,1,5,4] => 8
[3,2,4,1,5] => 6
[3,2,4,5,1] => 5
[3,2,5,1,4] => 6
[3,2,5,4,1] => 7
[3,4,1,2,5] => 3
[3,4,1,5,2] => 4
[3,4,2,1,5] => 5
[3,4,2,5,1] => 4
[3,4,5,1,2] => 2
[3,4,5,2,1] => 3
[3,5,1,2,4] => 3
[3,5,1,4,2] => 4
[3,5,2,1,4] => 5
>>> Load all 1200 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 comajor index of a permutation.
This is, $\operatorname{comaj}(\pi) = \sum_{i \in \operatorname{Des}(\pi)} (n-i)$ for a permutation $\pi$ of length $n$.
This is, $\operatorname{comaj}(\pi) = \sum_{i \in \operatorname{Des}(\pi)} (n-i)$ for a permutation $\pi$ of length $n$.
Code
def statistic(pi):
n = len(pi)
return sum( n-i for i in [1 .. n-1] if pi(i) > pi(i+1) )
Created
Jun 05, 2017 at 09:58 by Christian Stump
Updated
Jun 05, 2017 at 09:58 by Christian Stump
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!