searching the database
Your data matches 87 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: St000658
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [2]
=> [1,0,1,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,3),(2,3)],4)
=> [2]
=> [1,0,1,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(2,4),(3,4)],5)
=> [2]
=> [1,0,1,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [2,1]
=> [1,0,1,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
([(3,5),(4,5)],6)
=> [2]
=> [1,0,1,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [2,1]
=> [1,0,1,1,0,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 0
Description
The number of rises of length 2 of a Dyck path.
This is also the number of $(1,1)$ steps of the associated Łukasiewicz path, see [1].
A related statistic is the number of double rises in a Dyck path, [[St000024]].
Matching statistic: St001092
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001092: 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
St001092: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [3]
=> []
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> []
=> 0
([(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [4]
=> []
=> 0
([(0,3),(1,2)],4)
=> [2,2]
=> [2]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [4]
=> []
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> []
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> []
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> []
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> []
=> 0
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(1,4),(2,3)],5)
=> [2,2,1]
=> [2,1]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,1]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> []
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> []
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> []
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1]
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> []
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> []
=> 0
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1]
=> [1]
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [6]
=> []
=> 0
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [2,1,1]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,1]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,1,1]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [5,1]
=> [1]
=> 0
Description
The number of distinct even parts of a partition.
See Section 3.3.1 of [1].
Matching statistic: St000759
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000759: 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
St000759: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [2]
=> []
=> 1 = 0 + 1
([(0,1),(0,2),(1,2)],3)
=> [3]
=> []
=> 1 = 0 + 1
([(1,3),(2,3)],4)
=> [2]
=> []
=> 1 = 0 + 1
([(0,3),(1,3),(2,3)],4)
=> [3]
=> []
=> 1 = 0 + 1
([(0,3),(1,2)],4)
=> [1,1]
=> [1]
=> 2 = 1 + 1
([(0,3),(1,2),(2,3)],4)
=> [3]
=> []
=> 1 = 0 + 1
([(1,2),(1,3),(2,3)],4)
=> [3]
=> []
=> 1 = 0 + 1
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> []
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> []
=> 1 = 0 + 1
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> []
=> 1 = 0 + 1
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> []
=> 1 = 0 + 1
([(2,4),(3,4)],5)
=> [2]
=> []
=> 1 = 0 + 1
([(1,4),(2,4),(3,4)],5)
=> [3]
=> []
=> 1 = 0 + 1
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> []
=> 1 = 0 + 1
([(1,4),(2,3)],5)
=> [1,1]
=> [1]
=> 2 = 1 + 1
([(1,4),(2,3),(3,4)],5)
=> [3]
=> []
=> 1 = 0 + 1
([(0,1),(2,4),(3,4)],5)
=> [2,1]
=> [1]
=> 2 = 1 + 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> []
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(3,4)],5)
=> [4]
=> []
=> 1 = 0 + 1
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> []
=> 1 = 0 + 1
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> []
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 1 = 0 + 1
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> 1 = 0 + 1
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> []
=> 1 = 0 + 1
([(0,4),(1,3),(2,3),(2,4)],5)
=> [4]
=> []
=> 1 = 0 + 1
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1]
=> 2 = 1 + 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> []
=> 1 = 0 + 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> []
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> 1 = 0 + 1
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> 1 = 0 + 1
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> []
=> 1 = 0 + 1
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> []
=> 1 = 0 + 1
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> []
=> 1 = 0 + 1
([(3,5),(4,5)],6)
=> [2]
=> []
=> 1 = 0 + 1
([(2,5),(3,5),(4,5)],6)
=> [3]
=> []
=> 1 = 0 + 1
([(1,5),(2,5),(3,5),(4,5)],6)
=> [4]
=> []
=> 1 = 0 + 1
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> []
=> 1 = 0 + 1
([(2,5),(3,4)],6)
=> [1,1]
=> [1]
=> 2 = 1 + 1
([(2,5),(3,4),(4,5)],6)
=> [3]
=> []
=> 1 = 0 + 1
([(1,2),(3,5),(4,5)],6)
=> [2,1]
=> [1]
=> 2 = 1 + 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> []
=> 1 = 0 + 1
([(1,5),(2,5),(3,4),(4,5)],6)
=> [4]
=> []
=> 1 = 0 + 1
Description
The smallest missing part in an integer partition.
In [3], this is referred to as the mex, the minimal excluded part of the partition.
For compositions, this is studied in [sec.3.2., 1].
Matching statistic: St000373
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000373: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000373: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
([(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,3),(1,2)],4)
=> [2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => 1
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,4),(2,3)],5)
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 0
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 1
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 0
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 0
Description
The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j \geq j$ and there exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also [[St000213]] and [[St000119]].
Matching statistic: St000661
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000661: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000661: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
([(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,3),(1,2)],4)
=> [2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 0
([(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(1,4),(2,3)],5)
=> [2,2,1]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [6]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 0
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [5,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 0
Description
The number of rises of length 3 of a Dyck path.
Matching statistic: St001484
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St001484: 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
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St001484: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [2]
=> []
=> []
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> []
=> []
=> 0
([(1,3),(2,3)],4)
=> [2]
=> []
=> []
=> 0
([(0,3),(1,3),(2,3)],4)
=> [3]
=> []
=> []
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1]
=> [1]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [3]
=> []
=> []
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> []
=> []
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> []
=> []
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> []
=> []
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> []
=> []
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> []
=> []
=> 0
([(2,4),(3,4)],5)
=> [2]
=> []
=> []
=> 0
([(1,4),(2,4),(3,4)],5)
=> [3]
=> []
=> []
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> []
=> []
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1]
=> [1]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [3]
=> []
=> []
=> 0
([(0,1),(2,4),(3,4)],5)
=> [2,1]
=> [1]
=> [1]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> []
=> []
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [4]
=> []
=> []
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> []
=> []
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> []
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> []
=> []
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> []
=> []
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> []
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> []
=> []
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> []
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [6]
=> []
=> []
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> []
=> []
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> [4]
=> []
=> []
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1]
=> [1]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> []
=> []
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [6]
=> []
=> []
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> []
=> []
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> []
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> []
=> []
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> []
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [6]
=> []
=> []
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [7]
=> []
=> []
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> []
=> []
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [7]
=> []
=> []
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> []
=> []
=> 0
([(3,5),(4,5)],6)
=> [2]
=> []
=> []
=> 0
([(2,5),(3,5),(4,5)],6)
=> [3]
=> []
=> []
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [4]
=> []
=> []
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> []
=> []
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1]
=> [1]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [3]
=> []
=> []
=> 0
([(1,2),(3,5),(4,5)],6)
=> [2,1]
=> [1]
=> [1]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> []
=> []
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [4]
=> []
=> []
=> 0
Description
The number of singletons of an integer partition.
A singleton in an integer partition is a part that appear precisely once.
Matching statistic: St001728
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St001728: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St001728: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
([(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
([(0,3),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,3),(1,2)],4)
=> [2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => 1
([(0,3),(1,2),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(1,2),(1,3),(2,3)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
([(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
([(1,4),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,4),(2,3)],5)
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
([(1,4),(2,3),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,1),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
([(2,3),(2,4),(3,4)],5)
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
([(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 0
([(2,5),(3,5),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0
([(2,5),(3,4)],6)
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 1
([(2,5),(3,4),(4,5)],6)
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 0
([(1,2),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
([(3,4),(3,5),(4,5)],6)
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 0
Description
The number of invisible descents of a permutation.
A visible descent of a permutation $\pi$ is a position $i$ such that $\pi(i+1) \leq \min(i, \pi(i))$. Thus, an invisible descent satisfies $\pi(i) > \pi(i+1) > i$.
Matching statistic: St001826
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Values
([(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> 1
([(0,3),(1,2),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 0
([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(1,4),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> 1
([(1,4),(2,3),(3,4)],5)
=> ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,1),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 1
([(2,3),(2,4),(3,4)],5)
=> ([(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(2,3),(2,4),(3,4)],5)
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(3,5),(4,5)],6)
=> ([(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(2,5),(3,5),(4,5)],6)
=> ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> ([(0,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)
=> ([(0,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)
=> 0
([(2,5),(3,4)],6)
=> ([(2,5),(3,4)],6)
=> ([(1,4),(2,3)],5)
=> 1
([(2,5),(3,4),(4,5)],6)
=> ([(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(1,2),(3,5),(4,5)],6)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> ([(1,2),(3,4),(3,5),(4,5)],6)
=> 1
([(3,4),(3,5),(4,5)],6)
=> ([(3,4),(3,5),(4,5)],6)
=> ([(1,2),(1,3),(2,3)],4)
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 0
([(0,6),(1,6),(2,6),(3,5),(4,5)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,3),(2,3),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,6),(2,4),(2,5),(3,4),(3,5)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,4),(1,4),(2,5),(2,6),(3,5),(3,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,3),(0,6),(1,2),(1,5),(2,4),(2,5),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,3),(0,6),(1,2),(1,5),(2,4),(2,5),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,6),(1,2),(1,3),(2,3),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,5),(0,6),(1,2),(1,3),(2,3),(4,5),(4,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,1),(0,2),(1,2),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ([(0,1),(0,2),(1,2),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> ? = 0
Description
The maximal number of leaves on a vertex of a graph.
Matching statistic: St001125
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001125: Dyck paths ⟶ ℤResult quality: 68% ●values known / values provided: 68%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001125: Dyck paths ⟶ ℤResult quality: 68% ●values known / values provided: 68%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,3),(2,3)],4)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [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
([(2,4),(3,4)],5)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [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
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,4),(1,3),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [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,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(3,5),(4,5)],6)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,3),(0,5),(1,3),(1,5),(2,4),(2,5),(3,4),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,3),(1,4),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,5),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,3),(2,6),(3,5),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,5),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,4),(1,5),(2,3),(2,6),(3,6),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(1,6),(2,5),(2,6),(3,5),(3,6),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,2),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,5),(2,3),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,4),(1,6),(2,4),(2,6),(3,5),(3,6),(4,5),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,4),(2,4),(2,6),(3,5),(3,6),(4,5),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,2),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,5),(2,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,2),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
Description
The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra.
Matching statistic: St001276
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00275: Graphs —to edge-partition of connected components⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 68% ●values known / values provided: 68%●distinct values known / distinct values provided: 100%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 68% ●values known / values provided: 68%●distinct values known / distinct values provided: 100%
Values
([(0,2),(1,2)],3)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2),(1,2)],3)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,3),(2,3)],4)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2)],4)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(0,3),(1,2),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2),(1,3),(2,3)],4)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [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
([(2,4),(3,4)],5)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(1,4),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,4),(2,3)],5)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(1,4),(2,3),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,1),(2,4),(3,4)],5)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(2,3),(2,4),(3,4)],5)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(1,4),(2,3),(2,4),(3,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(1,3),(1,4),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> [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
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,4),(1,3),(2,3),(2,4)],5)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,3),(2,4),(3,4)],5)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
([(0,3),(1,2),(1,4),(2,4),(3,4)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,2),(1,4),(2,3)],5)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> [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,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [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
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> [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
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(3,5),(4,5)],6)
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(2,5),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
([(2,5),(3,4)],6)
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
([(2,5),(3,4),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,2),(3,5),(4,5)],6)
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
([(3,4),(3,5),(4,5)],6)
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
([(1,5),(2,5),(3,4),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,1),(2,5),(3,5),(4,5)],6)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
([(2,5),(3,4),(3,5),(4,5)],6)
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,3),(0,5),(1,3),(1,5),(2,4),(2,5),(3,4),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,3),(1,4),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,4)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,5),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,5),(2,6),(3,4),(3,6),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,3),(2,6),(3,5),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,5),(2,6),(3,4),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,4),(1,5),(2,3),(2,6),(3,6),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,4),(1,6),(2,5),(2,6),(3,5),(3,6),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,2),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,5),(2,3),(2,6),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,6),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,4),(1,6),(2,4),(2,6),(3,5),(3,6),(4,5),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,4),(2,4),(2,6),(3,5),(3,6),(4,5),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,2),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,4),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(0,6),(1,5),(2,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,6),(2,5),(2,6),(3,4),(3,5),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
([(1,2),(1,6),(2,5),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
Description
The number of 2-regular indecomposable modules in the corresponding Nakayama algebra.
Generalising the notion of k-regular modules from simple to arbitrary indecomposable modules, we call an indecomposable module $M$ over an algebra $A$ k-regular in case it has projective dimension k and $Ext_A^i(M,A)=0$ for $i \neq k$ and $Ext_A^k(M,A)$ is 1-dimensional.
The number of Dyck paths where the statistic returns 0 might be given by [[OEIS:A035929]] .
The following 77 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001498The normalised height of a Nakayama algebra with magnitude 1. St001568The smallest positive integer that does not appear twice in the partition. St000260The radius of a connected graph. St000259The diameter of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001587Half of the largest even part of an integer partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000143The largest repeated part of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St000379The number of Hamiltonian cycles in a graph. St000315The number of isolated vertices of a graph. St001204Call 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 special CNakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001274The number of indecomposable injective modules with projective dimension equal to two. St000917The open packing number of a graph. St000456The monochromatic index of a connected graph. St001545The second Elser number of a connected graph. St001271The competition number of a graph. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. 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. 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. St001248Sum of the even parts of a partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001657The number of twos in an integer partition. St000618The number of self-evacuating tableaux of given shape. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000455The second largest eigenvalue of a graph if it is integral. St001118The acyclic chromatic index of a graph. St001281The normalized isoperimetric number of a graph. St001592The maximal number of simple paths between any two different vertices of a graph. St000464The Schultz index of a connected graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. 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. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001845The number of join irreducibles minus the rank of a lattice. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001520The number of strict 3-descents. St000264The girth of a graph, which is not a tree. St000699The toughness times the least common multiple of 1,. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001877Number of indecomposable injective modules with projective dimension 2. St001621The number of atoms of a lattice. St001623The number of doubly irreducible elements of a lattice. St001624The breadth of a lattice. 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. St001846The number of elements which do not have a complement in the lattice. St001820The size of the image of the pop stack sorting operator. St000567The sum of the products of all pairs of parts. St000929The constant term of the character polynomial of an integer partition. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St000706The product of the factorials of the multiplicities of an integer partition. St000993The multiplicity of the largest part of an integer partition. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000934The 2-degree of an integer partition. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!