searching the database
Your data matches 66 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: St000985
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000985: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000985: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> 0
[1,2] => [2] => ([],2)
=> 0
[2,1] => [1,1] => ([(0,1)],2)
=> 1
[1,2,3] => [3] => ([],3)
=> 0
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,4] => [4] => ([],4)
=> 0
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,3,4,5] => [5] => ([],5)
=> 0
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
Description
The number of positive eigenvalues of the adjacency matrix of the graph.
Matching statistic: St001011
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 0
[1,2] => [2] => [1,1,0,0]
=> 0
[2,1] => [1,1] => [1,0,1,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 0
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
Description
Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000024
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ 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]
=> [1,0]
=> 0
[1,2] => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
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: St000291
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => 1 => 0
[1,2] => [2,1] => [1,1] => 11 => 0
[2,1] => [1,2] => [2] => 10 => 1
[1,2,3] => [3,2,1] => [1,1,1] => 111 => 0
[1,3,2] => [3,1,2] => [1,2] => 110 => 1
[2,1,3] => [2,3,1] => [2,1] => 101 => 1
[2,3,1] => [2,1,3] => [1,2] => 110 => 1
[3,1,2] => [1,3,2] => [2,1] => 101 => 1
[3,2,1] => [1,2,3] => [3] => 100 => 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1] => 1111 => 0
[1,2,4,3] => [4,3,1,2] => [1,1,2] => 1110 => 1
[1,3,2,4] => [4,2,3,1] => [1,2,1] => 1101 => 1
[1,3,4,2] => [4,2,1,3] => [1,1,2] => 1110 => 1
[1,4,2,3] => [4,1,3,2] => [1,2,1] => 1101 => 1
[1,4,3,2] => [4,1,2,3] => [1,3] => 1100 => 1
[2,1,3,4] => [3,4,2,1] => [2,1,1] => 1011 => 1
[2,1,4,3] => [3,4,1,2] => [2,2] => 1010 => 2
[2,3,1,4] => [3,2,4,1] => [1,2,1] => 1101 => 1
[2,3,4,1] => [3,2,1,4] => [1,1,2] => 1110 => 1
[2,4,1,3] => [3,1,4,2] => [1,2,1] => 1101 => 1
[2,4,3,1] => [3,1,2,4] => [1,3] => 1100 => 1
[3,1,2,4] => [2,4,3,1] => [2,1,1] => 1011 => 1
[3,1,4,2] => [2,4,1,3] => [2,2] => 1010 => 2
[3,2,1,4] => [2,3,4,1] => [3,1] => 1001 => 1
[3,2,4,1] => [2,3,1,4] => [2,2] => 1010 => 2
[3,4,1,2] => [2,1,4,3] => [1,2,1] => 1101 => 1
[3,4,2,1] => [2,1,3,4] => [1,3] => 1100 => 1
[4,1,2,3] => [1,4,3,2] => [2,1,1] => 1011 => 1
[4,1,3,2] => [1,4,2,3] => [2,2] => 1010 => 2
[4,2,1,3] => [1,3,4,2] => [3,1] => 1001 => 1
[4,2,3,1] => [1,3,2,4] => [2,2] => 1010 => 2
[4,3,1,2] => [1,2,4,3] => [3,1] => 1001 => 1
[4,3,2,1] => [1,2,3,4] => [4] => 1000 => 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1] => 11111 => 0
[1,2,3,5,4] => [5,4,3,1,2] => [1,1,1,2] => 11110 => 1
[1,2,4,3,5] => [5,4,2,3,1] => [1,1,2,1] => 11101 => 1
[1,2,4,5,3] => [5,4,2,1,3] => [1,1,1,2] => 11110 => 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,1,2,1] => 11101 => 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,1,3] => 11100 => 1
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,1,1] => 11011 => 1
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,2] => 11010 => 2
[1,3,4,2,5] => [5,3,2,4,1] => [1,1,2,1] => 11101 => 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,1,1,2] => 11110 => 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,1,2,1] => 11101 => 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,1,3] => 11100 => 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,1,1] => 11011 => 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,2,2] => 11010 => 2
[1,4,3,2,5] => [5,2,3,4,1] => [1,3,1] => 11001 => 1
[1,4,3,5,2] => [5,2,3,1,4] => [1,2,2] => 11010 => 2
[1,4,5,2,3] => [5,2,1,4,3] => [1,1,2,1] => 11101 => 1
Description
The number of descents of a binary word.
Matching statistic: St000340
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000340: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000340: 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,2] => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
Description
The number of non-final maximal constant sub-paths of length greater than one.
This is the total number of occurrences of the patterns $110$ and $001$.
Matching statistic: St001280
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001280: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001280: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1]
=> 0
[1,2] => [2,1] => [1,1] => [1,1]
=> 0
[2,1] => [1,2] => [2] => [2]
=> 1
[1,2,3] => [3,2,1] => [1,1,1] => [1,1,1]
=> 0
[1,3,2] => [2,3,1] => [2,1] => [2,1]
=> 1
[2,1,3] => [3,1,2] => [1,2] => [2,1]
=> 1
[2,3,1] => [1,3,2] => [2,1] => [2,1]
=> 1
[3,1,2] => [2,1,3] => [1,2] => [2,1]
=> 1
[3,2,1] => [1,2,3] => [3] => [3]
=> 1
[1,2,3,4] => [4,3,2,1] => [1,1,1,1] => [1,1,1,1]
=> 0
[1,2,4,3] => [3,4,2,1] => [2,1,1] => [2,1,1]
=> 1
[1,3,2,4] => [4,2,3,1] => [1,2,1] => [2,1,1]
=> 1
[1,3,4,2] => [2,4,3,1] => [2,1,1] => [2,1,1]
=> 1
[1,4,2,3] => [3,2,4,1] => [1,2,1] => [2,1,1]
=> 1
[1,4,3,2] => [2,3,4,1] => [3,1] => [3,1]
=> 1
[2,1,3,4] => [4,3,1,2] => [1,1,2] => [2,1,1]
=> 1
[2,1,4,3] => [3,4,1,2] => [2,2] => [2,2]
=> 2
[2,3,1,4] => [4,1,3,2] => [1,2,1] => [2,1,1]
=> 1
[2,3,4,1] => [1,4,3,2] => [2,1,1] => [2,1,1]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,2,1] => [2,1,1]
=> 1
[2,4,3,1] => [1,3,4,2] => [3,1] => [3,1]
=> 1
[3,1,2,4] => [4,2,1,3] => [1,1,2] => [2,1,1]
=> 1
[3,1,4,2] => [2,4,1,3] => [2,2] => [2,2]
=> 2
[3,2,1,4] => [4,1,2,3] => [1,3] => [3,1]
=> 1
[3,2,4,1] => [1,4,2,3] => [2,2] => [2,2]
=> 2
[3,4,1,2] => [2,1,4,3] => [1,2,1] => [2,1,1]
=> 1
[3,4,2,1] => [1,2,4,3] => [3,1] => [3,1]
=> 1
[4,1,2,3] => [3,2,1,4] => [1,1,2] => [2,1,1]
=> 1
[4,1,3,2] => [2,3,1,4] => [2,2] => [2,2]
=> 2
[4,2,1,3] => [3,1,2,4] => [1,3] => [3,1]
=> 1
[4,2,3,1] => [1,3,2,4] => [2,2] => [2,2]
=> 2
[4,3,1,2] => [2,1,3,4] => [1,3] => [3,1]
=> 1
[4,3,2,1] => [1,2,3,4] => [4] => [4]
=> 1
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1] => [1,1,1,1,1]
=> 0
[1,2,3,5,4] => [4,5,3,2,1] => [2,1,1,1] => [2,1,1,1]
=> 1
[1,2,4,3,5] => [5,3,4,2,1] => [1,2,1,1] => [2,1,1,1]
=> 1
[1,2,4,5,3] => [3,5,4,2,1] => [2,1,1,1] => [2,1,1,1]
=> 1
[1,2,5,3,4] => [4,3,5,2,1] => [1,2,1,1] => [2,1,1,1]
=> 1
[1,2,5,4,3] => [3,4,5,2,1] => [3,1,1] => [3,1,1]
=> 1
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,2,1] => [2,1,1,1]
=> 1
[1,3,2,5,4] => [4,5,2,3,1] => [2,2,1] => [2,2,1]
=> 2
[1,3,4,2,5] => [5,2,4,3,1] => [1,2,1,1] => [2,1,1,1]
=> 1
[1,3,4,5,2] => [2,5,4,3,1] => [2,1,1,1] => [2,1,1,1]
=> 1
[1,3,5,2,4] => [4,2,5,3,1] => [1,2,1,1] => [2,1,1,1]
=> 1
[1,3,5,4,2] => [2,4,5,3,1] => [3,1,1] => [3,1,1]
=> 1
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,2,1] => [2,1,1,1]
=> 1
[1,4,2,5,3] => [3,5,2,4,1] => [2,2,1] => [2,2,1]
=> 2
[1,4,3,2,5] => [5,2,3,4,1] => [1,3,1] => [3,1,1]
=> 1
[1,4,3,5,2] => [2,5,3,4,1] => [2,2,1] => [2,2,1]
=> 2
[1,4,5,2,3] => [3,2,5,4,1] => [1,2,1,1] => [2,1,1,1]
=> 1
Description
The number of parts of an integer partition that are at least two.
Matching statistic: St001512
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001512: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001512: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 0
[1,2] => [2] => ([],2)
=> ([],1)
=> 0
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 0
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 0
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
[4,3,2,1] => [1,1,1,1] => ([(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)
=> 1
[1,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 0
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 1
Description
The minimum rank of a graph.
The minimum rank of a simple graph G is the smallest possible rank over all symmetric real matrices whose entry in row $i$ and column $j$ (for $i\neq j$) is nonzero whenever $\{i, j\}$ is an edge in
$G$, and zero otherwise.
Matching statistic: St001007
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St001007: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ 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 = 0 + 1
[1,2] => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
[2,1] => [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 2 = 1 + 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
Description
Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001674
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001674: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St001674: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> ([],1)
=> 1 = 0 + 1
[1,2] => [2] => ([],2)
=> ([],1)
=> 1 = 0 + 1
[2,1] => [1,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,2,3] => [3] => ([],3)
=> ([],1)
=> 1 = 0 + 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 2 = 1 + 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> 2 = 1 + 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,2,3,4] => [4] => ([],4)
=> ([],1)
=> 1 = 0 + 1
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 2 = 1 + 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> 2 = 1 + 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,3,2,1] => [1,1,1,1] => ([(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)
=> 2 = 1 + 1
[1,2,3,4,5] => [5] => ([],5)
=> ([],1)
=> 1 = 0 + 1
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,1),(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> 2 = 1 + 1
Description
The number of vertices of the largest induced star graph in the graph.
Matching statistic: St000390
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Mp00109: Permutations —descent word⟶ Binary words
St000390: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000390: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => => ? = 0
[1,2] => 0 => 0
[2,1] => 1 => 1
[1,2,3] => 00 => 0
[1,3,2] => 01 => 1
[2,1,3] => 10 => 1
[2,3,1] => 01 => 1
[3,1,2] => 10 => 1
[3,2,1] => 11 => 1
[1,2,3,4] => 000 => 0
[1,2,4,3] => 001 => 1
[1,3,2,4] => 010 => 1
[1,3,4,2] => 001 => 1
[1,4,2,3] => 010 => 1
[1,4,3,2] => 011 => 1
[2,1,3,4] => 100 => 1
[2,1,4,3] => 101 => 2
[2,3,1,4] => 010 => 1
[2,3,4,1] => 001 => 1
[2,4,1,3] => 010 => 1
[2,4,3,1] => 011 => 1
[3,1,2,4] => 100 => 1
[3,1,4,2] => 101 => 2
[3,2,1,4] => 110 => 1
[3,2,4,1] => 101 => 2
[3,4,1,2] => 010 => 1
[3,4,2,1] => 011 => 1
[4,1,2,3] => 100 => 1
[4,1,3,2] => 101 => 2
[4,2,1,3] => 110 => 1
[4,2,3,1] => 101 => 2
[4,3,1,2] => 110 => 1
[4,3,2,1] => 111 => 1
[1,2,3,4,5] => 0000 => 0
[1,2,3,5,4] => 0001 => 1
[1,2,4,3,5] => 0010 => 1
[1,2,4,5,3] => 0001 => 1
[1,2,5,3,4] => 0010 => 1
[1,2,5,4,3] => 0011 => 1
[1,3,2,4,5] => 0100 => 1
[1,3,2,5,4] => 0101 => 2
[1,3,4,2,5] => 0010 => 1
[1,3,4,5,2] => 0001 => 1
[1,3,5,2,4] => 0010 => 1
[1,3,5,4,2] => 0011 => 1
[1,4,2,3,5] => 0100 => 1
[1,4,2,5,3] => 0101 => 2
[1,4,3,2,5] => 0110 => 1
[1,4,3,5,2] => 0101 => 2
[1,4,5,2,3] => 0010 => 1
[1,4,5,3,2] => 0011 => 1
Description
The number of runs of ones in a binary word.
The following 56 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000251The number of nonsingleton blocks of a set partition. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St001354The number of series nodes in the modular decomposition of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000884The number of isolated descents of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001928The number of non-overlapping descents in a permutation. St000470The number of runs in a permutation. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000834The number of right outer peaks of a permutation. St000035The number of left outer peaks of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension 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. St000021The number of descents of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000238The number of indices that are not small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St001874Lusztig's a-function for the symmetric group. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000455The second largest eigenvalue of a graph if it is integral. St001720The minimal length of a chain of small intervals in a lattice. St000353The number of inner valleys of a permutation. St000711The number of big exceedences of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000092The number of outer 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. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element 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. St001597The Frobenius rank of a skew partition. St001624The breadth of a lattice.
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!