Identifier
- St001080: Permutations ⟶ ℤ
Values
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 2
[2,1,3] => 1
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 2
[1,2,3,4] => 0
[1,2,4,3] => 5
[1,3,2,4] => 3
[1,3,4,2] => 2
[1,4,2,3] => 2
[1,4,3,2] => 5
[2,1,3,4] => 1
[2,1,4,3] => 6
[2,3,1,4] => 4
[2,3,4,1] => 1
[2,4,1,3] => 3
[2,4,3,1] => 4
[3,1,2,4] => 4
[3,1,4,2] => 3
[3,2,1,4] => 5
[3,2,4,1] => 2
[3,4,1,2] => 2
[3,4,2,1] => 3
[4,1,2,3] => 1
[4,1,3,2] => 4
[4,2,1,3] => 2
[4,2,3,1] => 3
[4,3,1,2] => 3
[4,3,2,1] => 4
[1,2,3,4,5] => 0
[1,2,3,5,4] => 5
[1,2,4,3,5] => 5
[1,2,4,5,3] => 5
[1,2,5,3,4] => 5
[1,2,5,4,3] => 9
[1,3,2,4,5] => 3
[1,3,2,5,4] => 7
[1,3,4,2,5] => 5
[1,3,4,5,2] => 2
[1,3,5,2,4] => 7
[1,3,5,4,2] => 6
[1,4,2,3,5] => 5
[1,4,2,5,3] => 7
[1,4,3,2,5] => 7
[1,4,3,5,2] => 5
[1,4,5,2,3] => 4
[1,4,5,3,2] => 7
[1,5,2,3,4] => 2
[1,5,2,4,3] => 6
[1,5,3,2,4] => 5
[1,5,3,4,2] => 5
[1,5,4,2,3] => 7
[1,5,4,3,2] => 9
[2,1,3,4,5] => 1
[2,1,3,5,4] => 6
[2,1,4,3,5] => 6
[2,1,4,5,3] => 6
[2,1,5,3,4] => 6
[2,1,5,4,3] => 10
[2,3,1,4,5] => 4
[2,3,1,5,4] => 8
[2,3,4,1,5] => 4
[2,3,4,5,1] => 1
[2,3,5,1,4] => 6
[2,3,5,4,1] => 5
[2,4,1,3,5] => 6
[2,4,1,5,3] => 6
[2,4,3,1,5] => 6
[2,4,3,5,1] => 4
[2,4,5,1,3] => 3
[2,4,5,3,1] => 6
[2,5,1,3,4] => 3
[2,5,1,4,3] => 7
[2,5,3,1,4] => 6
[2,5,3,4,1] => 4
[2,5,4,1,3] => 6
[2,5,4,3,1] => 8
[3,1,2,4,5] => 4
[3,1,2,5,4] => 8
[3,1,4,2,5] => 6
[3,1,4,5,2] => 3
[3,1,5,2,4] => 6
[3,1,5,4,2] => 7
[3,2,1,4,5] => 5
[3,2,1,5,4] => 9
[3,2,4,1,5] => 5
[3,2,4,5,1] => 2
[3,2,5,1,4] => 7
[3,2,5,4,1] => 6
[3,4,1,2,5] => 6
[3,4,1,5,2] => 4
[3,4,2,1,5] => 7
[3,4,2,5,1] => 5
[3,4,5,1,2] => 2
[3,4,5,2,1] => 3
[3,5,1,2,4] => 4
[3,5,1,4,2] => 7
[3,5,2,1,4] => 5
>>> 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
The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,...,n).
In symbols, for a permutation $\pi$ this is
$$\min\{ k \mid \pi = \tau_{i_1} \cdots \tau_{i_k} \},$$
where each factor $\tau_i$ is one of $(1,2)$, $(1,\dots,n)$ or $(1,\dots,n)^{-1}$.
In symbols, for a permutation $\pi$ this is
$$\min\{ k \mid \pi = \tau_{i_1} \cdots \tau_{i_k} \},$$
where each factor $\tau_i$ is one of $(1,2)$, $(1,\dots,n)$ or $(1,\dots,n)^{-1}$.
Code
def statistic(pi):
def gens(n):
a = Permutation([2,1])
b = Permutation([i for i in range(2,n+1)] + [1])
return [a, b]
G = PermutationGroup(gens(len(pi)))
pi = G(pi)
w = gap.Factorization(G._gap_(), pi._gap_())
return w.Length().sage()
Created
Jan 08, 2018 at 23:24 by Martin Rubey
Updated
Feb 09, 2021 at 15:29 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!