Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001857
(load all 2 compositions to match this statistic)
Mapping
St001857: Signed permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 0
[-1] => 0
[1,2] => 0
[1,-2] => 0
[-1,2] => 0
[-1,-2] => 1
[2,1] => 0
[2,-1] => 0
[-2,1] => 0
[-2,-1] => 0
[1,2,3] => 0
[1,2,-3] => 0
[1,-2,3] => 0
[1,-2,-3] => 1
[-1,2,3] => 0
[-1,2,-3] => 3
[-1,-2,3] => 17
[-1,-2,-3] => 60
[1,3,2] => 0
[1,3,-2] => 0
[1,-3,2] => 0
[1,-3,-2] => 0
[-1,3,2] => 3
[-1,3,-2] => 10
[-1,-3,2] => 10
[-1,-3,-2] => 22
[2,1,3] => 0
[2,1,-3] => 1
[2,-1,3] => 0
[2,-1,-3] => 2
[-2,1,3] => 0
[-2,1,-3] => 2
[-2,-1,3] => 5
[-2,-1,-3] => 13
[2,3,1] => 0
[2,3,-1] => 0
[2,-3,1] => 1
[2,-3,-1] => 1
[-2,3,1] => 2
[-2,3,-1] => 5
[-2,-3,1] => 4
[-2,-3,-1] => 7
[3,1,2] => 0
[3,1,-2] => 1
[3,-1,2] => 2
[3,-1,-2] => 4
[-3,1,2] => 0
[-3,1,-2] => 1
[-3,-1,2] => 5
[-3,-1,-2] => 7
Description
The number of edges in the reduced word graph of a signed permutation. The reduced word graph of a signed permutation $\pi$ has the reduced words of $\pi$ as vertices and an edge between two reduced words if they differ by exactly one braid move.