searching the database
Your data matches 1 statistic 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: St001085
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001085: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00132: Dyck paths —switch returns and last double rise⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001085: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 0
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1
[2,1]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 0
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,3,4,2,1] => 0
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 0
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 0
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [6,5,3,4,2,1] => 0
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,5,4,3,2,1,7] => 1
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,5,4,3,2,6] => 0
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 0
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => 0
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 0
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,6,4,5,3,2] => 0
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [7,6,5,4,3,2,1,8] => 1
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,1,5,4,3,6] => 1
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [5,2,4,3,1,6] => 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 1
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 0
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => 1
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 0
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,6,4,3,5,2] => 0
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [5,2,3,4,1] => 0
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [2,6,4,5,3,1] => 0
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,7,6,4,5,3,2] => 0
[8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [8,7,6,5,4,3,2,1,9] => 1
[6,1,1]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [6,3,5,4,2,1,7] => 1
[5,3]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [3,2,1,5,4,6] => 1
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,2,5,4,3,6] => 0
[5,1,1,1]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [2,5,4,3,1,6] => 1
[4,4]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,4,3,2,6,1] => 1
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 2
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 0
Description
The number of occurrences of the vincular pattern |21-3 in a permutation.
This is the number of occurrences of the pattern $213$, where the first matched entry is the first entry of the permutation and the other two matched entries are consecutive.
In other words, this is the number of ascents whose bottom value is strictly smaller and the top value is strictly larger than the first entry of the 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!