Identifier
-
Mp00097:
Binary words
—delta morphism⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001504: Dyck paths ⟶ ℤ
Values
0 => [1] => [1,0] => [1,0] => 2
1 => [1] => [1,0] => [1,0] => 2
00 => [2] => [1,1,0,0] => [1,0,1,0] => 2
01 => [1,1] => [1,0,1,0] => [1,1,0,0] => 3
10 => [1,1] => [1,0,1,0] => [1,1,0,0] => 3
11 => [2] => [1,1,0,0] => [1,0,1,0] => 2
000 => [3] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
001 => [2,1] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 4
010 => [1,1,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 3
011 => [1,2] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 3
100 => [1,2] => [1,0,1,1,0,0] => [1,1,0,0,1,0] => 3
101 => [1,1,1] => [1,0,1,0,1,0] => [1,1,0,1,0,0] => 3
110 => [2,1] => [1,1,0,0,1,0] => [1,0,1,1,0,0] => 4
111 => [3] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => 2
0000 => [4] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 2
0001 => [3,1] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => 4
0010 => [2,1,1] => [1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => 4
0011 => [2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 4
0100 => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 3
0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 3
0110 => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 5
0111 => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 3
1000 => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => 3
1001 => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => 5
1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 3
1011 => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 3
1100 => [2,2] => [1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => 4
1101 => [2,1,1] => [1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => 4
1110 => [3,1] => [1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => 4
1111 => [4] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 2
00000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
00001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 4
00010 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => 4
00011 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 4
00100 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 4
00101 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => 4
00110 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 6
00111 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 4
01000 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
01001 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 5
01010 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 3
01011 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
01100 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 5
01101 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 5
01110 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 5
01111 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 3
10000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => 3
10001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => 5
10010 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => 5
10011 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => 5
10100 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
10101 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 3
10110 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => 5
10111 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
11000 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => 4
11001 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => 6
11010 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => 4
11011 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => 4
11100 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => 4
11101 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => 4
11110 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => 4
11111 => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 2
000000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => 2
000001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => 4
000010 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,0,1,0,1,0,1,1,0,1,0,0] => 4
000011 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => 4
000100 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,0,1,0,1,1,0,1,0,0,1,0] => 4
000101 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,1,0,0] => 4
000110 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,0,1,0,1,1,0,0,1,1,0,0] => 6
000111 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0,1,0,1,0] => 4
001000 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0,1,0] => 4
001001 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,0,1,1,0,1,0,0,1,1,0,0] => 6
001010 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,1,0,0] => 4
001011 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,0,1,0] => 4
001100 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,1,0,0,1,0] => 6
001101 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,0,1,1,0,0,1,1,0,1,0,0] => 6
001110 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,0,1,1,0,0,1,0,1,1,0,0] => 6
001111 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0,1,0] => 4
010000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 3
010001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => 5
010010 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => 5
010011 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => 5
010100 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 3
010101 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 3
010110 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => 5
010111 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 3
011000 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => 5
011001 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 7
011010 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 5
011011 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 5
011100 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 5
011101 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => 5
011110 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 5
011111 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 3
100000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 3
100001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,1,0,0] => 5
100010 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => 5
100011 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => 5
100100 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => 5
100101 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => 5
100110 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => 7
>>> Load all 254 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
delta morphism
Description
Applies the delta morphism to a binary word.
The delta morphism of a finite word w is the integer compositions composed of the lengths of consecutive runs of the same letter in w.
The delta morphism of a finite word w is the integer compositions composed of the lengths of consecutive runs of the same letter in w.
Map
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1…d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (γ(−1)∘β)(D).
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1…d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (γ(−1)∘β)(D).
searching the database
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!