Identifier
- St001246: Permutations ⟶ ℤ
Values
[1,2] => 1
[2,1] => 1
[1,2,3] => 1
[1,3,2] => 2
[2,1,3] => 2
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 1
[1,2,3,4] => 1
[1,2,4,3] => 2
[1,3,2,4] => 2
[1,3,4,2] => 2
[1,4,2,3] => 3
[1,4,3,2] => 3
[2,1,3,4] => 2
[2,1,4,3] => 3
[2,3,1,4] => 3
[2,3,4,1] => 3
[2,4,1,3] => 3
[2,4,3,1] => 2
[3,1,2,4] => 2
[3,1,4,2] => 3
[3,2,1,4] => 3
[3,2,4,1] => 3
[3,4,1,2] => 3
[3,4,2,1] => 2
[4,1,2,3] => 3
[4,1,3,2] => 3
[4,2,1,3] => 2
[4,2,3,1] => 2
[4,3,1,2] => 2
[4,3,2,1] => 1
[1,2,3,4,5] => 1
[1,2,3,5,4] => 2
[1,2,4,3,5] => 2
[1,2,4,5,3] => 2
[1,2,5,3,4] => 3
[1,2,5,4,3] => 3
[1,3,2,4,5] => 2
[1,3,2,5,4] => 3
[1,3,4,2,5] => 3
[1,3,4,5,2] => 3
[1,3,5,2,4] => 3
[1,3,5,4,2] => 2
[1,4,2,3,5] => 3
[1,4,2,5,3] => 3
[1,4,3,2,5] => 3
[1,4,3,5,2] => 3
[1,4,5,2,3] => 3
[1,4,5,3,2] => 3
[1,5,2,3,4] => 4
[1,5,2,4,3] => 4
[1,5,3,2,4] => 4
[1,5,3,4,2] => 4
[1,5,4,2,3] => 4
[1,5,4,3,2] => 4
[2,1,3,4,5] => 2
[2,1,3,5,4] => 2
[2,1,4,3,5] => 3
[2,1,4,5,3] => 3
[2,1,5,3,4] => 4
[2,1,5,4,3] => 4
[2,3,1,4,5] => 3
[2,3,1,5,4] => 4
[2,3,4,1,5] => 4
[2,3,4,5,1] => 4
[2,3,5,1,4] => 4
[2,3,5,4,1] => 3
[2,4,1,3,5] => 3
[2,4,1,5,3] => 4
[2,4,3,1,5] => 4
[2,4,3,5,1] => 4
[2,4,5,1,3] => 4
[2,4,5,3,1] => 2
[2,5,1,3,4] => 4
[2,5,1,4,3] => 4
[2,5,3,1,4] => 3
[2,5,3,4,1] => 3
[2,5,4,1,3] => 3
[2,5,4,3,1] => 3
[3,1,2,4,5] => 2
[3,1,2,5,4] => 3
[3,1,4,2,5] => 3
[3,1,4,5,2] => 3
[3,1,5,2,4] => 4
[3,1,5,4,2] => 4
[3,2,1,4,5] => 3
[3,2,1,5,4] => 4
[3,2,4,1,5] => 4
[3,2,4,5,1] => 4
[3,2,5,1,4] => 4
[3,2,5,4,1] => 3
[3,4,1,2,5] => 3
[3,4,1,5,2] => 4
[3,4,2,1,5] => 4
[3,4,2,5,1] => 4
[3,4,5,1,2] => 4
[3,4,5,2,1] => 3
[3,5,1,2,4] => 4
[3,5,1,4,2] => 4
[3,5,2,1,4] => 3
>>> Load all 1199 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 difference between two consecutive entries of a permutation.
This is given, for a permutation $\pi$ of length $n$, by
$$\max\{ | \pi(i) - \pi(i+1) | : 1 \leq i < n \}.$$
This is given, for a permutation $\pi$ of length $n$, by
$$\max\{ | \pi(i) - \pi(i+1) | : 1 \leq i < n \}.$$
Code
def statistic(pi):
if len(pi) == 1:
return 0
return max( abs(pi[i]-pi[i+1]) for i in range(len(pi)-1) )
Created
Aug 13, 2018 at 09:53 by Christian Stump
Updated
Aug 13, 2018 at 09:53 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!