Identifier
- St000210: Permutations ⟶ ℤ
Values
[1] => 0
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 0
[2,1,3] => 0
[2,3,1] => 2
[3,1,2] => 2
[3,2,1] => 0
[1,2,3,4] => 0
[1,2,4,3] => 0
[1,3,2,4] => 0
[1,3,4,2] => 0
[1,4,2,3] => 0
[1,4,3,2] => 0
[2,1,3,4] => 0
[2,1,4,3] => 1
[2,3,1,4] => 0
[2,3,4,1] => 3
[2,4,1,3] => 3
[2,4,3,1] => 0
[3,1,2,4] => 0
[3,1,4,2] => 3
[3,2,1,4] => 0
[3,2,4,1] => 0
[3,4,1,2] => 2
[3,4,2,1] => 3
[4,1,2,3] => 3
[4,1,3,2] => 0
[4,2,1,3] => 0
[4,2,3,1] => 0
[4,3,1,2] => 3
[4,3,2,1] => 1
[1,2,3,4,5] => 0
[1,2,3,5,4] => 0
[1,2,4,3,5] => 0
[1,2,4,5,3] => 0
[1,2,5,3,4] => 0
[1,2,5,4,3] => 0
[1,3,2,4,5] => 0
[1,3,2,5,4] => 0
[1,3,4,2,5] => 0
[1,3,4,5,2] => 0
[1,3,5,2,4] => 0
[1,3,5,4,2] => 0
[1,4,2,3,5] => 0
[1,4,2,5,3] => 0
[1,4,3,2,5] => 0
[1,4,3,5,2] => 0
[1,4,5,2,3] => 0
[1,4,5,3,2] => 0
[1,5,2,3,4] => 0
[1,5,2,4,3] => 0
[1,5,3,2,4] => 0
[1,5,3,4,2] => 0
[1,5,4,2,3] => 0
[1,5,4,3,2] => 0
[2,1,3,4,5] => 0
[2,1,3,5,4] => 0
[2,1,4,3,5] => 0
[2,1,4,5,3] => 1
[2,1,5,3,4] => 1
[2,1,5,4,3] => 0
[2,3,1,4,5] => 0
[2,3,1,5,4] => 1
[2,3,4,1,5] => 0
[2,3,4,5,1] => 4
[2,3,5,1,4] => 4
[2,3,5,4,1] => 0
[2,4,1,3,5] => 0
[2,4,1,5,3] => 4
[2,4,3,1,5] => 0
[2,4,3,5,1] => 0
[2,4,5,1,3] => 2
[2,4,5,3,1] => 4
[2,5,1,3,4] => 4
[2,5,1,4,3] => 0
[2,5,3,1,4] => 0
[2,5,3,4,1] => 0
[2,5,4,1,3] => 4
[2,5,4,3,1] => 1
[3,1,2,4,5] => 0
[3,1,2,5,4] => 1
[3,1,4,2,5] => 0
[3,1,4,5,2] => 4
[3,1,5,2,4] => 4
[3,1,5,4,2] => 0
[3,2,1,4,5] => 0
[3,2,1,5,4] => 0
[3,2,4,1,5] => 0
[3,2,4,5,1] => 0
[3,2,5,1,4] => 0
[3,2,5,4,1] => 0
[3,4,1,2,5] => 0
[3,4,1,5,2] => 2
[3,4,2,1,5] => 0
[3,4,2,5,1] => 4
[3,4,5,1,2] => 4
[3,4,5,2,1] => 2
[3,5,1,2,4] => 2
[3,5,1,4,2] => 0
>>> 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
Minimum over maximum difference of elements in cycles.
Given a cycle $C$ in a permutation, we can compute the maximum distance between elements in the cycle, that is $\max \{ a_i-a_j | a_i, a_j \in C \}$.
The statistic is then the minimum of this value over all cycles in the permutation.
For example, all permutations with a fixed-point has statistic value 0,
and all permutations of $[n]$ with only one cycle, has statistic value $n-1$.
Given a cycle $C$ in a permutation, we can compute the maximum distance between elements in the cycle, that is $\max \{ a_i-a_j | a_i, a_j \in C \}$.
The statistic is then the minimum of this value over all cycles in the permutation.
For example, all permutations with a fixed-point has statistic value 0,
and all permutations of $[n]$ with only one cycle, has statistic value $n-1$.
References
[1] NewUser9656 d-regular partitions and permutations MathOverflow:168885
Code
def statistic(pi):
return min([max([abs(C[i]-C[j]) for (i,j) in tuples(range(len(C)),2) if i<=j]) for C in pi.cycle_tuples()])
Created
Jun 03, 2014 at 14:15 by Per Alexandersson
Updated
Oct 06, 2021 at 20:26 by Nadia Lafreniere
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!