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: St000359
Mp00053: Parking functions —to car permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1] => 0
[1,1] => [1,2] => [1,2] => [1,2] => 0
[1,2] => [1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => [2,1] => 0
[1,1,1] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,1,2] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,2,1] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[2,1,1] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[1,1,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,1] => [1,3,2] => [2,3,1] => [3,1,2] => 0
[3,1,1] => [2,3,1] => [3,1,2] => [1,3,2] => 0
[1,2,2] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[2,1,2] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[2,2,1] => [3,1,2] => [1,3,2] => [2,3,1] => 1
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [2,3,1] => [3,1,2] => 0
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[2,3,1] => [3,1,2] => [1,3,2] => [2,3,1] => 1
[3,1,2] => [2,3,1] => [3,1,2] => [1,3,2] => 0
[3,2,1] => [3,2,1] => [3,2,1] => [3,2,1] => 0
[1,1,1,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,1,1,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,1,2,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,1,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[2,1,1,1] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[1,1,1,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,1,3,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,3,1,1] => [1,3,2,4] => [2,3,1,4] => [3,1,2,4] => 0
[3,1,1,1] => [2,3,1,4] => [3,1,2,4] => [1,3,2,4] => 0
[1,1,1,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,1,4,1] => [1,2,4,3] => [2,3,4,1] => [4,1,2,3] => 0
[1,4,1,1] => [1,3,4,2] => [2,4,1,3] => [1,3,4,2] => 1
[4,1,1,1] => [2,3,4,1] => [4,1,2,3] => [1,2,4,3] => 0
[1,1,2,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,1,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,2,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[2,1,1,2] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[2,1,2,1] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[2,2,1,1] => [3,1,2,4] => [1,3,2,4] => [2,3,1,4] => 1
[1,1,2,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,1,3,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,1,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,2,3,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,3,1,2] => [1,3,2,4] => [2,3,1,4] => [3,1,2,4] => 0
[1,3,2,1] => [1,3,2,4] => [2,3,1,4] => [3,1,2,4] => 0
[2,1,1,3] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[2,1,3,1] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 0
[2,3,1,1] => [3,1,2,4] => [1,3,2,4] => [2,3,1,4] => 1
[3,1,1,2] => [2,3,1,4] => [3,1,2,4] => [1,3,2,4] => 0
[3,1,2,1] => [2,3,1,4] => [3,1,2,4] => [1,3,2,4] => 0
Description
The number of occurrences of the pattern 23-1.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $23\!\!-\!\!1$.
Matching statistic: St001857
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00053: Parking functions —to car permutation⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001857: Signed permutations ⟶ ℤResult quality: 0% ●values known / values provided: 0%●distinct values known / distinct values provided: 25%
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001857: Signed permutations ⟶ ℤResult quality: 0% ●values known / values provided: 0%●distinct values known / distinct values provided: 25%
Values
[1] => [1] => [1] => [1] => 0
[1,1] => [1,2] => [1,2] => [1,2] => 0
[1,2] => [1,2] => [1,2] => [1,2] => 0
[2,1] => [2,1] => [2,1] => [2,1] => 0
[1,1,1] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,1,2] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,2,1] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[2,1,1] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[1,1,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,1] => [1,3,2] => [1,3,2] => [1,3,2] => 0
[3,1,1] => [2,3,1] => [3,1,2] => [3,1,2] => 0
[1,2,2] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[2,1,2] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[2,2,1] => [3,1,2] => [3,2,1] => [3,2,1] => 1
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,3,2] => [1,3,2] => [1,3,2] => [1,3,2] => 0
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 0
[2,3,1] => [3,1,2] => [3,2,1] => [3,2,1] => 1
[3,1,2] => [2,3,1] => [3,1,2] => [3,1,2] => 0
[3,2,1] => [3,2,1] => [2,3,1] => [2,3,1] => 0
[1,1,1,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,1,1,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,1,2,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,2,1,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[2,1,1,1] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ? = 0
[1,1,1,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,1,3,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,3,1,1] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => ? = 0
[3,1,1,1] => [2,3,1,4] => [3,1,2,4] => [3,1,2,4] => ? = 0
[1,1,1,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,1,4,1] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => ? = 0
[1,4,1,1] => [1,3,4,2] => [1,4,2,3] => [1,4,2,3] => ? = 1
[4,1,1,1] => [2,3,4,1] => [4,1,2,3] => [4,1,2,3] => ? = 0
[1,1,2,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,2,1,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,2,2,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[2,1,1,2] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ? = 0
[2,1,2,1] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ? = 0
[2,2,1,1] => [3,1,2,4] => [3,2,1,4] => [3,2,1,4] => ? = 1
[1,1,2,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,1,3,2] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,2,1,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,2,3,1] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,3,1,2] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => ? = 0
[1,3,2,1] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => ? = 0
[2,1,1,3] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ? = 0
[2,1,3,1] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ? = 0
[2,3,1,1] => [3,1,2,4] => [3,2,1,4] => [3,2,1,4] => ? = 1
[3,1,1,2] => [2,3,1,4] => [3,1,2,4] => [3,1,2,4] => ? = 0
[3,1,2,1] => [2,3,1,4] => [3,1,2,4] => [3,1,2,4] => ? = 0
[3,2,1,1] => [3,2,1,4] => [2,3,1,4] => [2,3,1,4] => ? = 0
[1,1,2,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,1,4,2] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => ? = 0
[1,2,1,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,2,4,1] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => ? = 0
[1,4,1,2] => [1,3,4,2] => [1,4,2,3] => [1,4,2,3] => ? = 1
[1,4,2,1] => [1,3,4,2] => [1,4,2,3] => [1,4,2,3] => ? = 1
[2,1,1,4] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => ? = 0
[2,1,4,1] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => ? = 0
[2,4,1,1] => [3,1,4,2] => [4,2,1,3] => [4,2,1,3] => ? = 0
[4,1,1,2] => [2,3,4,1] => [4,1,2,3] => [4,1,2,3] => ? = 0
[4,1,2,1] => [2,3,4,1] => [4,1,2,3] => [4,1,2,3] => ? = 0
[4,2,1,1] => [3,2,4,1] => [2,4,1,3] => [2,4,1,3] => ? = 0
[1,1,3,3] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
[1,3,1,3] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => ? = 0
[1,3,3,1] => [1,4,2,3] => [1,4,3,2] => [1,4,3,2] => ? = 1
[3,1,1,3] => [2,3,1,4] => [3,1,2,4] => [3,1,2,4] => ? = 0
[3,1,3,1] => [2,4,1,3] => [4,3,1,2] => [4,3,1,2] => ? = 1
[3,3,1,1] => [3,4,1,2] => [3,1,4,2] => [3,1,4,2] => ? = 0
[1,1,3,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => ? = 0
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.
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!