searching the database
Your data matches 371 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: St000024
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> 0
[1,1] => [1,1]
=> [1,1,0,0]
=> 1
[2] => [2]
=> [1,0,1,0]
=> 0
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 1
[3] => [3]
=> [1,0,1,0,1,0]
=> 0
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 3
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[6] => [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[7] => [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 4
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 5
Description
The number of double up and double down steps of a Dyck path.
In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.
Matching statistic: St000378
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000378: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000378: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> []
=> 0
[1,1] => [1,1]
=> [1]
=> 1
[2] => [2]
=> []
=> 0
[1,2] => [2,1]
=> [1]
=> 1
[2,1] => [2,1]
=> [1]
=> 1
[3] => [3]
=> []
=> 0
[1,3] => [3,1]
=> [1]
=> 1
[2,2] => [2,2]
=> [2]
=> 2
[3,1] => [3,1]
=> [1]
=> 1
[4] => [4]
=> []
=> 0
[1,4] => [4,1]
=> [1]
=> 1
[2,3] => [3,2]
=> [2]
=> 2
[3,2] => [3,2]
=> [2]
=> 2
[4,1] => [4,1]
=> [1]
=> 1
[5] => [5]
=> []
=> 0
[1,5] => [5,1]
=> [1]
=> 1
[2,2,2] => [2,2,2]
=> [2,2]
=> 3
[2,4] => [4,2]
=> [2]
=> 2
[4,2] => [4,2]
=> [2]
=> 2
[5,1] => [5,1]
=> [1]
=> 1
[6] => [6]
=> []
=> 0
[1,6] => [6,1]
=> [1]
=> 1
[2,2,3] => [3,2,2]
=> [2,2]
=> 3
[2,3,2] => [3,2,2]
=> [2,2]
=> 3
[2,5] => [5,2]
=> [2]
=> 2
[3,2,2] => [3,2,2]
=> [2,2]
=> 3
[5,2] => [5,2]
=> [2]
=> 2
[6,1] => [6,1]
=> [1]
=> 1
[7] => [7]
=> []
=> 0
[2,2,4] => [4,2,2]
=> [2,2]
=> 3
[2,4,2] => [4,2,2]
=> [2,2]
=> 3
[2,6] => [6,2]
=> [2]
=> 2
[4,2,2] => [4,2,2]
=> [2,2]
=> 3
[6,2] => [6,2]
=> [2]
=> 2
[2,2,5] => [5,2,2]
=> [2,2]
=> 3
[2,5,2] => [5,2,2]
=> [2,2]
=> 3
[3,3,3] => [3,3,3]
=> [3,3]
=> 4
[5,2,2] => [5,2,2]
=> [2,2]
=> 3
[3,3,4] => [4,3,3]
=> [3,3]
=> 4
[3,4,3] => [4,3,3]
=> [3,3]
=> 4
[4,3,3] => [4,3,3]
=> [3,3]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [3,3,3]
=> 5
Description
The diagonal inversion number of an integer partition.
The dinv of a partition is the number of cells c in the diagram of an integer partition λ for which arm(c)−leg(c)∈{0,1}.
See also exercise 3.19 of [2].
This statistic is equidistributed with the length of the partition, see [3].
Matching statistic: St000384
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000384: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000384: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> []
=> 0
[1,1] => [1,1]
=> [1]
=> 1
[2] => [2]
=> []
=> 0
[1,2] => [2,1]
=> [1]
=> 1
[2,1] => [2,1]
=> [1]
=> 1
[3] => [3]
=> []
=> 0
[1,3] => [3,1]
=> [1]
=> 1
[2,2] => [2,2]
=> [2]
=> 2
[3,1] => [3,1]
=> [1]
=> 1
[4] => [4]
=> []
=> 0
[1,4] => [4,1]
=> [1]
=> 1
[2,3] => [3,2]
=> [2]
=> 2
[3,2] => [3,2]
=> [2]
=> 2
[4,1] => [4,1]
=> [1]
=> 1
[5] => [5]
=> []
=> 0
[1,5] => [5,1]
=> [1]
=> 1
[2,2,2] => [2,2,2]
=> [2,2]
=> 3
[2,4] => [4,2]
=> [2]
=> 2
[4,2] => [4,2]
=> [2]
=> 2
[5,1] => [5,1]
=> [1]
=> 1
[6] => [6]
=> []
=> 0
[1,6] => [6,1]
=> [1]
=> 1
[2,2,3] => [3,2,2]
=> [2,2]
=> 3
[2,3,2] => [3,2,2]
=> [2,2]
=> 3
[2,5] => [5,2]
=> [2]
=> 2
[3,2,2] => [3,2,2]
=> [2,2]
=> 3
[5,2] => [5,2]
=> [2]
=> 2
[6,1] => [6,1]
=> [1]
=> 1
[7] => [7]
=> []
=> 0
[2,2,4] => [4,2,2]
=> [2,2]
=> 3
[2,4,2] => [4,2,2]
=> [2,2]
=> 3
[2,6] => [6,2]
=> [2]
=> 2
[4,2,2] => [4,2,2]
=> [2,2]
=> 3
[6,2] => [6,2]
=> [2]
=> 2
[2,2,5] => [5,2,2]
=> [2,2]
=> 3
[2,5,2] => [5,2,2]
=> [2,2]
=> 3
[3,3,3] => [3,3,3]
=> [3,3]
=> 4
[5,2,2] => [5,2,2]
=> [2,2]
=> 3
[3,3,4] => [4,3,3]
=> [3,3]
=> 4
[3,4,3] => [4,3,3]
=> [3,3]
=> 4
[4,3,3] => [4,3,3]
=> [3,3]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [3,3,3]
=> 5
Description
The maximal part of the shifted composition of an integer partition.
A partition λ=(λ1,…,λk) is shifted into a composition by adding i−1 to the i-th part.
The statistic is then maxi{λi+i−1}.
See also [[St000380]].
Matching statistic: St000394
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> 0
[1,1] => [1,1]
=> [1,1,0,0]
=> 1
[2] => [2]
=> [1,0,1,0]
=> 0
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 1
[3] => [3]
=> [1,0,1,0,1,0]
=> 0
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 3
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[6] => [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[7] => [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 4
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 5
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St000459
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000459: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000459: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> []
=> 0
[1,1] => [1,1]
=> [1]
=> 1
[2] => [2]
=> []
=> 0
[1,2] => [2,1]
=> [1]
=> 1
[2,1] => [2,1]
=> [1]
=> 1
[3] => [3]
=> []
=> 0
[1,3] => [3,1]
=> [1]
=> 1
[2,2] => [2,2]
=> [2]
=> 2
[3,1] => [3,1]
=> [1]
=> 1
[4] => [4]
=> []
=> 0
[1,4] => [4,1]
=> [1]
=> 1
[2,3] => [3,2]
=> [2]
=> 2
[3,2] => [3,2]
=> [2]
=> 2
[4,1] => [4,1]
=> [1]
=> 1
[5] => [5]
=> []
=> 0
[1,5] => [5,1]
=> [1]
=> 1
[2,2,2] => [2,2,2]
=> [2,2]
=> 3
[2,4] => [4,2]
=> [2]
=> 2
[4,2] => [4,2]
=> [2]
=> 2
[5,1] => [5,1]
=> [1]
=> 1
[6] => [6]
=> []
=> 0
[1,6] => [6,1]
=> [1]
=> 1
[2,2,3] => [3,2,2]
=> [2,2]
=> 3
[2,3,2] => [3,2,2]
=> [2,2]
=> 3
[2,5] => [5,2]
=> [2]
=> 2
[3,2,2] => [3,2,2]
=> [2,2]
=> 3
[5,2] => [5,2]
=> [2]
=> 2
[6,1] => [6,1]
=> [1]
=> 1
[7] => [7]
=> []
=> 0
[2,2,4] => [4,2,2]
=> [2,2]
=> 3
[2,4,2] => [4,2,2]
=> [2,2]
=> 3
[2,6] => [6,2]
=> [2]
=> 2
[4,2,2] => [4,2,2]
=> [2,2]
=> 3
[6,2] => [6,2]
=> [2]
=> 2
[2,2,5] => [5,2,2]
=> [2,2]
=> 3
[2,5,2] => [5,2,2]
=> [2,2]
=> 3
[3,3,3] => [3,3,3]
=> [3,3]
=> 4
[5,2,2] => [5,2,2]
=> [2,2]
=> 3
[3,3,4] => [4,3,3]
=> [3,3]
=> 4
[3,4,3] => [4,3,3]
=> [3,3]
=> 4
[4,3,3] => [4,3,3]
=> [3,3]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [3,3,3]
=> 5
Description
The hook length of the base cell of a partition.
This is also known as the perimeter of a partition. In particular, the perimeter of the empty partition is zero.
Matching statistic: St001189
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> 0
[1,1] => [1,1]
=> [1,1,0,0]
=> 1
[2] => [2]
=> [1,0,1,0]
=> 0
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 1
[3] => [3]
=> [1,0,1,0,1,0]
=> 0
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 2
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 3
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[6] => [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 3
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[7] => [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 2
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 4
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 5
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000013
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> 1 = 0 + 1
[1,1] => [1,1]
=> [1,1,0,0]
=> 2 = 1 + 1
[2] => [2]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[3] => [3]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[6] => [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[7] => [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6 = 5 + 1
Description
The height of a Dyck path.
The height of a Dyck path D of semilength n is defined as the maximal height of a peak of D. The height of D at position i is the number of up-steps minus the number of down-steps before position i.
Matching statistic: St001007
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001007: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001007: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> 1 = 0 + 1
[1,1] => [1,1]
=> [1,1,0,0]
=> 2 = 1 + 1
[2] => [2]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[3] => [3]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[6] => [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[7] => [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6 = 5 + 1
Description
Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001088
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001088: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001088: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> 1 = 0 + 1
[1,1] => [1,1]
=> [1,1,0,0]
=> 2 = 1 + 1
[2] => [2]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[3] => [3]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[6] => [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[7] => [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6 = 5 + 1
Description
Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra.
Matching statistic: St000053
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1,0]
=> [1,0]
=> 0
[1,1] => [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[2] => [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,2] => [2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[2,1] => [2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[3] => [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,3] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[2,2] => [2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2
[3,1] => [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[4] => [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,4] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[2,3] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[3,2] => [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[4,1] => [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[5] => [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,5] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[2,2,2] => [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[2,4] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[4,2] => [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[5,1] => [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[6] => [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]
=> 0
[1,6] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[2,2,3] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[2,3,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[2,5] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2
[3,2,2] => [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[5,2] => [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2
[6,1] => [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[7] => [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]
=> 0
[2,2,4] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[2,4,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[2,6] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[4,2,2] => [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[6,2] => [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> 2
[2,2,5] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[2,5,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,3] => [3,3,3]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
[5,2,2] => [5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> 3
[3,3,4] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[3,4,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[4,3,3] => [4,3,3]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 4
[3,3,3,3] => [3,3,3,3]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5
Description
The number of valleys of the Dyck path.
The following 361 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000209Maximum difference of elements in cycles. St000211The rank of the set partition. St000234The number of global ascents of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000662The staircase size of the code of a permutation. St000703The number of deficiencies of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001090The number of pop-stack-sorts needed to sort a permutation. St001197The global dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001489The maximum of the number of descents and the number of inverse descents. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St000011The number of touch points (or returns) of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000058The order of a permutation. St000153The number of adjacent cycles of a permutation. St000381The largest part of an integer composition. St000383The last part of an integer composition. St000451The length of the longest pattern of the form k 1 2. St000470The number of runs in a permutation. St000617The number of global maxima of a Dyck path. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000808The number of up steps of the associated bargraph. St000883The number of longest increasing subsequences of a permutation. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn−1] such that n=c0<ci for all i>0 a Dyck path as follows:
St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001733The number of weak left to right maxima of a Dyck path. St001809The index of the step at the first peak of maximal height in a Dyck path. St000439The position of the first down step of a Dyck path. St000521The number of distinct subtrees of an ordered tree. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn−1] by adding c0 to cn−1. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000442The maximal area to the right of an up step of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000354The number of recoils of a permutation. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000502The number of successions of a set partitions. St000503The maximal difference between two elements in a common block. St000728The dimension of a set partition. St000795The mad of a permutation. St000809The reduced reflection length of the permutation. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000833The comajor index of a permutation. St000874The position of the last double rise in a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. St000947The major index east count of a Dyck path. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St000420The number of Dyck paths that are weakly above a Dyck path. St000485The length of the longest cycle of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St000844The size of the largest block in the direct sum decomposition of a permutation. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001062The maximal size of a block of a set partition. St001808The box weight or horizontal decoration of a Dyck path. St000306The bounce count of a Dyck path. St000308The height of the tree associated to a permutation. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000141The maximum drop size of a permutation. St000214The number of adjacencies of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000007The number of saliances of the permutation. St000110The number of permutations less than or equal to a permutation in left weak order. St001498The normalised height of a Nakayama algebra with magnitude 1. St000006The dinv of a Dyck path. St000245The number of ascents of a permutation. St000441The number of successions of a permutation. St000443The number of long tunnels of a Dyck path. St000672The number of minimal elements in Bruhat order not less than the permutation. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001199The dominant dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001523The degree of symmetry of a Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000144The pyramid weight of the Dyck path. St000393The number of strictly increasing runs in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001267The length of the Lyndon factorization of the binary word. St001437The flex of a binary word. St001480The number of simple summands of the module J^2/J^3. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St000335The difference of lower and upper interactions. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St000005The bounce statistic of a Dyck path. St000021The number of descents of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000067The inversion number of the alternating sign matrix. St000120The number of left tunnels of a Dyck path. St000157The number of descents of a standard tableau. St000168The number of internal nodes of an ordered tree. St000238The number of indices that are not small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St000331The number of upper interactions of a Dyck path. St000332The positive inversions of an alternating sign matrix. St000670The reversal length of a permutation. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of Ext2A(S,A) for a simple module S over the corresponding Nakayama algebra A. 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. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by τΩ1 composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000015The number of peaks of a Dyck path. St000056The decomposition (or block) number of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000166The depth minus 1 of an ordered tree. St000240The number of indices that are not small excedances. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000392The length of the longest run of ones in a binary word. St000628The balance of a binary word. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000982The length of the longest constant subword. St000991The number of right-to-left minima of a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001201The grade of the simple module S0 in the special CNakayama algebra corresponding to the Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn−1] such that n=c0<ci for all i>0 a special CNakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001372The length of a longest cyclic run of ones of a binary word. St001461The number of topologically connected components of the chord diagram of a permutation. St001481The minimal height of a peak of a Dyck path. St001530The depth of a Dyck path. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St000094The depth of an ordered tree. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001959The product of the heights of the peaks of a Dyck path. St000083The number of left oriented leafs of a binary tree except the first one. St000216The absolute length of a permutation. St000989The number of final rises of a permutation. St000654The first descent of a permutation. St000702The number of weak deficiencies of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000659The number of rises of length at least 2 of a Dyck path. St000731The number of double exceedences of a permutation. St000919The number of maximal left branches of a binary tree. St000028The number of stack-sorts needed to sort a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001933The largest multiplicity of a part in an integer partition. St000387The matching number of a graph. St001792The arboricity of a graph. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000742The number of big ascents of a permutation after prepending zero. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001729The number of visible descents of a permutation. St000480The number of lower covers of a partition in dominance order. St000993The multiplicity of the largest part of an integer partition. St000744The length of the path to the largest entry in a standard Young tableau. St000039The number of crossings of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001394The genus of a permutation. St001665The number of pure excedances of a permutation. St001684The reduced word complexity of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000446The disorder of a permutation. St001589The nesting number of a perfect matching. St001726The number of visible inversions of a permutation. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between eiJ and ejJ (the radical of the indecomposable projective modules). St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St001188The number of simple modules S with grade inf at least two in the Nakayama algebra A corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001948The number of augmented double ascents of a permutation. St000256The number of parts from which one can substract 2 and still get an integer partition. St000822The Hadwiger number of the graph. St001083The number of boxed occurrences of 132 in a permutation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000352The Elizalde-Pak rank of a permutation. St001330The hat guessing number of a graph. St000455The second largest eigenvalue of a graph if it is integral. St000624The normalized sum of the minimal distances to a greater element. St000646The number of big ascents of a permutation. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001469The holeyness of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000133The "bounce" of a permutation. St000317The cycle descent number of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001874Lusztig's a-function for the symmetric group. St000619The number of cyclic descents of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001183The maximum of projdim(S)+injdim(S) over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St000137The Grundy value of an integer partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001569The maximal modular displacement of a permutation. St001668The number of points of the poset minus the width of the poset. St001597The Frobenius rank of a skew partition. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St001632The number of indecomposable injective modules I with dim Ext^1(I,A)=1 for the incidence algebra A of a poset. St001207The Lowey length of the algebra A/T when T is the 1-tilting module corresponding to the permutation in the Auslander algebra of K[x]/(x^n). St000100The number of linear extensions of a poset. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St000454The largest eigenvalue of a graph if it is integral. St001413Half the length of the longest even length palindromic prefix of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001811The Castelnuovo-Mumford regularity of a permutation. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St000298The order dimension or Dushnik-Miller dimension of a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000243The number of cyclic valleys and cyclic peaks of a permutation. 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. St000456The monochromatic index of a connected graph. St000464The Schultz index of a connected graph. St001545The second Elser number of a connected graph. St000023The number of inner peaks of a permutation. St000302The determinant of the distance matrix of a connected graph. St000353The number of inner valleys of a permutation. St000467The hyper-Wiener index of a connected graph. St000472The sum of the ascent bottoms of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000663The number of right floats of a permutation. St000732The number of double deficiencies of a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001388The number of non-attacking neighbors of a permutation. St001470The cyclic holeyness of a permutation. St001712The number of natural descents of a standard Young tableau. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000699The toughness times the least common multiple of 1,. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001735The number of permutations with the same set of runs. St001737The number of descents of type 2 in a permutation. St001741The largest integer such that all patterns of this size are contained in the permutation. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000618The number of self-evacuating tableaux of given shape. St000781The number of proper colouring schemes of a Ferrers diagram. St000824The sum of the number of descents and the number of recoils of a permutation. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001961The sum of the greatest common divisors of all pairs of parts. St000264The girth of a graph, which is not a tree. St001060The distinguishing index of a graph. St001118The acyclic chromatic index of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles.
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!