Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001078
(load all 56 compositions to match this statistic)
Mapping
St001078: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0
[2,1] => 0
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 0
[3,1,2] => 0
[3,2,1] => 1
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 2
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 1
[2,3,4,1] => 0
[2,4,1,3] => 1
[2,4,3,1] => 1
[3,1,2,4] => 1
[3,1,4,2] => 1
[3,2,1,4] => 2
[3,2,4,1] => 1
[3,4,1,2] => 0
[3,4,2,1] => 1
[4,1,2,3] => 0
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 2
[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] => 3
[1,3,2,4,5] => 1
[1,3,2,5,4] => 2
[1,3,4,2,5] => 2
[1,3,4,5,2] => 1
[1,3,5,2,4] => 3
[1,3,5,4,2] => 2
[1,4,2,3,5] => 2
[1,4,2,5,3] => 3
[1,4,3,2,5] => 3
[1,4,3,5,2] => 2
[1,4,5,2,3] => 2
[1,4,5,3,2] => 3
Description
The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,...,n). Let $\rho=(1,\dots,n)$ and $\sigma=(1,2)$. Then, for a permutation $\pi\in\mathfrak S_n$, this statistic is $$\min\{k\mid \pi=\rho^{i_0}\sigma\rho^{i_1}\sigma\dots\rho^{i_{k-1}}\sigma\rho^{i_k}, 0\leq i_0,\dots,i_k < n\}.$$ Put differently, it is the minimal length of a factorization into cyclic shifts of the transposition $(1,2)$ (see [[St001076]]) of any of the permutations $\rho^k\pi$ for $0\leq k < n$.