Identifier
-
Mp00097:
Binary words
—delta morphism⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001471: Dyck paths ⟶ ℤ (values match St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra.)
Values
0 => [1] => [1,0] => [1,0] => 1
1 => [1] => [1,0] => [1,0] => 1
00 => [2] => [1,1,0,0] => [1,0,1,0] => 2
01 => [1,1] => [1,0,1,0] => [1,1,0,0] => 1
10 => [1,1] => [1,0,1,0] => [1,1,0,0] => 1
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,1,0,0,1,0] => 2
010 => [1,1,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 1
011 => [1,2] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
100 => [1,2] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => 2
101 => [1,1,1] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => 1
110 => [2,1] => [1,1,0,0,1,0] => [1,1,0,0,1,0] => 2
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] => 3
0001 => [3,1] => [1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0] => 2
0010 => [2,1,1] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0] => 2
0011 => [2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 2
0100 => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 2
0101 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 1
0110 => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
0111 => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => 2
1000 => [1,3] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => 2
1001 => [1,2,1] => [1,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
1010 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => 1
1011 => [1,1,2] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => 2
1100 => [2,2] => [1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => 2
1101 => [2,1,1] => [1,1,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0] => 2
1110 => [3,1] => [1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,0] => 2
1111 => [4] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => 3
00000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 3
00001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => 3
00010 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => 2
00011 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
00100 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 2
00101 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 2
00110 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => 2
00111 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
01000 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 2
01001 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 2
01010 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 1
01011 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 2
01100 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => 2
01101 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
01110 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 2
01111 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 2
10000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => 2
10001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 2
10010 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
10011 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0] => 2
10100 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => 2
10101 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => 1
10110 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => 2
10111 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => 2
11000 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0] => 3
11001 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0] => 2
11010 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0] => 2
11011 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => 2
11100 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,0] => 3
11101 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0] => 2
11110 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0] => 3
11111 => [5] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => 3
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] => 4
000001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [1,1,0,0,1,0,1,0,1,0,1,0] => 3
000010 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [1,1,1,0,0,0,1,0,1,0,1,0] => 3
000011 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => 3
000100 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0,1,0,1,0] => 3
000101 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => 2
000110 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,0,0,1,0,1,0] => 3
000111 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => 3
001000 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0,1,0] => 3
001001 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,0,1,0] => 2
001010 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => 2
001011 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0,1,0] => 2
001100 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,0,1,0] => 3
001101 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => 2
001110 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0,1,0] => 3
001111 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => 3
010000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 2
010001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 2
010010 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 2
010011 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 2
010100 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 2
010101 => [1,1,1,1,1,1] => [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
010110 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 2
010111 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 2
011000 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 2
011001 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 2
011010 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
011011 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 2
011100 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 2
011101 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 2
011110 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 2
011111 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 3
100000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 3
100001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 2
100010 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 2
100011 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 2
100100 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 2
100101 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
100110 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 2
>>> 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 magnitude of a Dyck path.
The magnitude of a finite dimensional algebra with invertible Cartan matrix C is defined as the sum of all entries of the inverse of C.
We define the magnitude of a Dyck path as the magnitude of the corresponding LNakayama algebra.
The magnitude of a finite dimensional algebra with invertible Cartan matrix C is defined as the sum of all entries of the inverse of C.
We define the magnitude of a Dyck path as the magnitude of the corresponding LNakayama algebra.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength 0 is sent to itself.
Let D be a Dyck path of semilength n>0 and decompose it into 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
The unique empty path of semilength 0 is sent to itself.
Let D be a Dyck path of semilength n>0 and decompose it into 1D10D2 with Dyck paths D1,D2 of respective semilengths n1 and n2 such that n1 is minimal. One then has n1+n2=n−1.
Now let ˜D1 and ˜D2 be the recursively defined respective images of D1 and D2 under this map. The image of D is then defined as 1˜D20˜D1.
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.
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!