- FindStat

Your data matches 96 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000390
(load all 4 compositions to match this statistic)

Mapping

St000390: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

=> 0
=> 1
=> 0
=> 1
=> 1
=> 1
=> 0
=> 1
=> 1
=> 1
=> 1
=> 2
=> 1
=> 1
=> 0
=> 1
=> 1
=> 1
=> 1
=> 2
=> 1
=> 1
=> 1
=> 2
=> 2
=> 2
=> 1
=> 2
=> 1
=> 1
=> 0
=> 1
=> 1
=> 1
=> 1
=> 2
=> 1
=> 1
=> 1
=> 2
=> 2
=> 2
=> 1
=> 2
=> 1
=> 1
=> 1
=> 2
=> 2
=> 2

Description

The number of runs of ones in a binary word.

Matching statistic: St000291
(load all 2 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

=> [2] => 10 => 1
=> [1,1] => 11 => 0
=> [3] => 100 => 1
=> [2,1] => 101 => 1
=> [1,2] => 110 => 1
=> [1,1,1] => 111 => 0
=> [4] => 1000 => 1
=> [3,1] => 1001 => 1
=> [2,2] => 1010 => 2
=> [2,1,1] => 1011 => 1
=> [1,3] => 1100 => 1
=> [1,2,1] => 1101 => 1
=> [1,1,2] => 1110 => 1
=> [1,1,1,1] => 1111 => 0
=> [5] => 10000 => 1
=> [4,1] => 10001 => 1
=> [3,2] => 10010 => 2
=> [3,1,1] => 10011 => 1
=> [2,3] => 10100 => 2
=> [2,2,1] => 10101 => 2
=> [2,1,2] => 10110 => 2
=> [2,1,1,1] => 10111 => 1
=> [1,4] => 11000 => 1
=> [1,3,1] => 11001 => 1
=> [1,2,2] => 11010 => 2
=> [1,2,1,1] => 11011 => 1
=> [1,1,3] => 11100 => 1
=> [1,1,2,1] => 11101 => 1
=> [1,1,1,2] => 11110 => 1
=> [1,1,1,1,1] => 11111 => 0
=> [6] => 100000 => 1
=> [5,1] => 100001 => 1
=> [4,2] => 100010 => 2
=> [4,1,1] => 100011 => 1
=> [3,3] => 100100 => 2
=> [3,2,1] => 100101 => 2
=> [3,1,2] => 100110 => 2
=> [3,1,1,1] => 100111 => 1
=> [2,4] => 101000 => 2
=> [2,3,1] => 101001 => 2
=> [2,2,2] => 101010 => 3
=> [2,2,1,1] => 101011 => 2
=> [2,1,3] => 101100 => 2
=> [2,1,2,1] => 101101 => 2
=> [2,1,1,2] => 101110 => 2
=> [2,1,1,1,1] => 101111 => 1
=> [1,5] => 110000 => 1
=> [1,4,1] => 110001 => 1
=> [1,3,2] => 110010 => 2
=> [1,3,1,1] => 110011 => 1

Description

The number of descents of a binary word.

Matching statistic: St000659
(load all 4 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000659: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 1
1 => [1,1] => [1,0,1,0]
 => 0
00 => [3] => [1,1,1,0,0,0]
 => 1
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 0
000 => [4] => [1,1,1,1,0,0,0,0]
 => 1
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 1
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 2
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 1
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 2
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 2
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 2
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 3
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 2
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 1

Description

The number of rises of length at least 2 of a Dyck path.

Matching statistic: St000985
(load all 2 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000985: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => ([],2)
 => 0
1 => [1,1] => ([(0,1)],2)
 => 1
00 => [3] => ([],3)
 => 0
01 => [2,1] => ([(0,2),(1,2)],3)
 => 1
10 => [1,2] => ([(1,2)],3)
 => 1
11 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
 => 1
000 => [4] => ([],4)
 => 0
001 => [3,1] => ([(0,3),(1,3),(2,3)],4)
 => 1
010 => [2,2] => ([(1,3),(2,3)],4)
 => 1
011 => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
100 => [1,3] => ([(2,3)],4)
 => 1
101 => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
 => 2
110 => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
 => 1
111 => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 1
0000 => [5] => ([],5)
 => 0
0001 => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
 => 1
0010 => [3,2] => ([(1,4),(2,4),(3,4)],5)
 => 1
0011 => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
0100 => [2,3] => ([(2,4),(3,4)],5)
 => 1
0101 => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
0110 => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
0111 => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
1000 => [1,4] => ([(3,4)],5)
 => 1
1001 => [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
1010 => [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
 => 2
1011 => [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
1100 => [1,1,3] => ([(2,3),(2,4),(3,4)],5)
 => 1
1101 => [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 2
1110 => [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
1111 => [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 1
00000 => [6] => ([],6)
 => 0
00001 => [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
 => 1
00010 => [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
 => 1
00011 => [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
00100 => [3,3] => ([(2,5),(3,5),(4,5)],6)
 => 1
00101 => [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
00110 => [3,1,2] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
00111 => [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
01000 => [2,4] => ([(3,5),(4,5)],6)
 => 1
01001 => [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
01010 => [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
01011 => [2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
01100 => [2,1,3] => ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
01101 => [2,1,2,1] => ([(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
01110 => [2,1,1,2] => ([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
01111 => [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 1
10000 => [1,5] => ([(4,5)],6)
 => 1
10001 => [1,4,1] => ([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
10010 => [1,3,2] => ([(1,5),(2,5),(3,4),(3,5),(4,5)],6)
 => 2
10011 => [1,3,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 2

Description

The number of positive eigenvalues of the adjacency matrix of the graph.

Matching statistic: St001011
(load all 3 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 0
1 => [1,1] => [1,0,1,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => 0
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2

Description

Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.

Matching statistic: St001188
(load all 6 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001188: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 0
1 => [1,1] => [1,0,1,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => 0
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2

Description

The number of simple modules

$S$ with grade

$\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra

$A$ corresponding to the Dyck path. Also the number of simple modules that are isolated vertices in the sense of 4.5. (4) in the reference.

Matching statistic: St001212
(load all 6 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001212: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 0
1 => [1,1] => [1,0,1,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => 0
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2

Description

The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module.

Matching statistic: St001215

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001215: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 0
1 => [1,1] => [1,0,1,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => 0
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2

Description

Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. Then the statistic gives the vector space dimension of the second Ext-group between X and the regular module. For the first 196 values, the statistic also gives the number of indecomposable non-projective modules

$X$ such that

$\tau(X)$ has codominant dimension equal to one and projective dimension equal to one.

Matching statistic: St001222

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001222: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 0
1 => [1,1] => [1,0,1,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => 0
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2

Description

Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module.

Matching statistic: St001244
(load all 6 compositions to match this statistic)

Mapping

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001244: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

0 => [2] => [1,1,0,0]
 => 0
1 => [1,1] => [1,0,1,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => 0
01 => [2,1] => [1,1,0,0,1,0]
 => 1
10 => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2

Description

The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. For the projective dimension see [[St001007]] and for 1-regularity see [[St001126]]. After applying the inverse zeta map [[Mp00032]], this statistic matches the number of rises of length at least 2 [[St000659]].

The following 86 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St001280The number of parts of an integer partition that are at least two. St001354The number of series nodes in the modular decomposition of a graph. St000021The number of descents of a permutation. St000024The number of double up and double down steps of a Dyck path. St000035The number of left outer peaks of a permutation. St000053The number of valleys of the Dyck path. St000147The largest part of an integer partition. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000238The number of indices that are not small weak excedances. St000251The number of nonsingleton blocks of a set partition. St000292The number of ascents of a binary word. St000306The bounce count of a Dyck path. St000316The number of non-left-to-right-maxima of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000354The number of recoils of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000387The matching number of a graph. St000442The maximal area to the right of an up step of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000665The number of rafts of a permutation. St000670The reversal length of a permutation. St000703The number of deficiencies of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000834The number of right outer peaks of a permutation. St000884The number of isolated descents of a permutation. St000919The number of maximal left branches of a binary tree. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001197The global dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001205The number of non-simple indecomposable projective-injective modules of the algebra

$eAe$ in the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001489The maximum of the number of descents and the number of inverse descents. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001512The minimum rank of a graph. St001665The number of pure excedances of a permutation. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001726The number of visible inversions of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001874Lusztig's a-function for the symmetric group. St001928The number of non-overlapping descents in a permutation. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000299The number of nonisomorphic vertex-induced subtrees. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000470The number of runs in a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series

$L=[c_0,c_1,...,c_{n-1}]$ such that

$n=c_0 < c_i$ for all

$i > 0$ a Dyck path as follows: St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001471The magnitude of a Dyck path. St001674The number of vertices of the largest induced star graph in the graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . St000668The least common multiple of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000259The diameter of a connected graph. St001568The smallest positive integer that does not appear twice in the partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000023The number of inner peaks of a permutation. St000353The number of inner valleys of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000779The tier of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St000455The second largest eigenvalue of a graph if it is integral. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition.