Identifier
- St000956: Permutations ⟶ ℤ
Values
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 2
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 2
[1,4,2,3] => 2
[1,4,3,2] => 2
[2,1,3,4] => 1
[2,1,4,3] => 1
[2,3,1,4] => 2
[2,3,4,1] => 3
[2,4,1,3] => 2
[2,4,3,1] => 3
[3,1,2,4] => 2
[3,1,4,2] => 2
[3,2,1,4] => 2
[3,2,4,1] => 3
[3,4,1,2] => 2
[3,4,2,1] => 3
[4,1,2,3] => 3
[4,1,3,2] => 3
[4,2,1,3] => 3
[4,2,3,1] => 3
[4,3,1,2] => 3
[4,3,2,1] => 3
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 2
[1,2,5,3,4] => 2
[1,2,5,4,3] => 2
[1,3,2,4,5] => 1
[1,3,2,5,4] => 1
[1,3,4,2,5] => 2
[1,3,4,5,2] => 3
[1,3,5,2,4] => 2
[1,3,5,4,2] => 3
[1,4,2,3,5] => 2
[1,4,2,5,3] => 2
[1,4,3,2,5] => 2
[1,4,3,5,2] => 3
[1,4,5,2,3] => 2
[1,4,5,3,2] => 3
[1,5,2,3,4] => 3
[1,5,2,4,3] => 3
[1,5,3,2,4] => 3
[1,5,3,4,2] => 3
[1,5,4,2,3] => 3
[1,5,4,3,2] => 3
[2,1,3,4,5] => 1
[2,1,3,5,4] => 1
[2,1,4,3,5] => 1
[2,1,4,5,3] => 2
[2,1,5,3,4] => 2
[2,1,5,4,3] => 2
[2,3,1,4,5] => 2
[2,3,1,5,4] => 2
[2,3,4,1,5] => 3
[2,3,4,5,1] => 4
[2,3,5,1,4] => 3
[2,3,5,4,1] => 4
[2,4,1,3,5] => 2
[2,4,1,5,3] => 2
[2,4,3,1,5] => 3
[2,4,3,5,1] => 4
[2,4,5,1,3] => 3
[2,4,5,3,1] => 4
[2,5,1,3,4] => 3
[2,5,1,4,3] => 3
[2,5,3,1,4] => 3
[2,5,3,4,1] => 4
[2,5,4,1,3] => 3
[2,5,4,3,1] => 4
[3,1,2,4,5] => 2
[3,1,2,5,4] => 2
[3,1,4,2,5] => 2
[3,1,4,5,2] => 3
[3,1,5,2,4] => 2
[3,1,5,4,2] => 3
[3,2,1,4,5] => 2
[3,2,1,5,4] => 2
[3,2,4,1,5] => 3
[3,2,4,5,1] => 4
[3,2,5,1,4] => 3
[3,2,5,4,1] => 4
[3,4,1,2,5] => 2
[3,4,1,5,2] => 3
[3,4,2,1,5] => 3
[3,4,2,5,1] => 4
[3,4,5,1,2] => 3
[3,4,5,2,1] => 4
[3,5,1,2,4] => 3
[3,5,1,4,2] => 3
[3,5,2,1,4] => 3
>>> 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 maximal displacement of a permutation.
This is $\max\{ |\pi(i)-i| \mid 1 \leq i \leq n\}$ for a permutation $\pi$ of $\{1,\ldots,n\}$.
This statistic without the absolute value is the maximal drop size St000141The maximum drop size of a permutation..
This is $\max\{ |\pi(i)-i| \mid 1 \leq i \leq n\}$ for a permutation $\pi$ of $\{1,\ldots,n\}$.
This statistic without the absolute value is the maximal drop size St000141The maximum drop size of a permutation..
References
[1] van der Zypen, D. Expected value of maximal displacement in permutations of $\{1,…,n\}$ MathOverflow:279591
Code
def statistic(pi):
return max( abs(pi(i) - i) for i in [1..len(pi)] )
Created
Aug 27, 2017 at 08:43 by Christian Stump
Updated
Aug 27, 2017 at 09:05 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!