Identifier
- St000341: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 1
[2,1] => 0
[1,2,3] => 4
[1,3,2] => 3
[2,1,3] => 3
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 0
[1,2,3,4] => 10
[1,2,4,3] => 9
[1,3,2,4] => 9
[1,3,4,2] => 7
[1,4,2,3] => 7
[1,4,3,2] => 6
[2,1,3,4] => 9
[2,1,4,3] => 8
[2,3,1,4] => 7
[2,3,4,1] => 4
[2,4,1,3] => 5
[2,4,3,1] => 3
[3,1,2,4] => 7
[3,1,4,2] => 5
[3,2,1,4] => 6
[3,2,4,1] => 3
[3,4,1,2] => 2
[3,4,2,1] => 1
[4,1,2,3] => 4
[4,1,3,2] => 3
[4,2,1,3] => 3
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 0
[1,2,3,4,5] => 20
[1,2,3,5,4] => 19
[1,2,4,3,5] => 19
[1,2,4,5,3] => 17
[1,2,5,3,4] => 17
[1,2,5,4,3] => 16
[1,3,2,4,5] => 19
[1,3,2,5,4] => 18
[1,3,4,2,5] => 17
[1,3,4,5,2] => 14
[1,3,5,2,4] => 15
[1,3,5,4,2] => 13
[1,4,2,3,5] => 17
[1,4,2,5,3] => 15
[1,4,3,2,5] => 16
[1,4,3,5,2] => 13
[1,4,5,2,3] => 12
[1,4,5,3,2] => 11
[1,5,2,3,4] => 14
[1,5,2,4,3] => 13
[1,5,3,2,4] => 13
[1,5,3,4,2] => 11
[1,5,4,2,3] => 11
[1,5,4,3,2] => 10
[2,1,3,4,5] => 19
[2,1,3,5,4] => 18
[2,1,4,3,5] => 18
[2,1,4,5,3] => 16
[2,1,5,3,4] => 16
[2,1,5,4,3] => 15
[2,3,1,4,5] => 17
[2,3,1,5,4] => 16
[2,3,4,1,5] => 14
[2,3,4,5,1] => 10
[2,3,5,1,4] => 12
[2,3,5,4,1] => 9
[2,4,1,3,5] => 15
[2,4,1,5,3] => 13
[2,4,3,1,5] => 13
[2,4,3,5,1] => 9
[2,4,5,1,3] => 9
[2,4,5,3,1] => 7
[2,5,1,3,4] => 12
[2,5,1,4,3] => 11
[2,5,3,1,4] => 10
[2,5,3,4,1] => 7
[2,5,4,1,3] => 8
[2,5,4,3,1] => 6
[3,1,2,4,5] => 17
[3,1,2,5,4] => 16
[3,1,4,2,5] => 15
[3,1,4,5,2] => 12
[3,1,5,2,4] => 13
[3,1,5,4,2] => 11
[3,2,1,4,5] => 16
[3,2,1,5,4] => 15
[3,2,4,1,5] => 13
[3,2,4,5,1] => 9
[3,2,5,1,4] => 11
[3,2,5,4,1] => 8
[3,4,1,2,5] => 12
[3,4,1,5,2] => 9
[3,4,2,1,5] => 11
[3,4,2,5,1] => 7
[3,4,5,1,2] => 5
[3,4,5,2,1] => 4
[3,5,1,2,4] => 9
[3,5,1,4,2] => 7
>>> Load all 1201 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 non-inversion sum of a permutation.
A pair $a < b$ is an noninversion of a permutation $\pi$ if $\pi(a) < \pi(b)$. The non-inversion sum is given by $\sum(b-a)$ over all non-inversions of $\pi$.
A pair $a < b$ is an noninversion of a permutation $\pi$ if $\pi(a) < \pi(b)$. The non-inversion sum is given by $\sum(b-a)$ over all non-inversions of $\pi$.
References
[1] Sack, J., Úlfarsson, H. Refined inversion statistics on permutations MathSciNet:2880660 arXiv:1106.1995
[2] The inversion sum of a permutation. St000055
[2] The inversion sum of a permutation. St000055
Code
def statistic(pi):
return sum( inv[1]-inv[0] for inv in pi.noninversions(2) )
Created
Dec 23, 2015 at 08:49 by Christian Stump
Updated
Sep 29, 2022 at 19:06 by Will Dowling
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!