searching the database
Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001427
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
St001427: 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] => 1
[2,-1] => 1
[-2,1] => 1
[-2,-1] => 1
[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] => 1
[1,3,-2] => 1
[1,-3,2] => 1
[1,-3,-2] => 1
[-1,3,2] => 2
[-1,3,-2] => 2
[-1,-3,2] => 2
[-1,-3,-2] => 2
[2,1,3] => 1
[2,1,-3] => 2
[2,-1,3] => 1
[2,-1,-3] => 2
[-2,1,3] => 1
[-2,1,-3] => 2
[-2,-1,3] => 1
[-2,-1,-3] => 2
[2,3,1] => 1
[2,3,-1] => 1
[2,-3,1] => 1
[2,-3,-1] => 1
[-2,3,1] => 2
[-2,3,-1] => 2
[-2,-3,1] => 2
[-2,-3,-1] => 2
[3,1,2] => 1
[3,1,-2] => 2
[3,-1,2] => 1
[3,-1,-2] => 2
[-3,1,2] => 1
[-3,1,-2] => 2
[-3,-1,2] => 1
[-3,-1,-2] => 2
Description
The number of descents of a signed permutation.
A descent of a signed permutation $\sigma$ of length $n$ is an index $0 \leq i < n$ such that $\sigma(i) > \sigma(i+1)$, setting $\sigma(0) = 0$.
Matching statistic: St001896
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00162: Signed permutations —inverse⟶ Signed permutations
Mp00190: Signed permutations —Foata-Han⟶ Signed permutations
St001896: Signed permutations ⟶ ℤResult quality: 31% ●values known / values provided: 31%●distinct values known / distinct values provided: 75%
Mp00190: Signed permutations —Foata-Han⟶ Signed permutations
St001896: Signed permutations ⟶ ℤResult quality: 31% ●values known / values provided: 31%●distinct values known / distinct values provided: 75%
Values
[1] => [1] => [1] => 0
[-1] => [-1] => [-1] => 1
[1,2] => [1,2] => [1,2] => 0
[1,-2] => [1,-2] => [1,-2] => 1
[-1,2] => [-1,2] => [-1,2] => 1
[-1,-2] => [-1,-2] => [-1,-2] => 2
[2,1] => [2,1] => [-2,1] => 1
[2,-1] => [-2,1] => [2,1] => 1
[-2,1] => [2,-1] => [-2,-1] => 1
[-2,-1] => [-2,-1] => [2,-1] => 1
[1,2,3] => [1,2,3] => [1,2,3] => 0
[1,2,-3] => [1,2,-3] => [1,2,-3] => 1
[1,-2,3] => [1,-2,3] => [1,-2,3] => 1
[1,-2,-3] => [1,-2,-3] => [1,-2,-3] => 2
[-1,2,3] => [-1,2,3] => [-1,2,3] => 1
[-1,2,-3] => [-1,2,-3] => [-1,2,-3] => 2
[-1,-2,3] => [-1,-2,3] => [-1,-2,3] => 2
[-1,-2,-3] => [-1,-2,-3] => [-1,-2,-3] => 3
[1,3,2] => [1,3,2] => [1,-3,2] => 1
[1,3,-2] => [1,-3,2] => [-3,1,2] => 1
[1,-3,2] => [1,3,-2] => [3,1,-2] => 1
[1,-3,-2] => [1,-3,-2] => [1,3,-2] => 1
[-1,3,2] => [-1,3,2] => [-1,-3,2] => 2
[-1,3,-2] => [-1,-3,2] => [-3,-1,2] => 2
[-1,-3,2] => [-1,3,-2] => [3,-1,-2] => 2
[-1,-3,-2] => [-1,-3,-2] => [-1,3,-2] => 2
[2,1,3] => [2,1,3] => [-2,1,3] => 1
[2,1,-3] => [2,1,-3] => [-2,1,-3] => 2
[2,-1,3] => [-2,1,3] => [2,1,3] => 1
[2,-1,-3] => [-2,1,-3] => [2,1,-3] => 2
[-2,1,3] => [2,-1,3] => [-2,-1,3] => 1
[-2,1,-3] => [2,-1,-3] => [-2,-1,-3] => 2
[-2,-1,3] => [-2,-1,3] => [2,-1,3] => 1
[-2,-1,-3] => [-2,-1,-3] => [2,-1,-3] => 2
[2,3,1] => [3,1,2] => [3,1,2] => 1
[2,3,-1] => [-3,1,2] => [1,3,2] => 1
[2,-3,1] => [3,1,-2] => [1,-3,-2] => 1
[2,-3,-1] => [-3,1,-2] => [-3,1,-2] => 1
[-2,3,1] => [3,-1,2] => [3,-1,2] => 2
[-2,3,-1] => [-3,-1,2] => [-1,3,2] => 2
[-2,-3,1] => [3,-1,-2] => [-1,-3,-2] => 2
[-2,-3,-1] => [-3,-1,-2] => [-3,-1,-2] => 2
[3,1,2] => [2,3,1] => [3,-2,1] => 1
[3,1,-2] => [2,-3,1] => [3,2,1] => 2
[3,-1,2] => [-2,3,1] => [-3,-2,1] => 1
[3,-1,-2] => [-2,-3,1] => [-3,2,1] => 2
[-3,1,2] => [2,3,-1] => [3,-2,-1] => 1
[-3,1,-2] => [2,-3,-1] => [3,2,-1] => 2
[-3,-1,2] => [-2,3,-1] => [-3,-2,-1] => 1
[-3,-1,-2] => [-2,-3,-1] => [-3,2,-1] => 2
[1,2,4,5,-3] => [1,2,-5,3,4] => [-5,1,2,3,4] => ? = 1
[1,2,-4,-5,3] => [1,2,5,-3,-4] => [5,1,2,-3,-4] => ? = 2
[1,-3,2,4,5] => [1,3,-2,4,5] => [3,1,-2,4,5] => ? = 1
[1,-3,2,-5,4] => [1,3,-2,5,-4] => [3,1,5,-2,-4] => ? = 2
[1,3,4,2,5] => [1,4,2,3,5] => [-4,1,2,3,5] => ? = 1
[1,3,4,2,-5] => [1,4,2,3,-5] => [-4,1,2,3,-5] => ? = 2
[1,-3,-4,2,5] => [1,4,-2,-3,5] => [-4,1,-2,-3,5] => ? = 2
[-1,3,4,2,5] => [-1,4,2,3,5] => [-4,-1,2,3,5] => ? = 2
[-1,-3,-4,-2,-5] => [-1,-4,-2,-3,-5] => [4,-1,-2,-3,-5] => ? = 4
[1,3,4,5,2] => [1,5,2,3,4] => [5,1,2,3,4] => ? = 1
[-1,3,4,5,2] => [-1,5,2,3,4] => [5,-1,2,3,4] => ? = 2
[-1,-3,-4,-5,-2] => [-1,-5,-2,-3,-4] => [-5,-1,-2,-3,-4] => ? = 4
[1,3,5,2,-4] => [1,4,2,-5,3] => [-4,1,-5,2,3] => ? = 2
[1,-3,5,2,4] => [1,4,-2,5,3] => [5,1,-2,-4,3] => ? = 2
[1,3,5,4,2] => [1,5,2,4,3] => [-4,1,2,-5,3] => ? = 2
[1,3,5,4,-2] => [1,-5,2,4,3] => [4,1,2,-5,3] => ? = 2
[1,-3,5,-4,2] => [1,5,-2,-4,3] => [5,1,-4,-2,3] => ? = 2
[-1,3,5,4,2] => [-1,5,2,4,3] => [-4,-1,2,-5,3] => ? = 3
[-1,-3,-5,-4,-2] => [-1,-5,-2,-4,-3] => [4,-1,-2,5,-3] => ? = 3
[1,-4,2,3,5] => [1,3,4,-2,5] => [3,4,1,-2,5] => ? = 1
[1,4,2,5,-3] => [1,3,-5,2,4] => [5,1,3,2,4] => ? = 2
[1,4,2,-5,3] => [1,3,5,2,-4] => [5,1,-3,2,-4] => ? = 2
[1,4,3,5,-2] => [1,-5,3,2,4] => [-3,-5,1,2,4] => ? = 2
[1,4,5,2,3] => [1,4,5,2,3] => [-4,1,5,2,3] => ? = 1
[1,4,5,2,-3] => [1,4,-5,2,3] => [5,1,2,4,3] => ? = 2
[1,4,-5,2,3] => [1,4,5,2,-3] => [5,1,2,-4,-3] => ? = 1
[-1,4,5,2,3] => [-1,4,5,2,3] => [-4,-1,5,2,3] => ? = 2
[-1,-4,-5,-2,-3] => [-1,-4,-5,-2,-3] => [4,-1,-5,-2,-3] => ? = 4
[1,4,5,3,2] => [1,5,4,2,3] => [-4,-5,1,2,3] => ? = 2
[1,4,5,3,-2] => [1,-5,4,2,3] => [4,-5,1,2,3] => ? = 2
[1,4,5,-3,2] => [1,5,-4,2,3] => [-4,1,2,5,3] => ? = 1
[-1,4,5,3,2] => [-1,5,4,2,3] => [-4,-5,-1,2,3] => ? = 3
[-1,-4,-5,-3,-2] => [-1,-5,-4,-2,-3] => [4,5,-1,-2,-3] => ? = 3
[1,5,2,3,-4] => [1,3,4,-5,2] => [-5,1,3,4,2] => ? = 2
[1,-5,2,3,4] => [1,3,4,5,-2] => [3,4,5,1,-2] => ? = 1
[1,-5,2,4,3] => [1,3,5,4,-2] => [3,4,1,-5,-2] => ? = 2
[1,5,3,2,-4] => [1,4,3,-5,2] => [-4,-5,1,3,2] => ? = 3
[1,-5,3,2,4] => [1,4,3,5,-2] => [3,1,5,-4,-2] => ? = 2
[1,-5,-3,2,4] => [1,4,-3,5,-2] => [-4,5,1,-3,-2] => ? = 1
[1,5,3,4,2] => [1,5,3,4,2] => [-3,1,4,-5,2] => ? = 2
[1,5,3,4,-2] => [1,-5,3,4,2] => [3,1,4,-5,2] => ? = 2
[-1,5,3,4,2] => [-1,5,3,4,2] => [-3,-1,4,-5,2] => ? = 3
[-1,-5,-3,-4,-2] => [-1,-5,-3,-4,-2] => [3,-1,-4,5,-2] => ? = 3
[1,5,4,2,-3] => [1,4,-5,3,2] => [-4,1,3,-5,2] => ? = 3
[1,-5,4,2,3] => [1,4,5,3,-2] => [5,3,1,-4,-2] => ? = 2
[1,-5,-4,2,3] => [1,4,5,-3,-2] => [3,4,1,5,-2] => ? = 1
[1,5,4,3,-2] => [1,-5,4,3,2] => [-3,1,-4,-5,2] => ? = 3
[1,-5,4,3,2] => [1,5,4,3,-2] => [3,1,-4,-5,-2] => ? = 3
[2,1,3,4,5] => [2,1,3,4,5] => [-2,1,3,4,5] => ? = 1
[2,1,3,4,-5] => [2,1,3,4,-5] => [-2,1,3,4,-5] => ? = 2
Description
The number of right descents of a signed permutations.
An index is a right descent if it is a left descent of the inverse signed permutation.
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!