Processing math: 100%

Your data matches 5 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001428
St001428: Signed permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 0
[-1] => 1
[1,2] => 0
[1,-2] => 3
[-1,2] => 1
[-1,-2] => 4
[2,1] => 1
[2,-1] => 2
[-2,1] => 2
[-2,-1] => 3
[1,2,3] => 0
[1,2,-3] => 5
[1,-2,3] => 3
[1,-2,-3] => 8
[-1,2,3] => 1
[-1,2,-3] => 6
[-1,-2,3] => 4
[-1,-2,-3] => 9
[1,3,2] => 1
[1,3,-2] => 4
[1,-3,2] => 4
[1,-3,-2] => 7
[-1,3,2] => 2
[-1,3,-2] => 5
[-1,-3,2] => 5
[-1,-3,-2] => 8
[2,1,3] => 1
[2,1,-3] => 6
[2,-1,3] => 2
[2,-1,-3] => 7
[-2,1,3] => 2
[-2,1,-3] => 7
[-2,-1,3] => 3
[-2,-1,-3] => 8
[2,3,1] => 2
[2,3,-1] => 3
[2,-3,1] => 5
[2,-3,-1] => 6
[-2,3,1] => 3
[-2,3,-1] => 4
[-2,-3,1] => 6
[-2,-3,-1] => 7
[3,1,2] => 2
[3,1,-2] => 5
[3,-1,2] => 3
[3,-1,-2] => 6
[-3,1,2] => 3
[-3,1,-2] => 6
[-3,-1,2] => 4
[-3,-1,-2] => 7
Description
The number of B-inversions of a signed permutation. The number of B-inversions of a signed permutation σ of length n is invB(σ)=|{1i<jnσ(i)>σ(j)}|+|{1ijnσ(i)>σ(j)}|, see [1, Eq. (8.2)]. According to [1, Eq. (8.4)], this is the Coxeter length of σ.
Matching statistic: St001433
St001433: Signed permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 0
[-1] => 1
[1,2] => 0
[1,-2] => 3
[-1,2] => 1
[-1,-2] => 4
[2,1] => 2
[2,-1] => 3
[-2,1] => 1
[-2,-1] => 2
[1,2,3] => 0
[1,2,-3] => 5
[1,-2,3] => 3
[1,-2,-3] => 8
[-1,2,3] => 1
[-1,2,-3] => 6
[-1,-2,3] => 4
[-1,-2,-3] => 9
[1,3,2] => 4
[1,3,-2] => 5
[1,-3,2] => 3
[1,-3,-2] => 4
[-1,3,2] => 5
[-1,3,-2] => 6
[-1,-3,2] => 4
[-1,-3,-2] => 5
[2,1,3] => 2
[2,1,-3] => 7
[2,-1,3] => 3
[2,-1,-3] => 8
[-2,1,3] => 1
[-2,1,-3] => 6
[-2,-1,3] => 2
[-2,-1,-3] => 7
[2,3,1] => 4
[2,3,-1] => 5
[2,-3,1] => 3
[2,-3,-1] => 4
[-2,3,1] => 5
[-2,3,-1] => 6
[-2,-3,1] => 4
[-2,-3,-1] => 5
[3,1,2] => 2
[3,1,-2] => 7
[3,-1,2] => 3
[3,-1,-2] => 8
[-3,1,2] => 1
[-3,1,-2] => 6
[-3,-1,2] => 2
[-3,-1,-2] => 7
Description
The flag major index of a signed permutation. The flag major index of a signed permutation σ is: fmaj(σ)=neg(σ)+2iDesB(σ)i, where DesB(σ) is the B-descent set of σ; see [1, Eq.(10)]. This statistic is equidistributed with the B-inversions ([[St001428]]) and with the negative major index on the groups of signed permutations (see [1, Corollary 4.6]).
Matching statistic: St001819
St001819: Signed permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 0
[-1] => 1
[1,2] => 0
[1,-2] => 1
[-1,2] => 1
[-1,-2] => 2
[2,1] => 2
[2,-1] => 3
[-2,1] => 3
[-2,-1] => 4
[1,2,3] => 0
[1,2,-3] => 1
[1,-2,3] => 1
[1,-2,-3] => 2
[-1,2,3] => 1
[-1,2,-3] => 2
[-1,-2,3] => 2
[-1,-2,-3] => 3
[1,3,2] => 4
[1,3,-2] => 5
[1,-3,2] => 5
[1,-3,-2] => 6
[-1,3,2] => 5
[-1,3,-2] => 6
[-1,-3,2] => 6
[-1,-3,-2] => 7
[2,1,3] => 2
[2,1,-3] => 3
[2,-1,3] => 3
[2,-1,-3] => 4
[-2,1,3] => 3
[-2,1,-3] => 4
[-2,-1,3] => 4
[-2,-1,-3] => 5
[2,3,1] => 6
[2,3,-1] => 7
[2,-3,1] => 7
[2,-3,-1] => 8
[-2,3,1] => 7
[-2,3,-1] => 8
[-2,-3,1] => 8
[-2,-3,-1] => 9
[3,1,2] => 2
[3,1,-2] => 3
[3,-1,2] => 3
[3,-1,-2] => 4
[-3,1,2] => 3
[-3,1,-2] => 4
[-3,-1,2] => 4
[-3,-1,-2] => 5
Description
The flag Denert index of a signed permutation. The flag Denert index of a signed permutation σ is: fden(σ)=neg(σ)+2denB(σ), where denB(σ)=den(perm(σ)) is the Denert index of the associated permutation to σ.
Matching statistic: St001821
St001821: Signed permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 0
[-1] => 1
[1,2] => 0
[1,-2] => 3
[-1,2] => 1
[-1,-2] => 4
[2,1] => 1
[2,-1] => 2
[-2,1] => 3
[-2,-1] => 2
[1,2,3] => 0
[1,2,-3] => 5
[1,-2,3] => 3
[1,-2,-3] => 8
[-1,2,3] => 1
[-1,2,-3] => 6
[-1,-2,3] => 4
[-1,-2,-3] => 9
[1,3,2] => 1
[1,3,-2] => 4
[1,-3,2] => 7
[1,-3,-2] => 4
[-1,3,2] => 2
[-1,3,-2] => 5
[-1,-3,2] => 8
[-1,-3,-2] => 5
[2,1,3] => 1
[2,1,-3] => 6
[2,-1,3] => 2
[2,-1,-3] => 7
[-2,1,3] => 3
[-2,1,-3] => 8
[-2,-1,3] => 2
[-2,-1,-3] => 7
[2,3,1] => 2
[2,3,-1] => 3
[2,-3,1] => 6
[2,-3,-1] => 5
[-2,3,1] => 4
[-2,3,-1] => 3
[-2,-3,1] => 6
[-2,-3,-1] => 7
[3,1,2] => 3
[3,1,-2] => 5
[3,-1,2] => 4
[3,-1,-2] => 4
[-3,1,2] => 6
[-3,1,-2] => 4
[-3,-1,2] => 5
[-3,-1,-2] => 5
Description
The sorting index of a signed permutation. A signed permutation σ=[σ(1),,σ(n)] can be sorted [1,,n] by signed transpositions in the following way: First move ±n to its position and swap the sign if needed, then ±(n1),±(n2) and so on. For example for [2,4,5,1,3] we have the swaps [2,4,5,1,3][2,4,3,1,5][2,1,3,4,5][2,1,3,4,5][1,2,3,4,5] given by the signed transpositions (3,5),(2,4),(3,3),(1,2). If (i1,j1),,(in,jn) is the decomposition of σ obtained this way (including trivial transpositions) then the sorting index of σ is defined as sorB(σ)=n1k=1jkikχ(ik<0), where χ(ik<0) is 1 if ik is negative and 0 otherwise. For σ=[2,4,5,1,3] we have sorB(σ)=(53)+(4(2)1)+(3(3)1)+(21)=13.
Mp00166: Signed permutations even cycle typeInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000713: Integer partitions ⟶ ℤResult quality: 7% values known / values provided: 7%distinct values known / distinct values provided: 18%
Values
[1] => [1]
=> []
=> ? ∊ {0,1}
[-1] => []
=> ?
=> ? ∊ {0,1}
[1,2] => [1,1]
=> [1]
=> ? ∊ {0,1,1,2,2,3,3,4}
[1,-2] => [1]
=> []
=> ? ∊ {0,1,1,2,2,3,3,4}
[-1,2] => [1]
=> []
=> ? ∊ {0,1,1,2,2,3,3,4}
[-1,-2] => []
=> ?
=> ? ∊ {0,1,1,2,2,3,3,4}
[2,1] => [2]
=> []
=> ? ∊ {0,1,1,2,2,3,3,4}
[2,-1] => []
=> ?
=> ? ∊ {0,1,1,2,2,3,3,4}
[-2,1] => []
=> ?
=> ? ∊ {0,1,1,2,2,3,3,4}
[-2,-1] => [2]
=> []
=> ? ∊ {0,1,1,2,2,3,3,4}
[1,2,3] => [1,1,1]
=> [1,1]
=> 5
[1,2,-3] => [1,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,-2,3] => [1,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,-2,-3] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,2,3] => [1,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,2,-3] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,-2,3] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,-2,-3] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,3,2] => [2,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,3,-2] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,-3,2] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,-3,-2] => [2,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,3,2] => [2]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,3,-2] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,-3,2] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-1,-3,-2] => [2]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,1,3] => [2,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,1,-3] => [2]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,-1,3] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,-1,-3] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,1,3] => [1]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,1,-3] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,-1,3] => [2,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,-1,-3] => [2]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,3,1] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,3,-1] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,-3,1] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[2,-3,-1] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,3,1] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,3,-1] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,-3,1] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-2,-3,-1] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[3,1,2] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[3,1,-2] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[3,-1,2] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[3,-1,-2] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-3,1,2] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-3,1,-2] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-3,-1,2] => [3]
=> []
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[-3,-1,-2] => []
=> ?
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[3,2,1] => [2,1]
=> [1]
=> ? ∊ {0,1,1,1,2,2,2,2,2,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,6,6,6,6,6,6,6,7,7,7,7,7,8,8,8,9}
[1,2,3,4] => [1,1,1,1]
=> [1,1,1]
=> 0
[1,2,3,-4] => [1,1,1]
=> [1,1]
=> 5
[1,2,-3,4] => [1,1,1]
=> [1,1]
=> 5
[1,-2,3,4] => [1,1,1]
=> [1,1]
=> 5
[-1,2,3,4] => [1,1,1]
=> [1,1]
=> 5
[1,2,4,3] => [2,1,1]
=> [1,1]
=> 5
[1,2,-4,-3] => [2,1,1]
=> [1,1]
=> 5
[1,3,2,4] => [2,1,1]
=> [1,1]
=> 5
[1,-3,-2,4] => [2,1,1]
=> [1,1]
=> 5
[1,4,3,2] => [2,1,1]
=> [1,1]
=> 5
[1,-4,3,-2] => [2,1,1]
=> [1,1]
=> 5
[2,1,3,4] => [2,1,1]
=> [1,1]
=> 5
[-2,-1,3,4] => [2,1,1]
=> [1,1]
=> 5
[2,1,4,3] => [2,2]
=> [2]
=> 10
[2,1,-4,-3] => [2,2]
=> [2]
=> 10
[-2,-1,4,3] => [2,2]
=> [2]
=> 10
[-2,-1,-4,-3] => [2,2]
=> [2]
=> 10
[3,2,1,4] => [2,1,1]
=> [1,1]
=> 5
[-3,2,-1,4] => [2,1,1]
=> [1,1]
=> 5
[3,4,1,2] => [2,2]
=> [2]
=> 10
[3,-4,1,-2] => [2,2]
=> [2]
=> 10
[-3,4,-1,2] => [2,2]
=> [2]
=> 10
[-3,-4,-1,-2] => [2,2]
=> [2]
=> 10
[4,2,3,1] => [2,1,1]
=> [1,1]
=> 5
[-4,2,3,-1] => [2,1,1]
=> [1,1]
=> 5
[4,3,2,1] => [2,2]
=> [2]
=> 10
[4,-3,-2,1] => [2,2]
=> [2]
=> 10
[-4,3,2,-1] => [2,2]
=> [2]
=> 10
[-4,-3,-2,-1] => [2,2]
=> [2]
=> 10
Description
The dimension of the irreducible representation of Sp(4) labelled by an integer partition. Consider the symplectic group Sp(2n). Then the integer partition (μ1,,μk) of length at most n corresponds to the weight vector (μ1μ2,,μk2μk1,μn,0,,0). For example, the integer partition (2) labels the symmetric square of the vector representation, whereas the integer partition (1,1) labels the second fundamental representation.