Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000210
(load all 7 compositions to match this statistic)
Mapping
St000210: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
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
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$.