searching the database
Your data matches 47 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: St000225
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
St000225: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 0 = 1 - 1
[1,1]
=> 0 = 1 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 1 = 2 - 1
[1,1,1]
=> 0 = 1 - 1
[4]
=> 0 = 1 - 1
[3,1]
=> 2 = 3 - 1
[2,2]
=> 0 = 1 - 1
[2,1,1]
=> 1 = 2 - 1
[1,1,1,1]
=> 0 = 1 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 3 = 4 - 1
[3,2]
=> 1 = 2 - 1
[3,1,1]
=> 2 = 3 - 1
[2,2,1]
=> 1 = 2 - 1
[2,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> 0 = 1 - 1
[6]
=> 0 = 1 - 1
[5,1]
=> 4 = 5 - 1
[4,2]
=> 2 = 3 - 1
[4,1,1]
=> 3 = 4 - 1
[3,3]
=> 0 = 1 - 1
[3,2,1]
=> 2 = 3 - 1
[3,1,1,1]
=> 2 = 3 - 1
[2,2,2]
=> 0 = 1 - 1
[2,2,1,1]
=> 1 = 2 - 1
[2,1,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> 0 = 1 - 1
[7]
=> 0 = 1 - 1
[6,1]
=> 5 = 6 - 1
[5,2]
=> 3 = 4 - 1
[5,1,1]
=> 4 = 5 - 1
[4,3]
=> 1 = 2 - 1
[4,2,1]
=> 3 = 4 - 1
[4,1,1,1]
=> 3 = 4 - 1
[3,3,1]
=> 2 = 3 - 1
[3,2,2]
=> 1 = 2 - 1
[3,2,1,1]
=> 2 = 3 - 1
[3,1,1,1,1]
=> 2 = 3 - 1
[2,2,2,1]
=> 1 = 2 - 1
[2,2,1,1,1]
=> 1 = 2 - 1
[2,1,1,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1,1,1]
=> 0 = 1 - 1
[8]
=> 0 = 1 - 1
[7,1]
=> 6 = 7 - 1
[6,2]
=> 4 = 5 - 1
[6,1,1]
=> 5 = 6 - 1
[5,3]
=> 2 = 3 - 1
[5,2,1]
=> 4 = 5 - 1
Description
Difference between largest and smallest parts in a partition.
Matching statistic: St001804
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St001804: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
St001804: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> [[1]]
=> 1
[2]
=> [1,1]
=> [[1],[2]]
=> 1
[1,1]
=> [2]
=> [[1,2]]
=> 1
[3]
=> [1,1,1]
=> [[1],[2],[3]]
=> 1
[2,1]
=> [2,1]
=> [[1,3],[2]]
=> 2
[1,1,1]
=> [3]
=> [[1,2,3]]
=> 1
[4]
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> 1
[3,1]
=> [2,1,1]
=> [[1,4],[2],[3]]
=> 3
[2,2]
=> [2,2]
=> [[1,2],[3,4]]
=> 1
[2,1,1]
=> [3,1]
=> [[1,3,4],[2]]
=> 2
[1,1,1,1]
=> [4]
=> [[1,2,3,4]]
=> 1
[5]
=> [1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> 1
[4,1]
=> [2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> 4
[3,2]
=> [2,2,1]
=> [[1,3],[2,5],[4]]
=> 2
[3,1,1]
=> [3,1,1]
=> [[1,4,5],[2],[3]]
=> 3
[2,2,1]
=> [3,2]
=> [[1,2,5],[3,4]]
=> 2
[2,1,1,1]
=> [4,1]
=> [[1,3,4,5],[2]]
=> 2
[1,1,1,1,1]
=> [5]
=> [[1,2,3,4,5]]
=> 1
[6]
=> [1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> 1
[5,1]
=> [2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> 5
[4,2]
=> [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> 3
[4,1,1]
=> [3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> 4
[3,3]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> 1
[3,2,1]
=> [3,2,1]
=> [[1,3,6],[2,5],[4]]
=> 3
[3,1,1,1]
=> [4,1,1]
=> [[1,4,5,6],[2],[3]]
=> 3
[2,2,2]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> 1
[2,2,1,1]
=> [4,2]
=> [[1,2,5,6],[3,4]]
=> 2
[2,1,1,1,1]
=> [5,1]
=> [[1,3,4,5,6],[2]]
=> 2
[1,1,1,1,1,1]
=> [6]
=> [[1,2,3,4,5,6]]
=> 1
[7]
=> [1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> 1
[6,1]
=> [2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> 6
[5,2]
=> [2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> 4
[5,1,1]
=> [3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> 5
[4,3]
=> [2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> 2
[4,2,1]
=> [3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> 4
[4,1,1,1]
=> [4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> 4
[3,3,1]
=> [3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> 3
[3,2,2]
=> [3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> 2
[3,2,1,1]
=> [4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> 3
[3,1,1,1,1]
=> [5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> 3
[2,2,2,1]
=> [4,3]
=> [[1,2,3,7],[4,5,6]]
=> 2
[2,2,1,1,1]
=> [5,2]
=> [[1,2,5,6,7],[3,4]]
=> 2
[2,1,1,1,1,1]
=> [6,1]
=> [[1,3,4,5,6,7],[2]]
=> 2
[1,1,1,1,1,1,1]
=> [7]
=> [[1,2,3,4,5,6,7]]
=> 1
[8]
=> [1,1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> 1
[7,1]
=> [2,1,1,1,1,1,1]
=> [[1,8],[2],[3],[4],[5],[6],[7]]
=> 7
[6,2]
=> [2,2,1,1,1,1]
=> [[1,6],[2,8],[3],[4],[5],[7]]
=> 5
[6,1,1]
=> [3,1,1,1,1,1]
=> [[1,7,8],[2],[3],[4],[5],[6]]
=> 6
[5,3]
=> [2,2,2,1,1]
=> [[1,4],[2,6],[3,8],[5],[7]]
=> 3
[5,2,1]
=> [3,2,1,1,1]
=> [[1,5,8],[2,7],[3],[4],[6]]
=> 5
Description
The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau.
A cylindrical tableau associated with a standard Young tableau $T$ is the skew row-strict tableau obtained by gluing two copies of $T$ such that the inner shape is a rectangle.
This statistic equals $\max_C\big(\ell(C) - \ell(T)\big)$, where $\ell$ denotes the number of rows of a tableau and the maximum is taken over all cylindrical tableaux.
Matching statistic: St000288
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00280: Binary words —path rowmotion⟶ Binary words
St000288: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00105: Binary words —complement⟶ Binary words
Mp00280: Binary words —path rowmotion⟶ Binary words
St000288: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 10 => 01 => 10 => 1
[2]
=> 100 => 011 => 100 => 1
[1,1]
=> 110 => 001 => 010 => 1
[3]
=> 1000 => 0111 => 1000 => 1
[2,1]
=> 1010 => 0101 => 1010 => 2
[1,1,1]
=> 1110 => 0001 => 0010 => 1
[4]
=> 10000 => 01111 => 10000 => 1
[3,1]
=> 10010 => 01101 => 10110 => 3
[2,2]
=> 1100 => 0011 => 0100 => 1
[2,1,1]
=> 10110 => 01001 => 10010 => 2
[1,1,1,1]
=> 11110 => 00001 => 00010 => 1
[5]
=> 100000 => 011111 => 100000 => 1
[4,1]
=> 100010 => 011101 => 101110 => 4
[3,2]
=> 10100 => 01011 => 10100 => 2
[3,1,1]
=> 100110 => 011001 => 100110 => 3
[2,2,1]
=> 11010 => 00101 => 01010 => 2
[2,1,1,1]
=> 101110 => 010001 => 100010 => 2
[1,1,1,1,1]
=> 111110 => 000001 => 000010 => 1
[6]
=> 1000000 => 0111111 => 1000000 => 1
[5,1]
=> 1000010 => 0111101 => 1011110 => 5
[4,2]
=> 100100 => 011011 => 101100 => 3
[4,1,1]
=> 1000110 => 0111001 => 1001110 => 4
[3,3]
=> 11000 => 00111 => 01000 => 1
[3,2,1]
=> 101010 => 010101 => 101010 => 3
[3,1,1,1]
=> 1001110 => 0110001 => 1000110 => 3
[2,2,2]
=> 11100 => 00011 => 00100 => 1
[2,2,1,1]
=> 110110 => 001001 => 010010 => 2
[2,1,1,1,1]
=> 1011110 => 0100001 => 1000010 => 2
[1,1,1,1,1,1]
=> 1111110 => 0000001 => 0000010 => 1
[7]
=> 10000000 => 01111111 => 10000000 => 1
[6,1]
=> 10000010 => 01111101 => 10111110 => 6
[5,2]
=> 1000100 => 0111011 => 1011100 => 4
[5,1,1]
=> 10000110 => 01111001 => 10011110 => 5
[4,3]
=> 101000 => 010111 => 101000 => 2
[4,2,1]
=> 1001010 => 0110101 => 1011010 => 4
[4,1,1,1]
=> 10001110 => 01110001 => 10001110 => 4
[3,3,1]
=> 110010 => 001101 => 010110 => 3
[3,2,2]
=> 101100 => 010011 => 100100 => 2
[3,2,1,1]
=> 1010110 => 0101001 => 1010010 => 3
[3,1,1,1,1]
=> 10011110 => 01100001 => 10000110 => 3
[2,2,2,1]
=> 111010 => 000101 => 001010 => 2
[2,2,1,1,1]
=> 1101110 => 0010001 => 0100010 => 2
[2,1,1,1,1,1]
=> 10111110 => 01000001 => 10000010 => 2
[1,1,1,1,1,1,1]
=> 11111110 => 00000001 => 00000010 => 1
[8]
=> 100000000 => 011111111 => 100000000 => 1
[7,1]
=> 100000010 => 011111101 => 101111110 => 7
[6,2]
=> 10000100 => 01111011 => 10111100 => 5
[6,1,1]
=> 100000110 => 011111001 => 100111110 => 6
[5,3]
=> 1001000 => 0110111 => 1011000 => 3
[5,2,1]
=> 10001010 => 01110101 => 10111010 => 5
Description
The number of ones in a binary word.
This is also known as the Hamming weight of the word.
Matching statistic: St000147
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00189: Skew partitions —rotate⟶ Skew partitions
Mp00183: Skew partitions —inner shape⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00189: Skew partitions —rotate⟶ Skew partitions
Mp00183: Skew partitions —inner shape⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [[1],[]]
=> [[1],[]]
=> []
=> 0 = 1 - 1
[2]
=> [[2],[]]
=> [[2],[]]
=> []
=> 0 = 1 - 1
[1,1]
=> [[1,1],[]]
=> [[1,1],[]]
=> []
=> 0 = 1 - 1
[3]
=> [[3],[]]
=> [[3],[]]
=> []
=> 0 = 1 - 1
[2,1]
=> [[2,1],[]]
=> [[2,2],[1]]
=> [1]
=> 1 = 2 - 1
[1,1,1]
=> [[1,1,1],[]]
=> [[1,1,1],[]]
=> []
=> 0 = 1 - 1
[4]
=> [[4],[]]
=> [[4],[]]
=> []
=> 0 = 1 - 1
[3,1]
=> [[3,1],[]]
=> [[3,3],[2]]
=> [2]
=> 2 = 3 - 1
[2,2]
=> [[2,2],[]]
=> [[2,2],[]]
=> []
=> 0 = 1 - 1
[2,1,1]
=> [[2,1,1],[]]
=> [[2,2,2],[1,1]]
=> [1,1]
=> 1 = 2 - 1
[1,1,1,1]
=> [[1,1,1,1],[]]
=> [[1,1,1,1],[]]
=> []
=> 0 = 1 - 1
[5]
=> [[5],[]]
=> [[5],[]]
=> []
=> 0 = 1 - 1
[4,1]
=> [[4,1],[]]
=> [[4,4],[3]]
=> [3]
=> 3 = 4 - 1
[3,2]
=> [[3,2],[]]
=> [[3,3],[1]]
=> [1]
=> 1 = 2 - 1
[3,1,1]
=> [[3,1,1],[]]
=> [[3,3,3],[2,2]]
=> [2,2]
=> 2 = 3 - 1
[2,2,1]
=> [[2,2,1],[]]
=> [[2,2,2],[1]]
=> [1]
=> 1 = 2 - 1
[2,1,1,1]
=> [[2,1,1,1],[]]
=> [[2,2,2,2],[1,1,1]]
=> [1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [[1,1,1,1,1],[]]
=> [[1,1,1,1,1],[]]
=> []
=> 0 = 1 - 1
[6]
=> [[6],[]]
=> [[6],[]]
=> []
=> 0 = 1 - 1
[5,1]
=> [[5,1],[]]
=> [[5,5],[4]]
=> [4]
=> 4 = 5 - 1
[4,2]
=> [[4,2],[]]
=> [[4,4],[2]]
=> [2]
=> 2 = 3 - 1
[4,1,1]
=> [[4,1,1],[]]
=> [[4,4,4],[3,3]]
=> [3,3]
=> 3 = 4 - 1
[3,3]
=> [[3,3],[]]
=> [[3,3],[]]
=> []
=> 0 = 1 - 1
[3,2,1]
=> [[3,2,1],[]]
=> [[3,3,3],[2,1]]
=> [2,1]
=> 2 = 3 - 1
[3,1,1,1]
=> [[3,1,1,1],[]]
=> [[3,3,3,3],[2,2,2]]
=> [2,2,2]
=> 2 = 3 - 1
[2,2,2]
=> [[2,2,2],[]]
=> [[2,2,2],[]]
=> []
=> 0 = 1 - 1
[2,2,1,1]
=> [[2,2,1,1],[]]
=> [[2,2,2,2],[1,1]]
=> [1,1]
=> 1 = 2 - 1
[2,1,1,1,1]
=> [[2,1,1,1,1],[]]
=> [[2,2,2,2,2],[1,1,1,1]]
=> [1,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> [[1,1,1,1,1,1],[]]
=> [[1,1,1,1,1,1],[]]
=> []
=> 0 = 1 - 1
[7]
=> [[7],[]]
=> [[7],[]]
=> []
=> 0 = 1 - 1
[6,1]
=> [[6,1],[]]
=> [[6,6],[5]]
=> [5]
=> 5 = 6 - 1
[5,2]
=> [[5,2],[]]
=> [[5,5],[3]]
=> [3]
=> 3 = 4 - 1
[5,1,1]
=> [[5,1,1],[]]
=> [[5,5,5],[4,4]]
=> [4,4]
=> 4 = 5 - 1
[4,3]
=> [[4,3],[]]
=> [[4,4],[1]]
=> [1]
=> 1 = 2 - 1
[4,2,1]
=> [[4,2,1],[]]
=> [[4,4,4],[3,2]]
=> [3,2]
=> 3 = 4 - 1
[4,1,1,1]
=> [[4,1,1,1],[]]
=> [[4,4,4,4],[3,3,3]]
=> [3,3,3]
=> 3 = 4 - 1
[3,3,1]
=> [[3,3,1],[]]
=> [[3,3,3],[2]]
=> [2]
=> 2 = 3 - 1
[3,2,2]
=> [[3,2,2],[]]
=> [[3,3,3],[1,1]]
=> [1,1]
=> 1 = 2 - 1
[3,2,1,1]
=> [[3,2,1,1],[]]
=> [[3,3,3,3],[2,2,1]]
=> [2,2,1]
=> 2 = 3 - 1
[3,1,1,1,1]
=> [[3,1,1,1,1],[]]
=> [[3,3,3,3,3],[2,2,2,2]]
=> [2,2,2,2]
=> 2 = 3 - 1
[2,2,2,1]
=> [[2,2,2,1],[]]
=> [[2,2,2,2],[1]]
=> [1]
=> 1 = 2 - 1
[2,2,1,1,1]
=> [[2,2,1,1,1],[]]
=> [[2,2,2,2,2],[1,1,1]]
=> [1,1,1]
=> 1 = 2 - 1
[2,1,1,1,1,1]
=> [[2,1,1,1,1,1],[]]
=> [[2,2,2,2,2,2],[1,1,1,1,1]]
=> [1,1,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1,1,1]
=> [[1,1,1,1,1,1,1],[]]
=> [[1,1,1,1,1,1,1],[]]
=> []
=> 0 = 1 - 1
[8]
=> [[8],[]]
=> [[8],[]]
=> []
=> 0 = 1 - 1
[7,1]
=> [[7,1],[]]
=> [[7,7],[6]]
=> [6]
=> 6 = 7 - 1
[6,2]
=> [[6,2],[]]
=> [[6,6],[4]]
=> [4]
=> 4 = 5 - 1
[6,1,1]
=> [[6,1,1],[]]
=> [[6,6,6],[5,5]]
=> [5,5]
=> 5 = 6 - 1
[5,3]
=> [[5,3],[]]
=> [[5,5],[2]]
=> [2]
=> 2 = 3 - 1
[5,2,1]
=> [[5,2,1],[]]
=> [[5,5,5],[4,3]]
=> [4,3]
=> 4 = 5 - 1
Description
The largest part of an integer partition.
Matching statistic: St000052
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000052: Dyck paths ⟶ ℤResult quality: 97% ●values known / values provided: 97%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 2 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 3 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2 = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 2 = 3 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0 = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> 4 = 5 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 2 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> 3 = 4 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2 = 3 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1 = 2 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 2 = 3 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,1,0,0,0,0,0]
=> 2 = 3 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 2 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 1 = 2 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 1 = 2 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 0 = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> 6 = 7 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> 4 = 5 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0]
=> 5 = 6 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 2 = 3 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> 4 = 5 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,1,0,1,0,0,0,0]
=> ? = 5 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0 = 1 - 1
Description
The number of valleys of a Dyck path not on the x-axis.
That is, the number of valleys of nonminimal height. This corresponds to the number of -1's in an inclusion of Dyck paths into alternating sign matrices.
Matching statistic: St001685
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St001685: Permutations ⟶ ℤResult quality: 85% ●values known / values provided: 85%●distinct values known / distinct values provided: 86%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St001685: Permutations ⟶ ℤResult quality: 85% ●values known / values provided: 85%●distinct values known / distinct values provided: 86%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,3,2] => 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [3,1,2] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1 = 2 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => 3 = 4 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 1 = 2 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1,4,2] => 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,2,3,4,6,5] => 4 = 5 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => 2 = 3 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,2,3,5,6,4] => 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,1,2,3] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => 2 = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,2,4,5,6,3] => 2 = 3 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => 1 = 2 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,3,4,5,6,2] => 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,6,1] => 0 = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7] => 0 = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,2,3,4,5,7,6] => 5 = 6 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,2,3,6,4,5] => 3 = 4 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [1,2,3,4,6,7,5] => 4 = 5 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => 1 = 2 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,2,5,3,6,4] => 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [1,2,3,5,6,7,4] => 3 = 4 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => 2 = 3 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => 1 = 2 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [1,4,2,5,6,3] => 2 = 3 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [1,2,4,5,6,7,3] => 2 = 3 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => 1 = 2 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [3,1,4,5,6,2] => 1 = 2 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,3,4,5,6,7,2] => 1 = 2 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,6,7,1] => ? = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7,8] => ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,2,3,4,5,6,8,7] => ? = 7 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [1,2,3,4,7,5,6] => 4 = 5 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> [1,2,3,4,5,7,8,6] => ? = 6 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,2,6,3,4,5] => 2 = 3 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [1,2,3,6,4,7,5] => 4 = 5 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> [1,2,3,4,6,7,8,5] => ? = 5 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => 0 = 1 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,5,2,3,6,4] => 3 = 4 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,2,5,6,3,4] => 2 = 3 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [1,2,5,3,6,7,4] => 3 = 4 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,2,3,5,6,7,8,4] => ? = 4 - 1
[3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,4,5,6,7,8,3] => ? = 3 - 1
[2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [3,1,4,5,6,7,2] => ? = 2 - 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,3,4,5,6,7,8,2] => ? = 2 - 1
[1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,6,7,8,1] => ? = 1 - 1
Description
The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation.
Matching statistic: St000372
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
St000372: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 83%●distinct values known / distinct values provided: 71%
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
St000372: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 83%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => 0 = 1 - 1
[2]
=> [1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => 0 = 1 - 1
[1,1]
=> [1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => 0 = 1 - 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> [3,2,1,4] => 0 = 1 - 1
[2,1]
=> [1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => 1 = 2 - 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => 0 = 1 - 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1]]
=> [4,3,2,1,5] => 0 = 1 - 1
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => 2 = 3 - 1
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => 1 = 2 - 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => 0 = 1 - 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,0,0,1]]
=> [5,4,3,2,1,6] => 0 = 1 - 1
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => 3 = 4 - 1
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => 1 = 2 - 1
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => 2 = 3 - 1
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => 1 = 2 - 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [[1,0,0,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0]]
=> [1,6,5,4,3,2] => 0 = 1 - 1
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[1,0,0,0,0,0,0],[0,0,0,0,0,0,1]]
=> [6,5,4,3,2,1,7] => ? = 1 - 1
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [[0,0,0,1,0,0],[0,0,1,-1,1,0],[0,1,-1,1,0,0],[1,-1,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1]]
=> [1,5,4,3,2,6] => 4 = 5 - 1
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => 2 = 3 - 1
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => 3 = 4 - 1
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => 2 = 3 - 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 2 = 3 - 1
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => 0 = 1 - 1
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => 1 = 2 - 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [[1,0,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,-1,1],[0,0,1,-1,1,0],[0,1,-1,1,0,0],[0,0,1,0,0,0]]
=> [1,2,6,5,4,3] => 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,0,0,0,0,0,1],[0,0,0,0,0,1,0],[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0]]
=> [1,7,6,5,4,3,2] => ? = 1 - 1
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [[0,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0],[0,0,0,0,1,0,0,0],[0,0,0,1,0,0,0,0],[0,0,1,0,0,0,0,0],[0,1,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,1]]
=> [7,6,5,4,3,2,1,8] => ? = 1 - 1
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,-1,1,0],[0,0,1,-1,1,0,0],[0,1,-1,1,0,0,0],[1,-1,1,0,0,0,0],[0,1,0,0,0,0,0],[0,0,0,0,0,0,1]]
=> [1,6,5,4,3,2,7] => ? = 6 - 1
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,-1,1,0],[1,0,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1]]
=> [2,1,5,4,3,6] => 3 = 4 - 1
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [[0,0,1,0,0,0],[0,1,-1,0,1,0],[1,-1,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1]]
=> [1,5,4,3,2,6] => 4 = 5 - 1
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,2,1,4,5] => 1 = 2 - 1
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => 3 = 4 - 1
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 2 = 3 - 1
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 1 = 2 - 1
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => 2 = 3 - 1
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [[1,0,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,-1,1],[0,1,0,-1,1,0],[0,0,0,1,0,0]]
=> [1,3,2,6,5,4] => 2 = 3 - 1
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => 1 = 2 - 1
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [[1,0,0,0,0,0],[0,0,0,1,0,0],[0,0,1,-1,0,1],[0,1,-1,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0]]
=> [1,2,6,5,4,3] => 1 = 2 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [[1,0,0,0,0,0,0],[0,0,0,0,0,1,0],[0,0,0,0,1,-1,1],[0,0,0,1,-1,1,0],[0,0,1,-1,1,0,0],[0,1,-1,1,0,0,0],[0,0,1,0,0,0,0]]
=> [1,2,7,6,5,4,3] => 1 = 2 - 1
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [[1,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,1],[0,0,0,0,0,0,1,0],[0,0,0,0,0,1,0,0],[0,0,0,0,1,0,0,0],[0,0,0,1,0,0,0,0],[0,0,1,0,0,0,0,0],[0,1,0,0,0,0,0,0]]
=> [1,8,7,6,5,4,3,2] => ? = 1 - 1
[8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [[0,0,0,0,0,0,0,1,0],[0,0,0,0,0,0,1,0,0],[0,0,0,0,0,1,0,0,0],[0,0,0,0,1,0,0,0,0],[0,0,0,1,0,0,0,0,0],[0,0,1,0,0,0,0,0,0],[0,1,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,1]]
=> [8,7,6,5,4,3,2,1,9] => ? = 1 - 1
[7,1]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> [[0,0,0,0,0,1,0,0],[0,0,0,0,1,-1,1,0],[0,0,0,1,-1,1,0,0],[0,0,1,-1,1,0,0,0],[0,1,-1,1,0,0,0,0],[1,-1,1,0,0,0,0,0],[0,1,0,0,0,0,0,0],[0,0,0,0,0,0,0,1]]
=> [1,7,6,5,4,3,2,8] => ? = 7 - 1
[6,2]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [[0,0,0,0,1,0,0],[0,0,0,1,0,0,0],[0,0,1,0,-1,1,0],[0,1,0,-1,1,0,0],[1,0,-1,1,0,0,0],[0,0,1,0,0,0,0],[0,0,0,0,0,0,1]]
=> [2,1,6,5,4,3,7] => ? = 5 - 1
[6,1,1]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [[0,0,0,1,0,0,0],[0,0,1,-1,0,1,0],[0,1,-1,0,1,0,0],[1,-1,0,1,0,0,0],[0,0,1,0,0,0,0],[0,1,0,0,0,0,0],[0,0,0,0,0,0,1]]
=> [1,6,5,4,3,2,7] => ? = 6 - 1
[5,3]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[1,0,0,-1,1,0],[0,0,0,1,0,0],[0,0,0,0,0,1]]
=> [3,2,1,5,4,6] => 2 = 3 - 1
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [[0,0,1,0,0,0],[0,1,-1,1,0,0],[1,-1,1,-1,1,0],[0,1,-1,1,0,0],[0,0,1,0,0,0],[0,0,0,0,0,1]]
=> [1,2,5,4,3,6] => 4 = 5 - 1
[5,1,1,1]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [[0,1,0,0,0,0],[1,-1,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[0,0,0,0,0,1]]
=> [1,5,4,3,2,6] => 4 = 5 - 1
[4,4]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,0,0],[1,0,0,0,0,0],[0,0,0,0,0,1],[0,0,0,0,1,0]]
=> [4,3,2,1,6,5] => 0 = 1 - 1
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => 3 = 4 - 1
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => 2 = 3 - 1
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => 3 = 4 - 1
[4,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [[1,0,0,0,0,0],[0,0,0,0,1,0],[0,0,0,1,0,0],[0,0,1,0,0,0],[0,1,0,0,-1,1],[0,0,0,0,1,0]]
=> [1,4,3,2,6,5] => 3 = 4 - 1
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 1 = 2 - 1
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 2 = 3 - 1
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => 2 = 3 - 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [[1,0,0,0,0,0,0,0],[0,0,0,0,0,0,1,0],[0,0,0,0,0,1,-1,1],[0,0,0,0,1,-1,1,0],[0,0,0,1,-1,1,0,0],[0,0,1,-1,1,0,0,0],[0,1,-1,1,0,0,0,0],[0,0,1,0,0,0,0,0]]
=> [1,2,8,7,6,5,4,3] => ? = 2 - 1
[1,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [[1,0,0,0,0,0,0,0,0],[0,0,0,0,0,0,0,0,1],[0,0,0,0,0,0,0,1,0],[0,0,0,0,0,0,1,0,0],[0,0,0,0,0,1,0,0,0],[0,0,0,0,1,0,0,0,0],[0,0,0,1,0,0,0,0,0],[0,0,1,0,0,0,0,0,0],[0,1,0,0,0,0,0,0,0]]
=> [1,9,8,7,6,5,4,3,2] => ? = 1 - 1
Description
The number of mid points of increasing subsequences of length 3 in a permutation.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the number of indices $j$ such that there exist indices $i,k$ with $i < j < k$ and $\pi(i) < \pi(j) < \pi(k)$.
The generating function is given by [1].
Matching statistic: St001687
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001687: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 73%●distinct values known / distinct values provided: 71%
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001687: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 73%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1 = 2 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3 = 4 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1 = 2 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => 4 = 5 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 2 = 3 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2 = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => 2 = 3 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1 = 2 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,7,1] => ? = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,6,1,7] => ? = 6 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [2,3,4,1,6,5] => 3 = 4 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,5,1,6,7] => ? = 5 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1 = 2 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,6] => 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,4,1,5,6,7] => ? = 4 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 2 = 3 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => 1 = 2 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,5,6] => 2 = 3 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7] => ? = 3 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => 1 = 2 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => 1 = 2 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6,7] => ? = 2 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6,7] => 0 = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,7,8,1] => ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,6,7,1,8] => ? = 7 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,1,0,0]
=> [2,3,4,5,1,7,6] => ? = 5 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,5,6,1,7,8] => ? = 6 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [2,3,1,5,6,4] => 2 = 3 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> [2,3,4,1,6,5,7] => ? = 5 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,4,5,1,6,7,8] => ? = 5 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0 = 1 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [2,1,4,5,3,6] => 3 = 4 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [2,3,1,6,4,5] => 2 = 3 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> [2,3,1,5,4,6,7] => ? = 4 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,4,1,5,6,7,8] => ? = 4 - 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => 1 = 2 - 1
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => 2 = 3 - 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,1,5,3,4,6] => 2 = 3 - 1
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [2,1,4,3,5,6,7] => ? = 3 - 1
[3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7,8] => ? = 3 - 1
[2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => 0 = 1 - 1
[2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,4,2,3,5,6] => 1 = 2 - 1
[2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6,7] => 1 = 2 - 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6,7,8] => ? = 2 - 1
[1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6,7,8] => ? = 1 - 1
Description
The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation.
Matching statistic: St000358
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000358: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 71%●distinct values known / distinct values provided: 71%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000358: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 71%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 1 = 2 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => 3 = 4 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 1 = 2 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5] => 4 = 5 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => 2 = 3 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,2,3,4] => 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => 2 = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,2,3] => 2 = 3 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 1 = 2 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => 0 = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7] => 0 = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [7,1,2,3,4,5,6] => ? = 6 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,1,2,3,4,6] => 3 = 4 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [7,6,1,2,3,4,5] => ? = 5 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [3,1,2,4,5] => 1 = 2 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [7,6,5,1,2,3,4] => ? = 4 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,3,4] => 2 = 3 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => 1 = 2 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,2,4] => 2 = 3 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,1,2,3] => ? = 3 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 1 = 2 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,3] => 1 = 2 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,1,2] => ? = 2 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,2,1] => ? = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7,8] => ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [8,1,2,3,4,5,6,7] => ? = 7 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [6,1,2,3,4,5,7] => ? = 5 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> [8,7,1,2,3,4,5,6] => ? = 6 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [4,1,2,3,5,6] => 2 = 3 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [7,5,1,2,3,4,6] => ? = 5 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> [8,7,6,1,2,3,4,5] => ? = 5 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [2,1,3,4,5] => 0 = 1 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [6,3,1,2,4,5] => 3 = 4 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [5,4,1,2,3,6] => 2 = 3 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [7,6,4,1,2,3,5] => ? = 4 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,1,2,3,4] => ? = 4 - 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => 1 = 2 - 1
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [6,5,2,1,3,4] => 2 = 3 - 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [6,4,3,1,2,5] => 2 = 3 - 1
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,1,2,4] => ? = 3 - 1
[3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,1,2,3] => ? = 3 - 1
[2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 0 = 1 - 1
[2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,4] => 1 = 2 - 1
[2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,1,3] => ? = 2 - 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,3,1,2] => ? = 2 - 1
[1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,3,2,1] => ? = 1 - 1
Description
The number of occurrences of the pattern 31-2.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $31\!\!-\!\!2$.
Matching statistic: St001744
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001744: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 71%●distinct values known / distinct values provided: 71%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001744: Permutations ⟶ ℤResult quality: 71% ●values known / values provided: 71%●distinct values known / distinct values provided: 71%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0 = 1 - 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 0 = 1 - 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => 1 = 2 - 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0 = 1 - 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0 = 1 - 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 2 = 3 - 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => 0 = 1 - 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 1 = 2 - 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0 = 1 - 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0 = 1 - 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => 3 = 4 - 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 1 = 2 - 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => 2 = 3 - 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 1 = 2 - 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0 = 1 - 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0 = 1 - 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5] => 4 = 5 - 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => 2 = 3 - 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,2,3,4] => 3 = 4 - 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 0 = 1 - 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => 2 = 3 - 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,2,3] => 2 = 3 - 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 0 = 1 - 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 1 = 2 - 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => 1 = 2 - 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => 0 = 1 - 1
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7] => 0 = 1 - 1
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [7,1,2,3,4,5,6] => ? = 6 - 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,1,2,3,4,6] => 3 = 4 - 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [7,6,1,2,3,4,5] => ? = 5 - 1
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [3,1,2,4,5] => 1 = 2 - 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => 3 = 4 - 1
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [7,6,5,1,2,3,4] => ? = 4 - 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,3,4] => 2 = 3 - 1
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => 1 = 2 - 1
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,2,4] => 2 = 3 - 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,1,2,3] => ? = 3 - 1
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 1 = 2 - 1
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,3] => 1 = 2 - 1
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,1,2] => ? = 2 - 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,2,1] => ? = 1 - 1
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,2,3,4,5,6,7,8] => ? = 1 - 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [8,1,2,3,4,5,6,7] => ? = 7 - 1
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [6,1,2,3,4,5,7] => ? = 5 - 1
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> [8,7,1,2,3,4,5,6] => ? = 6 - 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [4,1,2,3,5,6] => 2 = 3 - 1
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [7,5,1,2,3,4,6] => ? = 5 - 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> [8,7,6,1,2,3,4,5] => ? = 5 - 1
[4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [2,1,3,4,5] => 0 = 1 - 1
[4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [6,3,1,2,4,5] => 3 = 4 - 1
[4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [5,4,1,2,3,6] => 2 = 3 - 1
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [7,6,4,1,2,3,5] => ? = 4 - 1
[4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,1,2,3,4] => ? = 4 - 1
[3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => 1 = 2 - 1
[3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [6,5,2,1,3,4] => 2 = 3 - 1
[3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> [6,4,3,1,2,5] => 2 = 3 - 1
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,1,2,4] => ? = 3 - 1
[3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,1,2,3] => ? = 3 - 1
[2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 0 = 1 - 1
[2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,4] => 1 = 2 - 1
[2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,1,3] => ? = 2 - 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,3,1,2] => ? = 2 - 1
[1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,3,2,1] => ? = 1 - 1
Description
The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation.
Let $\nu$ be a (partial) permutation of $[k]$ with $m$ letters together with dashes between some of its letters. An occurrence of $\nu$ in a permutation $\tau$ is a subsequence $\tau_{a_1},\dots,\tau_{a_m}$
such that $a_i + 1 = a_{i+1}$ whenever there is a dash between the $i$-th and the $(i+1)$-st letter of $\nu$, which is order isomorphic to $\nu$.
Thus, $\nu$ is a vincular pattern, except that it is not required to be a permutation.
An arrow pattern of size $k$ consists of such a generalized vincular pattern $\nu$ and arrows $b_1\to c_1, b_2\to c_2,\dots$, such that precisely the numbers $1,\dots,k$ appear in the vincular pattern and the arrows.
Let $\Phi$ be the map [[Mp00087]]. Let $\tau$ be a permutation and $\sigma = \Phi(\tau)$. Then a subsequence $w = (x_{a_1},\dots,x_{a_m})$ of $\tau$ is an occurrence of the arrow pattern if $w$ is an occurrence of $\nu$, for each arrow $b\to c$ we have $\sigma(x_b) = x_c$ and $x_1 < x_2 < \dots < x_k$.
The following 37 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000089The absolute variation of a composition. St000090The variation of a composition. St000091The descent variation of a composition. St001323The independence gap of a graph. St000145The Dyson rank of a partition. St001674The number of vertices of the largest induced star graph in the graph. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001742The difference of the maximal and the minimal degree in a graph. St001435The number of missing boxes in the first row. St001330The hat guessing number of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000299The number of nonisomorphic vertex-induced subtrees. St001811The Castelnuovo-Mumford regularity of a permutation. St000455The second largest eigenvalue of a graph if it is integral. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001822The number of alignments of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St000068The number of minimal elements in a poset. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001487The number of inner corners of a skew partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St000233The number of nestings of a set partition. St000650The number of 3-rises of a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001438The number of missing boxes of a skew partition. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000871The number of very big ascents of a permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000031The number of cycles in the cycle decomposition of a permutation. St000035The number of left outer peaks of a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000742The number of big ascents of a permutation after prepending zero. St001488The number of corners of a skew partition.
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!