searching the database
Your data matches 138 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: St000655
(load all 16 compositions to match this statistic)
(load all 16 compositions to match this statistic)
St000655: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 1
[1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> 1
Description
The length of the minimal rise of a Dyck path.
For the length of a maximal rise, see [[St000444]].
Matching statistic: St000487
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000487: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000487: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => 1
[1,1,0,0]
=> [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => 1
[1,0,1,1,0,0]
=> [1,3,2] => 1
[1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1,0,1,0,0]
=> [2,3,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 1
Description
The length of the shortest cycle of a permutation.
Matching statistic: St000657
(load all 34 compositions to match this statistic)
(load all 34 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St000657: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000657: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => 1
[1,1,0,0]
=> [2] => 2
[1,0,1,0,1,0]
=> [1,1,1] => 1
[1,0,1,1,0,0]
=> [1,2] => 1
[1,1,0,0,1,0]
=> [2,1] => 1
[1,1,0,1,0,0]
=> [2,1] => 1
[1,1,1,0,0,0]
=> [3] => 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => 1
[1,0,1,1,1,0,0,0]
=> [1,3] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1
[1,1,0,0,1,1,0,0]
=> [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => 1
[1,1,0,1,1,0,0,0]
=> [2,2] => 2
[1,1,1,0,0,0,1,0]
=> [3,1] => 1
[1,1,1,0,0,1,0,0]
=> [3,1] => 1
[1,1,1,0,1,0,0,0]
=> [3,1] => 1
[1,1,1,1,0,0,0,0]
=> [4] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 1
Description
The smallest part of an integer composition.
Matching statistic: St001075
(load all 30 compositions to match this statistic)
(load all 30 compositions to match this statistic)
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St001075: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001075: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> {{1},{2}}
=> 1
[1,1,0,0]
=> {{1,2}}
=> 2
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 1
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 1
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 1
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 3
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 1
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 1
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 1
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 1
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 1
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 1
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 1
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 2
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 1
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 1
Description
The minimal size of a block of a set partition.
Matching statistic: St001236
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
St001236: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001236: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => 2
[1,1,0,0]
=> [2] => 1
[1,0,1,0,1,0]
=> [1,1,1] => 3
[1,0,1,1,0,0]
=> [1,2] => 1
[1,1,0,0,1,0]
=> [2,1] => 1
[1,1,0,1,0,0]
=> [2,1] => 1
[1,1,1,0,0,0]
=> [3] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => 2
[1,0,1,1,1,0,0,0]
=> [1,3] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1
[1,1,0,0,1,1,0,0]
=> [2,2] => 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => 1
[1,1,0,1,1,0,0,0]
=> [2,2] => 1
[1,1,1,0,0,0,1,0]
=> [3,1] => 1
[1,1,1,0,0,1,0,0]
=> [3,1] => 1
[1,1,1,0,1,0,0,0]
=> [3,1] => 1
[1,1,1,1,0,0,0,0]
=> [4] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 1
Description
The dominant dimension of the corresponding Comp-Nakayama algebra.
Matching statistic: St000685
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000685: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000685: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 2
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
Description
The dominant dimension of the LNakayama algebra associated to a Dyck path.
To every Dyck path there is an LNakayama algebra associated as described in [[St000684]].
Matching statistic: St001481
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001481: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001481: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
Description
The minimal height of a peak of a Dyck path.
Matching statistic: St000210
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
St000210: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
St000210: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => 0 = 1 - 1
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => 1 = 2 - 1
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => 0 = 1 - 1
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => 0 = 1 - 1
[1,1,1,0,0,0]
=> [[0,0,1],[1,0,0],[0,1,0]]
=> [3,1,2] => 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => 0 = 1 - 1
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
=> [3,1,2,4] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
=> [2,1,4,3] => 1 = 2 - 1
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
=> [1,4,2,3] => 0 = 1 - 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
=> [4,1,2,3] => 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => 0 = 1 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,4,2,3,5] => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,2,5,3,4] => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,5,2,3,4] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,1,2,4,5] => 0 = 1 - 1
Description
Minimum over maximum difference of elements in cycles.
Given a cycle $C$ in a permutation, we can compute the maximum distance between elements in the cycle, that is $\max \{ a_i-a_j | a_i, a_j \in C \}$.
The statistic is then the minimum of this value over all cycles in the permutation.
For example, all permutations with a fixed-point has statistic value 0,
and all permutations of $[n]$ with only one cycle, has statistic value $n-1$.
Matching statistic: St000700
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00010: Binary trees —to ordered tree: left child = left brother⟶ Ordered trees
St000700: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00010: Binary trees —to ordered tree: left child = left brother⟶ Ordered trees
St000700: Ordered trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [2,1] => [[.,.],.]
=> [[],[]]
=> 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [[[]]]
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => [[[.,.],.],.]
=> [[],[],[]]
=> 1
[1,0,1,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [[[]],[]]
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [[],[[]]]
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [[],[[]]]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [[[[]]]]
=> 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [[[[.,.],.],.],.]
=> [[],[],[],[]]
=> 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [[[.,[.,.]],.],.]
=> [[[]],[],[]]
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [[[.,.],[.,.]],.]
=> [[],[[]],[]]
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [[[.,.],[.,.]],.]
=> [[],[[]],[]]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [[[[]]],[]]
=> 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [[[.,.],.],[.,.]]
=> [[],[],[[]]]
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [[[]],[[]]]
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [[[.,.],.],[.,.]]
=> [[],[],[[]]]
=> 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [[[.,.],.],[.,.]]
=> [[],[],[[]]]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [[[]],[[]]]
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [[],[[[]]]]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [[],[[[]]]]
=> 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [[],[[[]]]]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [[[[[]]]]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [[[[[.,.],.],.],.],.]
=> [[],[],[],[],[]]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [[[[.,[.,.]],.],.],.]
=> [[[]],[],[],[]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [[[[.,.],[.,.]],.],.]
=> [[],[[]],[],[]]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [[[[.,.],[.,.]],.],.]
=> [[],[[]],[],[]]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [[[.,[.,[.,.]]],.],.]
=> [[[[]]],[],[]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [[[[.,.],.],[.,.]],.]
=> [[],[],[[]],[]]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [[[.,[.,.]],[.,.]],.]
=> [[[]],[[]],[]]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [[[[.,.],.],[.,.]],.]
=> [[],[],[[]],[]]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [[[[.,.],.],[.,.]],.]
=> [[],[],[[]],[]]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [[[.,[.,.]],[.,.]],.]
=> [[[]],[[]],[]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [[[.,.],[.,[.,.]]],.]
=> [[],[[[]]],[]]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [[[.,.],[.,[.,.]]],.]
=> [[],[[[]]],[]]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [[[.,.],[.,[.,.]]],.]
=> [[],[[[]]],[]]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [[[[[]]]],[]]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [[[[.,.],.],.],[.,.]]
=> [[],[],[],[[]]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [[[.,[.,.]],.],[.,.]]
=> [[[]],[],[[]]]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [[[.,.],[.,.]],[.,.]]
=> [[],[[]],[[]]]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [[[.,.],[.,.]],[.,.]]
=> [[],[[]],[[]]]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [[[[]]],[[]]]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [[[[.,.],.],.],[.,.]]
=> [[],[],[],[[]]]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [[[.,[.,.]],.],[.,.]]
=> [[[]],[],[[]]]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [[[[.,.],.],.],[.,.]]
=> [[],[],[],[[]]]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [[[[.,.],.],.],[.,.]]
=> [[],[],[],[[]]]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [[[.,[.,.]],.],[.,.]]
=> [[[]],[],[[]]]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [[[.,.],[.,.]],[.,.]]
=> [[],[[]],[[]]]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [[[.,.],[.,.]],[.,.]]
=> [[],[[]],[[]]]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [[[.,.],[.,.]],[.,.]]
=> [[],[[]],[[]]]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [[[[]]],[[]]]
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => [[[.,.],.],[.,[.,.]]]
=> [[],[],[[[]]]]
=> 1
Description
The protection number of an ordered tree.
This is the minimal distance from the root to a leaf.
Matching statistic: St000908
Mp00137: Dyck paths —to symmetric ASM⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000908: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St000908: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [[1,0],[0,1]]
=> [1,2] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [[0,1],[1,0]]
=> [2,1] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [[1,0,0],[0,1,0],[0,0,1]]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,0]
=> [[1,0,0],[0,0,1],[0,1,0]]
=> [1,3,2] => ([(0,1),(0,2)],3)
=> 1
[1,1,0,0,1,0]
=> [[0,1,0],[1,0,0],[0,0,1]]
=> [2,1,3] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [[0,1,0],[1,-1,1],[0,1,0]]
=> [1,3,2] => ([(0,1),(0,2)],3)
=> 1
[1,1,1,0,0,0]
=> [[0,0,1],[0,1,0],[1,0,0]]
=> [3,2,1] => ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
=> [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => ([(0,1),(0,2),(0,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
=> [2,1,3,4] => ([(0,3),(1,3),(3,2)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
=> [1,3,2,4] => ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => ([(0,3),(3,1),(3,2)],4)
=> 1
[1,1,0,1,1,0,0,0]
=> [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,4,3,2] => ([(0,1),(0,2),(0,3)],4)
=> 1
[1,1,1,0,0,0,1,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,0,0],[0,0,0,1]]
=> [3,2,1,4] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [[0,0,1,0],[0,1,0,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> [1,4,3,2] => ([(0,1),(0,2),(0,3)],4)
=> 1
[1,1,1,1,0,0,0,0]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> [4,3,2,1] => ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(0,4),(4,1),(4,2),(4,3)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(0,4),(4,1),(4,2),(4,3)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(0,4),(4,1),(4,2),(4,3)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => ([(0,1),(0,2),(0,3),(0,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,1,3,4,5] => ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [2,1,4,3,5] => ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,1,3,5,4] => ([(0,4),(1,4),(4,2),(4,3)],5)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,3,2,4,5] => ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
=> [1,2,4,3,5] => ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,2,3,5,4] => ([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(0,4),(4,1),(4,2),(4,3)],5)
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,4,3,2,5] => ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => ([(0,4),(4,1),(4,2),(4,3)],5)
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,5,4,3,2] => ([(0,1),(0,2),(0,3),(0,4)],5)
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [3,2,1,4,5] => ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1
Description
The length of the shortest maximal antichain in a poset.
The following 128 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000993The multiplicity of the largest part of an integer partition. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001316The domatic number of a graph. St000310The minimal degree of a vertex of a graph. St001119The length of a shortest maximal path in a graph. St000667The greatest common divisor of the parts of the partition. St001571The Cartan determinant of the integer partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000781The number of proper colouring schemes of a Ferrers diagram. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000284The Plancherel distribution on integer partitions. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. 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. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001128The exponens consonantiae of a partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000934The 2-degree of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000182The number of permutations whose cycle type is the given integer partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000321The number of integer partitions of n that are dominated by an integer partition. St000326The position of the first one in a binary word after appending a 1 at the end. St000345The number of refinements of a partition. St000517The Kreweras number of an integer partition. St000627The exponent of a binary word. St000628The balance of a binary word. St000913The number of ways to refine the partition into singletons. St000935The number of ordered refinements of an integer partition. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. 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. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. 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. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001256Number of simple reflexive modules that are 2-stable reflexive. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000260The radius of a connected graph. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001933The largest multiplicity of a part in an integer partition. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001162The minimum jump of a permutation. St000100The number of linear extensions of a poset. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001890The maximum magnitude of the Möbius function of a poset. St001330The hat guessing number of a graph. St000456The monochromatic index of a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001344The neighbouring number of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001498The normalised height of a Nakayama algebra with magnitude 1. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000618The number of self-evacuating tableaux of given shape. St001280The number of parts of an integer partition that are at least two. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001820The size of the image of the pop stack sorting operator. St001846The number of elements which do not have a complement in the lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001096The size of the overlap set of a permutation. St000741The Colin de Verdière graph invariant. St001877Number of indecomposable injective modules with projective dimension 2. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000750The number of occurrences of the pattern 4213 in a permutation. St001884The number of borders of a binary word. St000902 The minimal number of repetitions of an integer composition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001130The number of two successive successions in a permutation. St001625The Möbius invariant of a lattice. St001060The distinguishing index of a graph.
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!