searching the database
Your data matches 79 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: St000105
(load all 170 compositions to match this statistic)
(load all 170 compositions to match this statistic)
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000105: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000105: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => {{1}}
=> 1 = 0 + 1
[1,2] => {{1},{2}}
=> 2 = 1 + 1
[2,1] => {{1,2}}
=> 1 = 0 + 1
[1,2,3] => {{1},{2},{3}}
=> 3 = 2 + 1
[1,3,2] => {{1},{2,3}}
=> 2 = 1 + 1
[2,1,3] => {{1,2},{3}}
=> 2 = 1 + 1
[2,3,1] => {{1,2,3}}
=> 1 = 0 + 1
[3,1,2] => {{1,3},{2}}
=> 2 = 1 + 1
[3,2,1] => {{1,3},{2}}
=> 2 = 1 + 1
[1,2,3,4] => {{1},{2},{3},{4}}
=> 4 = 3 + 1
[1,2,4,3] => {{1},{2},{3,4}}
=> 3 = 2 + 1
[1,3,2,4] => {{1},{2,3},{4}}
=> 3 = 2 + 1
[1,3,4,2] => {{1},{2,3,4}}
=> 2 = 1 + 1
[1,4,2,3] => {{1},{2,4},{3}}
=> 3 = 2 + 1
[1,4,3,2] => {{1},{2,4},{3}}
=> 3 = 2 + 1
[2,1,3,4] => {{1,2},{3},{4}}
=> 3 = 2 + 1
[2,1,4,3] => {{1,2},{3,4}}
=> 2 = 1 + 1
[2,3,1,4] => {{1,2,3},{4}}
=> 2 = 1 + 1
[2,3,4,1] => {{1,2,3,4}}
=> 1 = 0 + 1
[2,4,1,3] => {{1,2,4},{3}}
=> 2 = 1 + 1
[2,4,3,1] => {{1,2,4},{3}}
=> 2 = 1 + 1
[3,1,2,4] => {{1,3},{2},{4}}
=> 3 = 2 + 1
[3,1,4,2] => {{1,3,4},{2}}
=> 2 = 1 + 1
[3,2,1,4] => {{1,3},{2},{4}}
=> 3 = 2 + 1
[3,2,4,1] => {{1,3,4},{2}}
=> 2 = 1 + 1
[3,4,1,2] => {{1,3},{2,4}}
=> 2 = 1 + 1
[3,4,2,1] => {{1,3},{2,4}}
=> 2 = 1 + 1
[4,1,2,3] => {{1,4},{2},{3}}
=> 3 = 2 + 1
[4,1,3,2] => {{1,4},{2},{3}}
=> 3 = 2 + 1
[4,2,1,3] => {{1,4},{2},{3}}
=> 3 = 2 + 1
[4,2,3,1] => {{1,4},{2},{3}}
=> 3 = 2 + 1
[4,3,1,2] => {{1,4},{2,3}}
=> 2 = 1 + 1
[4,3,2,1] => {{1,4},{2,3}}
=> 2 = 1 + 1
[1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> 5 = 4 + 1
[1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 4 = 3 + 1
[1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 4 = 3 + 1
[1,2,4,5,3] => {{1},{2},{3,4,5}}
=> 3 = 2 + 1
[1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> 4 = 3 + 1
[1,2,5,4,3] => {{1},{2},{3,5},{4}}
=> 4 = 3 + 1
[1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 4 = 3 + 1
[1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 3 = 2 + 1
[1,3,4,2,5] => {{1},{2,3,4},{5}}
=> 3 = 2 + 1
[1,3,4,5,2] => {{1},{2,3,4,5}}
=> 2 = 1 + 1
[1,3,5,2,4] => {{1},{2,3,5},{4}}
=> 3 = 2 + 1
[1,3,5,4,2] => {{1},{2,3,5},{4}}
=> 3 = 2 + 1
[1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> 4 = 3 + 1
[1,4,2,5,3] => {{1},{2,4,5},{3}}
=> 3 = 2 + 1
[1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> 4 = 3 + 1
[1,4,3,5,2] => {{1},{2,4,5},{3}}
=> 3 = 2 + 1
[1,4,5,2,3] => {{1},{2,4},{3,5}}
=> 3 = 2 + 1
Description
The number of blocks in the set partition.
The generating function of this statistic yields the famous [[wiki:Stirling numbers of the second kind|Stirling numbers of the second kind]] $S_2(n,k)$ given by the number of [[SetPartitions|set partitions]] of $\{ 1,\ldots,n\}$ into $k$ blocks, see [1].
Matching statistic: St000211
(load all 28 compositions to match this statistic)
(load all 28 compositions to match this statistic)
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000211: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000211: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => {{1}}
=> 0
[1,2] => [2,1] => {{1,2}}
=> 1
[2,1] => [1,2] => {{1},{2}}
=> 0
[1,2,3] => [2,3,1] => {{1,2,3}}
=> 2
[1,3,2] => [2,1,3] => {{1,2},{3}}
=> 1
[2,1,3] => [3,2,1] => {{1,3},{2}}
=> 1
[2,3,1] => [1,2,3] => {{1},{2},{3}}
=> 0
[3,1,2] => [3,1,2] => {{1,3},{2}}
=> 1
[3,2,1] => [1,3,2] => {{1},{2,3}}
=> 1
[1,2,3,4] => [2,3,4,1] => {{1,2,3,4}}
=> 3
[1,2,4,3] => [2,3,1,4] => {{1,2,3},{4}}
=> 2
[1,3,2,4] => [2,4,3,1] => {{1,2,4},{3}}
=> 2
[1,3,4,2] => [2,1,3,4] => {{1,2},{3},{4}}
=> 1
[1,4,2,3] => [2,4,1,3] => {{1,2,4},{3}}
=> 2
[1,4,3,2] => [2,1,4,3] => {{1,2},{3,4}}
=> 2
[2,1,3,4] => [3,2,4,1] => {{1,3,4},{2}}
=> 2
[2,1,4,3] => [3,2,1,4] => {{1,3},{2},{4}}
=> 1
[2,3,1,4] => [4,2,3,1] => {{1,4},{2},{3}}
=> 1
[2,3,4,1] => [1,2,3,4] => {{1},{2},{3},{4}}
=> 0
[2,4,1,3] => [4,2,1,3] => {{1,4},{2},{3}}
=> 1
[2,4,3,1] => [1,2,4,3] => {{1},{2},{3,4}}
=> 1
[3,1,2,4] => [3,4,2,1] => {{1,3},{2,4}}
=> 2
[3,1,4,2] => [3,1,2,4] => {{1,3},{2},{4}}
=> 1
[3,2,1,4] => [4,3,2,1] => {{1,4},{2,3}}
=> 2
[3,2,4,1] => [1,3,2,4] => {{1},{2,3},{4}}
=> 1
[3,4,1,2] => [4,1,2,3] => {{1,4},{2},{3}}
=> 1
[3,4,2,1] => [1,4,2,3] => {{1},{2,4},{3}}
=> 1
[4,1,2,3] => [3,4,1,2] => {{1,3},{2,4}}
=> 2
[4,1,3,2] => [3,1,4,2] => {{1,3,4},{2}}
=> 2
[4,2,1,3] => [4,3,1,2] => {{1,4},{2,3}}
=> 2
[4,2,3,1] => [1,3,4,2] => {{1},{2,3,4}}
=> 2
[4,3,1,2] => [4,1,3,2] => {{1,4},{2},{3}}
=> 1
[4,3,2,1] => [1,4,3,2] => {{1},{2,4},{3}}
=> 1
[1,2,3,4,5] => [2,3,4,5,1] => {{1,2,3,4,5}}
=> 4
[1,2,3,5,4] => [2,3,4,1,5] => {{1,2,3,4},{5}}
=> 3
[1,2,4,3,5] => [2,3,5,4,1] => {{1,2,3,5},{4}}
=> 3
[1,2,4,5,3] => [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> 2
[1,2,5,3,4] => [2,3,5,1,4] => {{1,2,3,5},{4}}
=> 3
[1,2,5,4,3] => [2,3,1,5,4] => {{1,2,3},{4,5}}
=> 3
[1,3,2,4,5] => [2,4,3,5,1] => {{1,2,4,5},{3}}
=> 3
[1,3,2,5,4] => [2,4,3,1,5] => {{1,2,4},{3},{5}}
=> 2
[1,3,4,2,5] => [2,5,3,4,1] => {{1,2,5},{3},{4}}
=> 2
[1,3,4,5,2] => [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 1
[1,3,5,2,4] => [2,5,3,1,4] => {{1,2,5},{3},{4}}
=> 2
[1,3,5,4,2] => [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 2
[1,4,2,3,5] => [2,4,5,3,1] => {{1,2,4},{3,5}}
=> 3
[1,4,2,5,3] => [2,4,1,3,5] => {{1,2,4},{3},{5}}
=> 2
[1,4,3,2,5] => [2,5,4,3,1] => {{1,2,5},{3,4}}
=> 3
[1,4,3,5,2] => [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 2
[1,4,5,2,3] => [2,5,1,3,4] => {{1,2,5},{3},{4}}
=> 2
Description
The rank of the set partition.
This is defined as the number of elements in the set partition minus the number of blocks, or, equivalently, the number of arcs in the one-line diagram associated to the set partition.
Matching statistic: St000010
(load all 15 compositions to match this statistic)
(load all 15 compositions to match this statistic)
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00079: Set partitions —shape⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00079: Set partitions —shape⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => {{1}}
=> [1]
=> 1 = 0 + 1
[1,2] => {{1},{2}}
=> [1,1]
=> 2 = 1 + 1
[2,1] => {{1,2}}
=> [2]
=> 1 = 0 + 1
[1,2,3] => {{1},{2},{3}}
=> [1,1,1]
=> 3 = 2 + 1
[1,3,2] => {{1},{2,3}}
=> [2,1]
=> 2 = 1 + 1
[2,1,3] => {{1,2},{3}}
=> [2,1]
=> 2 = 1 + 1
[2,3,1] => {{1,2,3}}
=> [3]
=> 1 = 0 + 1
[3,1,2] => {{1,3},{2}}
=> [2,1]
=> 2 = 1 + 1
[3,2,1] => {{1,3},{2}}
=> [2,1]
=> 2 = 1 + 1
[1,2,3,4] => {{1},{2},{3},{4}}
=> [1,1,1,1]
=> 4 = 3 + 1
[1,2,4,3] => {{1},{2},{3,4}}
=> [2,1,1]
=> 3 = 2 + 1
[1,3,2,4] => {{1},{2,3},{4}}
=> [2,1,1]
=> 3 = 2 + 1
[1,3,4,2] => {{1},{2,3,4}}
=> [3,1]
=> 2 = 1 + 1
[1,4,2,3] => {{1},{2,4},{3}}
=> [2,1,1]
=> 3 = 2 + 1
[1,4,3,2] => {{1},{2,4},{3}}
=> [2,1,1]
=> 3 = 2 + 1
[2,1,3,4] => {{1,2},{3},{4}}
=> [2,1,1]
=> 3 = 2 + 1
[2,1,4,3] => {{1,2},{3,4}}
=> [2,2]
=> 2 = 1 + 1
[2,3,1,4] => {{1,2,3},{4}}
=> [3,1]
=> 2 = 1 + 1
[2,3,4,1] => {{1,2,3,4}}
=> [4]
=> 1 = 0 + 1
[2,4,1,3] => {{1,2,4},{3}}
=> [3,1]
=> 2 = 1 + 1
[2,4,3,1] => {{1,2,4},{3}}
=> [3,1]
=> 2 = 1 + 1
[3,1,2,4] => {{1,3},{2},{4}}
=> [2,1,1]
=> 3 = 2 + 1
[3,1,4,2] => {{1,3,4},{2}}
=> [3,1]
=> 2 = 1 + 1
[3,2,1,4] => {{1,3},{2},{4}}
=> [2,1,1]
=> 3 = 2 + 1
[3,2,4,1] => {{1,3,4},{2}}
=> [3,1]
=> 2 = 1 + 1
[3,4,1,2] => {{1,3},{2,4}}
=> [2,2]
=> 2 = 1 + 1
[3,4,2,1] => {{1,3},{2,4}}
=> [2,2]
=> 2 = 1 + 1
[4,1,2,3] => {{1,4},{2},{3}}
=> [2,1,1]
=> 3 = 2 + 1
[4,1,3,2] => {{1,4},{2},{3}}
=> [2,1,1]
=> 3 = 2 + 1
[4,2,1,3] => {{1,4},{2},{3}}
=> [2,1,1]
=> 3 = 2 + 1
[4,2,3,1] => {{1,4},{2},{3}}
=> [2,1,1]
=> 3 = 2 + 1
[4,3,1,2] => {{1,4},{2,3}}
=> [2,2]
=> 2 = 1 + 1
[4,3,2,1] => {{1,4},{2,3}}
=> [2,2]
=> 2 = 1 + 1
[1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> [1,1,1,1,1]
=> 5 = 4 + 1
[1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,2,4,5,3] => {{1},{2},{3,4,5}}
=> [3,1,1]
=> 3 = 2 + 1
[1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,2,5,4,3] => {{1},{2},{3,5},{4}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,3,2,5,4] => {{1},{2,3},{4,5}}
=> [2,2,1]
=> 3 = 2 + 1
[1,3,4,2,5] => {{1},{2,3,4},{5}}
=> [3,1,1]
=> 3 = 2 + 1
[1,3,4,5,2] => {{1},{2,3,4,5}}
=> [4,1]
=> 2 = 1 + 1
[1,3,5,2,4] => {{1},{2,3,5},{4}}
=> [3,1,1]
=> 3 = 2 + 1
[1,3,5,4,2] => {{1},{2,3,5},{4}}
=> [3,1,1]
=> 3 = 2 + 1
[1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,4,2,5,3] => {{1},{2,4,5},{3}}
=> [3,1,1]
=> 3 = 2 + 1
[1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> [2,1,1,1]
=> 4 = 3 + 1
[1,4,3,5,2] => {{1},{2,4,5},{3}}
=> [3,1,1]
=> 3 = 2 + 1
[1,4,5,2,3] => {{1},{2,4},{3,5}}
=> [2,2,1]
=> 3 = 2 + 1
Description
The length of the partition.
Matching statistic: St000507
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000507: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000507: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [[1]]
=> 1 = 0 + 1
[1,2] => [1,2] => [[1,2]]
=> 2 = 1 + 1
[2,1] => [2,1] => [[1],[2]]
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => [[1,2,3]]
=> 3 = 2 + 1
[1,3,2] => [1,3,2] => [[1,2],[3]]
=> 2 = 1 + 1
[2,1,3] => [2,1,3] => [[1,3],[2]]
=> 2 = 1 + 1
[2,3,1] => [3,2,1] => [[1],[2],[3]]
=> 1 = 0 + 1
[3,1,2] => [3,1,2] => [[1,3],[2]]
=> 2 = 1 + 1
[3,2,1] => [2,3,1] => [[1,2],[3]]
=> 2 = 1 + 1
[1,2,3,4] => [1,2,3,4] => [[1,2,3,4]]
=> 4 = 3 + 1
[1,2,4,3] => [1,2,4,3] => [[1,2,3],[4]]
=> 3 = 2 + 1
[1,3,2,4] => [1,3,2,4] => [[1,2,4],[3]]
=> 3 = 2 + 1
[1,3,4,2] => [1,4,3,2] => [[1,2],[3],[4]]
=> 2 = 1 + 1
[1,4,2,3] => [1,4,2,3] => [[1,2,4],[3]]
=> 3 = 2 + 1
[1,4,3,2] => [1,3,4,2] => [[1,2,3],[4]]
=> 3 = 2 + 1
[2,1,3,4] => [2,1,3,4] => [[1,3,4],[2]]
=> 3 = 2 + 1
[2,1,4,3] => [2,1,4,3] => [[1,3],[2,4]]
=> 2 = 1 + 1
[2,3,1,4] => [3,2,1,4] => [[1,4],[2],[3]]
=> 2 = 1 + 1
[2,3,4,1] => [4,3,2,1] => [[1],[2],[3],[4]]
=> 1 = 0 + 1
[2,4,1,3] => [4,2,1,3] => [[1,4],[2],[3]]
=> 2 = 1 + 1
[2,4,3,1] => [3,4,2,1] => [[1,2],[3],[4]]
=> 2 = 1 + 1
[3,1,2,4] => [3,1,2,4] => [[1,3,4],[2]]
=> 3 = 2 + 1
[3,1,4,2] => [4,3,1,2] => [[1,4],[2],[3]]
=> 2 = 1 + 1
[3,2,1,4] => [2,3,1,4] => [[1,2,4],[3]]
=> 3 = 2 + 1
[3,2,4,1] => [2,4,3,1] => [[1,2],[3],[4]]
=> 2 = 1 + 1
[3,4,1,2] => [4,1,3,2] => [[1,3],[2],[4]]
=> 2 = 1 + 1
[3,4,2,1] => [4,2,3,1] => [[1,3],[2],[4]]
=> 2 = 1 + 1
[4,1,2,3] => [4,1,2,3] => [[1,3,4],[2]]
=> 3 = 2 + 1
[4,1,3,2] => [3,4,1,2] => [[1,2],[3,4]]
=> 3 = 2 + 1
[4,2,1,3] => [2,4,1,3] => [[1,2],[3,4]]
=> 3 = 2 + 1
[4,2,3,1] => [2,3,4,1] => [[1,2,3],[4]]
=> 3 = 2 + 1
[4,3,1,2] => [3,1,4,2] => [[1,3],[2,4]]
=> 2 = 1 + 1
[4,3,2,1] => [3,2,4,1] => [[1,3],[2],[4]]
=> 2 = 1 + 1
[1,2,3,4,5] => [1,2,3,4,5] => [[1,2,3,4,5]]
=> 5 = 4 + 1
[1,2,3,5,4] => [1,2,3,5,4] => [[1,2,3,4],[5]]
=> 4 = 3 + 1
[1,2,4,3,5] => [1,2,4,3,5] => [[1,2,3,5],[4]]
=> 4 = 3 + 1
[1,2,4,5,3] => [1,2,5,4,3] => [[1,2,3],[4],[5]]
=> 3 = 2 + 1
[1,2,5,3,4] => [1,2,5,3,4] => [[1,2,3,5],[4]]
=> 4 = 3 + 1
[1,2,5,4,3] => [1,2,4,5,3] => [[1,2,3,4],[5]]
=> 4 = 3 + 1
[1,3,2,4,5] => [1,3,2,4,5] => [[1,2,4,5],[3]]
=> 4 = 3 + 1
[1,3,2,5,4] => [1,3,2,5,4] => [[1,2,4],[3,5]]
=> 3 = 2 + 1
[1,3,4,2,5] => [1,4,3,2,5] => [[1,2,5],[3],[4]]
=> 3 = 2 + 1
[1,3,4,5,2] => [1,5,4,3,2] => [[1,2],[3],[4],[5]]
=> 2 = 1 + 1
[1,3,5,2,4] => [1,5,3,2,4] => [[1,2,5],[3],[4]]
=> 3 = 2 + 1
[1,3,5,4,2] => [1,4,5,3,2] => [[1,2,3],[4],[5]]
=> 3 = 2 + 1
[1,4,2,3,5] => [1,4,2,3,5] => [[1,2,4,5],[3]]
=> 4 = 3 + 1
[1,4,2,5,3] => [1,5,4,2,3] => [[1,2,5],[3],[4]]
=> 3 = 2 + 1
[1,4,3,2,5] => [1,3,4,2,5] => [[1,2,3,5],[4]]
=> 4 = 3 + 1
[1,4,3,5,2] => [1,3,5,4,2] => [[1,2,3],[4],[5]]
=> 3 = 2 + 1
[1,4,5,2,3] => [1,5,2,4,3] => [[1,2,4],[3],[5]]
=> 3 = 2 + 1
Description
The number of ascents of a standard tableau.
Entry $i$ of a standard Young tableau is an '''ascent''' if $i+1$ appears to the right or above $i$ in the tableau (with respect to the English notation for tableaux).
Matching statistic: St000024
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [.,.]
=> [1,0]
=> 0
[1,2] => [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 1
[2,1] => [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 0
[1,2,3] => [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 2
[1,3,2] => [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1
[2,1,3] => [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[2,3,1] => [3,2,1] => [[[.,.],.],.]
=> [1,0,1,0,1,0]
=> 0
[3,1,2] => [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[3,2,1] => [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 1
[1,2,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 3
[1,2,4,3] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 2
[1,3,2,4] => [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,3,4,2] => [1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,4,2,3] => [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,4,3,2] => [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,3,4] => [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2
[2,1,4,3] => [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,3,1,4] => [3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,3,4,1] => [4,3,2,1] => [[[[.,.],.],.],.]
=> [1,0,1,0,1,0,1,0]
=> 0
[2,4,1,3] => [4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,4,3,1] => [3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,0,0,1,0,1,0]
=> 1
[3,1,2,4] => [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2
[3,1,4,2] => [4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,2,1,4] => [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[3,2,4,1] => [2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,0,0,1,0]
=> 1
[3,4,1,2] => [4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[3,4,2,1] => [4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 1
[4,1,2,3] => [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 2
[4,1,3,2] => [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,2,3,1] => [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 2
[4,3,1,2] => [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 1
[4,3,2,1] => [3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,2,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,2,3,5,4] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 3
[1,2,4,3,5] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,2,4,5,3] => [1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,2,5,3,4] => [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 3
[1,2,5,4,3] => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[1,3,2,4,5] => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,3,2,5,4] => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,3,4,2,5] => [1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,3,4,5,2] => [1,5,4,3,2] => [.,[[[[.,.],.],.],.]]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,3,5,2,4] => [1,5,3,2,4] => [.,[[[.,.],.],[.,.]]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,3,5,4,2] => [1,4,5,3,2] => [.,[[[.,[.,.]],.],.]]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,4,2,3,5] => [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,4,2,5,3] => [1,5,4,2,3] => [.,[[[.,.],.],[.,.]]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,4,3,2,5] => [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,4,3,5,2] => [1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,4,5,2,3] => [1,5,2,4,3] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
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: St000053
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000053: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [.,.]
=> [1,0]
=> 0
[1,2] => [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 1
[2,1] => [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 0
[1,2,3] => [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 2
[1,3,2] => [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1
[2,1,3] => [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[2,3,1] => [3,2,1] => [[[.,.],.],.]
=> [1,1,1,0,0,0]
=> 0
[3,1,2] => [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[3,2,1] => [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 1
[1,2,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,2,4,3] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,3,2,4] => [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,3,4,2] => [1,4,3,2] => [.,[[[.,.],.],.]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,4,2,3] => [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 2
[1,4,3,2] => [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[2,1,3,4] => [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 2
[2,1,4,3] => [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[2,3,1,4] => [3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 1
[2,3,4,1] => [4,3,2,1] => [[[[.,.],.],.],.]
=> [1,1,1,1,0,0,0,0]
=> 0
[2,4,1,3] => [4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 1
[2,4,3,1] => [3,4,2,1] => [[[.,[.,.]],.],.]
=> [1,1,1,0,1,0,0,0]
=> 1
[3,1,2,4] => [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 2
[3,1,4,2] => [4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,1,1,0,0,0,1,0]
=> 1
[3,2,1,4] => [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,2,4,1] => [2,4,3,1] => [[.,[[.,.],.]],.]
=> [1,1,0,1,1,0,0,0]
=> 1
[3,4,1,2] => [4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[3,4,2,1] => [4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 1
[4,1,2,3] => [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 2
[4,1,3,2] => [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[4,2,1,3] => [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 2
[4,2,3,1] => [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 2
[4,3,1,2] => [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 1
[4,3,2,1] => [3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,2,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4
[1,2,3,5,4] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3
[1,2,4,3,5] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,2,4,5,3] => [1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,2,5,3,4] => [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 3
[1,2,5,4,3] => [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,3,2,4,5] => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,3,2,5,4] => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2,5] => [1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,3,4,5,2] => [1,5,4,3,2] => [.,[[[[.,.],.],.],.]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,3,5,2,4] => [1,5,3,2,4] => [.,[[[.,.],.],[.,.]]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,3,5,4,2] => [1,4,5,3,2] => [.,[[[.,[.,.]],.],.]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,4,2,3,5] => [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,4,2,5,3] => [1,5,4,2,3] => [.,[[[.,.],.],[.,.]]]
=> [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,4,3,2,5] => [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3
[1,4,3,5,2] => [1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,4,5,2,3] => [1,5,2,4,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
Description
The number of valleys of the Dyck path.
Matching statistic: St000157
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00088: Permutations —Kreweras complement⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000157: Standard tableaux ⟶ ℤ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] => [2,1] => [[1],[2]]
=> 1
[2,1] => [1,2] => [1,2] => [[1,2]]
=> 0
[1,2,3] => [2,3,1] => [3,2,1] => [[1],[2],[3]]
=> 2
[1,3,2] => [2,1,3] => [2,1,3] => [[1,3],[2]]
=> 1
[2,1,3] => [3,2,1] => [2,3,1] => [[1,2],[3]]
=> 1
[2,3,1] => [1,2,3] => [1,2,3] => [[1,2,3]]
=> 0
[3,1,2] => [3,1,2] => [3,1,2] => [[1,3],[2]]
=> 1
[3,2,1] => [1,3,2] => [1,3,2] => [[1,2],[3]]
=> 1
[1,2,3,4] => [2,3,4,1] => [4,3,2,1] => [[1],[2],[3],[4]]
=> 3
[1,2,4,3] => [2,3,1,4] => [3,2,1,4] => [[1,4],[2],[3]]
=> 2
[1,3,2,4] => [2,4,3,1] => [3,4,2,1] => [[1,2],[3],[4]]
=> 2
[1,3,4,2] => [2,1,3,4] => [2,1,3,4] => [[1,3,4],[2]]
=> 1
[1,4,2,3] => [2,4,1,3] => [4,2,1,3] => [[1,4],[2],[3]]
=> 2
[1,4,3,2] => [2,1,4,3] => [2,1,4,3] => [[1,3],[2,4]]
=> 2
[2,1,3,4] => [3,2,4,1] => [2,4,3,1] => [[1,2],[3],[4]]
=> 2
[2,1,4,3] => [3,2,1,4] => [2,3,1,4] => [[1,2,4],[3]]
=> 1
[2,3,1,4] => [4,2,3,1] => [2,3,4,1] => [[1,2,3],[4]]
=> 1
[2,3,4,1] => [1,2,3,4] => [1,2,3,4] => [[1,2,3,4]]
=> 0
[2,4,1,3] => [4,2,1,3] => [2,4,1,3] => [[1,2],[3,4]]
=> 1
[2,4,3,1] => [1,2,4,3] => [1,2,4,3] => [[1,2,3],[4]]
=> 1
[3,1,2,4] => [3,4,2,1] => [4,2,3,1] => [[1,3],[2],[4]]
=> 2
[3,1,4,2] => [3,1,2,4] => [3,1,2,4] => [[1,3,4],[2]]
=> 1
[3,2,1,4] => [4,3,2,1] => [3,2,4,1] => [[1,3],[2],[4]]
=> 2
[3,2,4,1] => [1,3,2,4] => [1,3,2,4] => [[1,2,4],[3]]
=> 1
[3,4,1,2] => [4,1,2,3] => [4,1,2,3] => [[1,3,4],[2]]
=> 1
[3,4,2,1] => [1,4,2,3] => [1,4,2,3] => [[1,2,4],[3]]
=> 1
[4,1,2,3] => [3,4,1,2] => [4,1,3,2] => [[1,3],[2],[4]]
=> 2
[4,1,3,2] => [3,1,4,2] => [4,3,1,2] => [[1,4],[2],[3]]
=> 2
[4,2,1,3] => [4,3,1,2] => [3,1,4,2] => [[1,3],[2,4]]
=> 2
[4,2,3,1] => [1,3,4,2] => [1,4,3,2] => [[1,2],[3],[4]]
=> 2
[4,3,1,2] => [4,1,3,2] => [3,4,1,2] => [[1,2],[3,4]]
=> 1
[4,3,2,1] => [1,4,3,2] => [1,3,4,2] => [[1,2,3],[4]]
=> 1
[1,2,3,4,5] => [2,3,4,5,1] => [5,4,3,2,1] => [[1],[2],[3],[4],[5]]
=> 4
[1,2,3,5,4] => [2,3,4,1,5] => [4,3,2,1,5] => [[1,5],[2],[3],[4]]
=> 3
[1,2,4,3,5] => [2,3,5,4,1] => [4,5,3,2,1] => [[1,2],[3],[4],[5]]
=> 3
[1,2,4,5,3] => [2,3,1,4,5] => [3,2,1,4,5] => [[1,4,5],[2],[3]]
=> 2
[1,2,5,3,4] => [2,3,5,1,4] => [5,3,2,1,4] => [[1,5],[2],[3],[4]]
=> 3
[1,2,5,4,3] => [2,3,1,5,4] => [3,2,1,5,4] => [[1,4],[2,5],[3]]
=> 3
[1,3,2,4,5] => [2,4,3,5,1] => [3,5,4,2,1] => [[1,2],[3],[4],[5]]
=> 3
[1,3,2,5,4] => [2,4,3,1,5] => [3,4,2,1,5] => [[1,2,5],[3],[4]]
=> 2
[1,3,4,2,5] => [2,5,3,4,1] => [3,4,5,2,1] => [[1,2,3],[4],[5]]
=> 2
[1,3,4,5,2] => [2,1,3,4,5] => [2,1,3,4,5] => [[1,3,4,5],[2]]
=> 1
[1,3,5,2,4] => [2,5,3,1,4] => [3,5,2,1,4] => [[1,2],[3,5],[4]]
=> 2
[1,3,5,4,2] => [2,1,3,5,4] => [2,1,3,5,4] => [[1,3,4],[2,5]]
=> 2
[1,4,2,3,5] => [2,4,5,3,1] => [5,3,4,2,1] => [[1,3],[2],[4],[5]]
=> 3
[1,4,2,5,3] => [2,4,1,3,5] => [4,2,1,3,5] => [[1,4,5],[2],[3]]
=> 2
[1,4,3,2,5] => [2,5,4,3,1] => [4,3,5,2,1] => [[1,3],[2],[4],[5]]
=> 3
[1,4,3,5,2] => [2,1,4,3,5] => [2,1,4,3,5] => [[1,3,5],[2,4]]
=> 2
[1,4,5,2,3] => [2,5,1,3,4] => [5,2,1,3,4] => [[1,4,5],[2],[3]]
=> 2
Description
The number of descents of a standard tableau.
Entry $i$ of a standard Young tableau is a descent if $i+1$ appears in a row below the row of $i$.
Matching statistic: St000394
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1,0]
=> 0
[1,2] => [1,2] => [2] => [1,1,0,0]
=> 1
[2,1] => [2,1] => [1,1] => [1,0,1,0]
=> 0
[1,2,3] => [1,2,3] => [3] => [1,1,1,0,0,0]
=> 2
[1,3,2] => [1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1
[2,1,3] => [2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,3,1] => [3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 0
[3,1,2] => [3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,2,1] => [2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,2,3,4] => [1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 3
[1,2,4,3] => [1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,2,4] => [1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2] => [1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,4,2,3] => [1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,3,2] => [1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[2,1,3,4] => [2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,4,3] => [2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[2,3,1,4] => [3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[2,3,4,1] => [4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0
[2,4,1,3] => [4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[2,4,3,1] => [3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,1,2,4] => [3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[3,1,4,2] => [4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[3,2,1,4] => [2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,2,4,1] => [2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,4,1,2] => [4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[3,4,2,1] => [4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[4,1,2,3] => [4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[4,1,3,2] => [3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[4,2,3,1] => [2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[4,3,1,2] => [3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[4,3,2,1] => [3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,2,3,4,5] => [1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,2,3,5,4] => [1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,2,4,3,5] => [1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,2,4,5,3] => [1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,2,5,3,4] => [1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,2,5,4,3] => [1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,3,2,4,5] => [1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,3,2,5,4] => [1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,3,4,5,2] => [1,5,4,3,2] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,3,5,2,4] => [1,5,3,2,4] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,3,5,4,2] => [1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,4,2,3,5] => [1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,4,2,5,3] => [1,5,4,2,3] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4,3,2,5] => [1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,4,3,5,2] => [1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,4,5,2,3] => [1,5,2,4,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St001189
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1,0]
=> 0
[1,2] => [1,2] => [2] => [1,1,0,0]
=> 1
[2,1] => [2,1] => [1,1] => [1,0,1,0]
=> 0
[1,2,3] => [1,2,3] => [3] => [1,1,1,0,0,0]
=> 2
[1,3,2] => [1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1
[2,1,3] => [2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,3,1] => [3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 0
[3,1,2] => [3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,2,1] => [2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,2,3,4] => [1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 3
[1,2,4,3] => [1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[1,3,2,4] => [1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,3,4,2] => [1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,4,2,3] => [1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,4,3,2] => [1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[2,1,3,4] => [2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[2,1,4,3] => [2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[2,3,1,4] => [3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[2,3,4,1] => [4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0
[2,4,1,3] => [4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[2,4,3,1] => [3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,1,2,4] => [3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[3,1,4,2] => [4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[3,2,1,4] => [2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,2,4,1] => [2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,4,1,2] => [4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[3,4,2,1] => [4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[4,1,2,3] => [4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 2
[4,1,3,2] => [3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[4,2,3,1] => [2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[4,3,1,2] => [3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[4,3,2,1] => [3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,2,3,4,5] => [1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 4
[1,2,3,5,4] => [1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,2,4,3,5] => [1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,2,4,5,3] => [1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,2,5,3,4] => [1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,2,5,4,3] => [1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 3
[1,3,2,4,5] => [1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,3,2,5,4] => [1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,3,4,5,2] => [1,5,4,3,2] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,3,5,2,4] => [1,5,3,2,4] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,3,5,4,2] => [1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,4,2,3,5] => [1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,4,2,5,3] => [1,5,4,2,3] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,4,3,2,5] => [1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,4,3,5,2] => [1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,4,5,2,3] => [1,5,2,4,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000093
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000093: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000093: 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] => [1,2] => [2] => ([],2)
=> 2 = 1 + 1
[2,1] => [2,1] => [1,1] => ([(0,1)],2)
=> 1 = 0 + 1
[1,2,3] => [1,2,3] => [3] => ([],3)
=> 3 = 2 + 1
[1,3,2] => [1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[2,1,3] => [2,1,3] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[2,3,1] => [3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1 = 0 + 1
[3,1,2] => [3,1,2] => [1,2] => ([(1,2)],3)
=> 2 = 1 + 1
[3,2,1] => [2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,2,3,4] => [1,2,3,4] => [4] => ([],4)
=> 4 = 3 + 1
[1,2,4,3] => [1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,3,2,4] => [1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,3,4,2] => [1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,4,2,3] => [1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,4,3,2] => [1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[2,1,3,4] => [2,1,3,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[2,1,4,3] => [2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,3,1,4] => [3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[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 = 0 + 1
[2,4,1,3] => [4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[2,4,3,1] => [3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,1,2,4] => [3,1,2,4] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[3,1,4,2] => [4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,2,1,4] => [2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[3,2,4,1] => [2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,4,1,2] => [4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[3,4,2,1] => [4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,1,2,3] => [4,1,2,3] => [1,3] => ([(2,3)],4)
=> 3 = 2 + 1
[4,1,3,2] => [3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[4,2,1,3] => [2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> 3 = 2 + 1
[4,2,3,1] => [2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[4,3,1,2] => [3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[4,3,2,1] => [3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,2,3,4,5] => [1,2,3,4,5] => [5] => ([],5)
=> 5 = 4 + 1
[1,2,3,5,4] => [1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,2,4,3,5] => [1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,2,4,5,3] => [1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,2,5,3,4] => [1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,2,5,4,3] => [1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,3,2,4,5] => [1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,3,2,5,4] => [1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,3,4,2,5] => [1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,3,4,5,2] => [1,5,4,3,2] => [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,3,5,2,4] => [1,5,3,2,4] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,3,5,4,2] => [1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,4,2,3,5] => [1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,4,2,5,3] => [1,5,4,2,3] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,4,3,2,5] => [1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,4,3,5,2] => [1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
[1,4,5,2,3] => [1,5,2,4,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 2 + 1
Description
The cardinality of a maximal independent set of vertices of a graph.
An independent set of a graph is a set of pairwise non-adjacent vertices. A maximum independent set is an independent set of maximum cardinality. This statistic is also called the independence number or stability number $\alpha(G)$ of $G$.
The following 69 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000288The number of ones in a binary word. St000378The diagonal inversion number of an integer partition. St000676The number of odd rises of a Dyck path. St000733The row containing the largest entry of a standard tableau. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001494The Alon-Tarsi number of a graph. St001581The achromatic number of a graph. St000272The treewidth of a graph. St000362The size of a minimal vertex cover of a graph. St000536The pathwidth of a graph. St000172The Grundy number of a graph. St001029The size of the core of a graph. St001580The acyclic chromatic number of a graph. St001670The connected partition number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001963The tree-depth of a graph. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000470The number of runs in a permutation. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St001489The maximum of the number of descents and the number of inverse descents. St000167The number of leaves of an ordered tree. St000702The number of weak deficiencies of a permutation. St000245The number of ascents of a permutation. St000703The number of deficiencies of a permutation. St000662The staircase size of the code of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000021The number of descents of a permutation. St000325The width of the tree associated to a permutation. St000168The number of internal nodes of an ordered tree. St000316The number of non-left-to-right-maxima of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St000015The number of peaks of a Dyck path. St000314The number of left-to-right-maxima of a permutation. St000443The number of long tunnels of a Dyck path. St000822The Hadwiger number of the graph. 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St000083The number of left oriented leafs of a binary tree except the first one. St000216The absolute length of a permutation. St001480The number of simple summands of the module J^2/J^3. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St001427The number of descents of a signed permutation. St001812The biclique partition number of a graph. St001330The hat guessing number of a graph. St001864The number of excedances of a signed permutation. St001863The number of weak excedances of a signed permutation. St001935The number of ascents in a parking function. St001905The number of preferred parking spots in a parking function less than the index of the car. St001946The number of descents in a parking function. St001773The number of minimal elements in Bruhat order not less than the signed permutation.
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!