Identifier
- St001079: Permutations ⟶ ℤ
Values
[] => 0
[1] => 0
[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] => 3
[1,2,3,4] => 0
[1,2,4,3] => 2
[1,3,2,4] => 1
[1,3,4,2] => 3
[1,4,2,3] => 3
[1,4,3,2] => 4
[2,1,3,4] => 1
[2,1,4,3] => 1
[2,3,1,4] => 2
[2,3,4,1] => 4
[2,4,1,3] => 2
[2,4,3,1] => 4
[3,1,2,4] => 2
[3,1,4,2] => 2
[3,2,1,4] => 3
[3,2,4,1] => 3
[3,4,1,2] => 3
[3,4,2,1] => 4
[4,1,2,3] => 4
[4,1,3,2] => 4
[4,2,1,3] => 3
[4,2,3,1] => 3
[4,3,1,2] => 4
[4,3,2,1] => 4
[1,2,3,4,5] => 0
[1,2,3,5,4] => 6
[1,2,4,3,5] => 2
[1,2,4,5,3] => 6
[1,2,5,3,4] => 6
[1,2,5,4,3] => 7
[1,3,2,4,5] => 5
[1,3,2,5,4] => 1
[1,3,4,2,5] => 5
[1,3,4,5,2] => 6
[1,3,5,2,4] => 3
[1,3,5,4,2] => 7
[1,4,2,3,5] => 5
[1,4,2,5,3] => 3
[1,4,3,2,5] => 5
[1,4,3,5,2] => 6
[1,4,5,2,3] => 5
[1,4,5,3,2] => 8
[1,5,2,3,4] => 6
[1,5,2,4,3] => 7
[1,5,3,2,4] => 6
[1,5,3,4,2] => 4
[1,5,4,2,3] => 8
[1,5,4,3,2] => 6
[2,1,3,4,5] => 1
[2,1,3,5,4] => 5
[2,1,4,3,5] => 1
[2,1,4,5,3] => 7
[2,1,5,3,4] => 7
[2,1,5,4,3] => 7
[2,3,1,4,5] => 4
[2,3,1,5,4] => 2
[2,3,4,1,5] => 4
[2,3,4,5,1] => 7
[2,3,5,1,4] => 4
[2,3,5,4,1] => 8
[2,4,1,3,5] => 6
[2,4,1,5,3] => 2
[2,4,3,1,5] => 6
[2,4,3,5,1] => 5
[2,4,5,1,3] => 4
[2,4,5,3,1] => 7
[2,5,1,3,4] => 7
[2,5,1,4,3] => 7
[2,5,3,1,4] => 7
[2,5,3,4,1] => 5
[2,5,4,1,3] => 7
[2,5,4,3,1] => 5
[3,1,2,4,5] => 4
[3,1,2,5,4] => 2
[3,1,4,2,5] => 6
[3,1,4,5,2] => 7
[3,1,5,2,4] => 2
[3,1,5,4,2] => 7
[3,2,1,4,5] => 3
[3,2,1,5,4] => 3
[3,2,4,1,5] => 5
[3,2,4,5,1] => 8
[3,2,5,1,4] => 3
[3,2,5,4,1] => 8
[3,4,1,2,5] => 8
[3,4,1,5,2] => 7
[3,4,2,1,5] => 8
[3,4,2,5,1] => 6
[3,4,5,1,2] => 7
[3,4,5,2,1] => 6
[3,5,1,2,4] => 7
>>> Load all 874 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 minimal length of a factorization of a permutation using the permutations (12)(34)..., (23)(45)..., and (12).
In symbols, for a permutation $\pi$ this is
$$\min\{ k \mid \pi = \tau_{i_1} \cdots \tau_{i_k} \},$$
where, with $m_1$ the largest even number at most $n$ and $m_2$ the largest odd number at most $n$, each factor $\tau_i$ is one of the three permutations $(1,2)(3,4)\cdots(m_1-1,m_1)$ or $(2,3)(4,5)\cdots(m_2-1,m_2)$ or $(1,2)$.
In symbols, for a permutation $\pi$ this is
$$\min\{ k \mid \pi = \tau_{i_1} \cdots \tau_{i_k} \},$$
where, with $m_1$ the largest even number at most $n$ and $m_2$ the largest odd number at most $n$, each factor $\tau_i$ is one of the three permutations $(1,2)(3,4)\cdots(m_1-1,m_1)$ or $(2,3)(4,5)\cdots(m_2-1,m_2)$ or $(1,2)$.
References
[1] Pak, I. "Natural" generating sets for symmetric groups. MathOverflow:24128
Code
def statistic(pi):
def gens(n):
n1 = n if is_even(n) else n-1
n2 = n-2 if is_even(n) else n-1
return [Permutation([i+2 if is_even(i) else i for i in range(n1)]),
Permutation([1] + [i+3 if is_even(i) else i+1 for i in range(n2)]), Permutation([2,1])]
G = PermutationGroup(gens(len(pi)))
pi = G(pi)
w = gap.Factorization(G._gap_(), pi._gap_())
return w.Length()
Created
Jan 08, 2018 at 23:38 by Martin Rubey
Updated
Jan 09, 2018 at 19:40 by Martin Rubey
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!