searching the database
Your data matches 469 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: St000062
(load all 28 compositions to match this statistic)
(load all 28 compositions to match this statistic)
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000062: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000062: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,4,3,2] => 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,4,3] => 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [2,3,4,1] => [2,4,3,1] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,3,1,4,5] => [2,5,1,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,3,4,2,5] => [1,5,4,3,2] => 2
[[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] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [2,3,5,1,4] => [2,5,4,1,3] => 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,2,4,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [2,4,5,1,3] => [2,5,4,1,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
Description
The length of the longest increasing subsequence of the permutation.
Matching statistic: St000308
(load all 28 compositions to match this statistic)
(load all 28 compositions to match this statistic)
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000308: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000308: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,4,3,2] => 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,4,3] => 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [2,3,4,1] => [2,4,3,1] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,3,1,4,5] => [2,5,1,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,3,4,2,5] => [1,5,4,3,2] => 2
[[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] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [2,3,5,1,4] => [2,5,4,1,3] => 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,2,4,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [2,4,5,1,3] => [2,5,4,1,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
Description
The height of the tree associated to a permutation.
A permutation can be mapped to a rooted tree with vertices $\{0,1,2,\ldots,n\}$ and root $0$ in the following way. Entries of the permutations are inserted one after the other, each child is larger than its parent and the children are in strict order from left to right. Details of the construction are found in [1].
The statistic is given by the height of this tree.
See also [[St000325]] for the width of this tree.
Matching statistic: St000314
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,4,3,2] => 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,4,3] => 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [2,3,4,1] => [2,4,3,1] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,3,1,4,5] => [2,5,1,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,3,4,2,5] => [1,5,4,3,2] => 2
[[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] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [2,3,5,1,4] => [2,5,4,1,3] => 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,2,4,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [2,4,5,1,3] => [2,5,4,1,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
Description
The number of left-to-right-maxima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a '''left-to-right-maximum''' if there does not exist a $j < i$ such that $\sigma_j > \sigma_i$.
This is also the number of weak exceedences of a permutation that are not mid-points of a decreasing subsequence of length 3, see [1] for more on the later description.
Matching statistic: St000862
(load all 71 compositions to match this statistic)
(load all 71 compositions to match this statistic)
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000862: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St000862: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,4,3,2] => 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,4,3] => 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [2,3,4,1] => [2,4,3,1] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,3,1,4,5] => [2,5,1,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,3,4,2,5] => [1,5,4,3,2] => 2
[[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] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [2,3,5,1,4] => [2,5,4,1,3] => 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,2,4,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [2,4,5,1,3] => [2,5,4,1,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
Description
The number of parts of the shifted shape of a permutation.
The diagram of a strict partition $\lambda_1 < \lambda_2 < \dots < \lambda_\ell$ of $n$ is a tableau with $\ell$ rows, the $i$-th row being indented by $i$ cells. A shifted standard Young tableau is a filling of such a diagram, where entries in rows and columns are strictly increasing.
The shifted Robinson-Schensted algorithm [1] associates to a permutation a pair $(P, Q)$ of standard shifted Young tableaux of the same shape, where off-diagonal entries in $Q$ may be circled.
This statistic records the number of parts of the shifted shape.
Matching statistic: St000920
(load all 27 compositions to match this statistic)
(load all 27 compositions to match this statistic)
Mp00004: Alternating sign matrices —rotate clockwise⟶ Alternating sign matrices
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [[1]]
=> [1,0]
=> 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [[0,0,0,1],[0,0,1,0],[0,1,0,0],[1,0,0,0]]
=> [1,1,1,1,0,0,0,0]
=> 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [[0,0,1,0],[0,1,-1,1],[1,-1,1,0],[0,1,0,0]]
=> [1,1,1,0,1,0,0,0]
=> 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [[0,1,0,0],[0,0,0,1],[1,-1,1,0],[0,1,0,0]]
=> [1,1,0,1,1,0,0,0]
=> 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [[0,0,1,0],[1,0,-1,1],[0,0,1,0],[0,1,0,0]]
=> [1,1,1,0,1,0,0,0]
=> 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [[0,1,0,0],[1,-1,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,1,0,1,1,0,0,0]
=> 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [[1,0,0,0],[0,0,0,1],[0,0,1,0],[0,1,0,0]]
=> [1,0,1,1,1,0,0,0]
=> 2
[[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]]
=> [[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[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]]
=> [[0,0,0,0,1],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,0,0]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [[0,0,0,0,1],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[1,0,0,0,0]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2
[[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]]
=> [[0,0,0,0,1],[0,0,0,1,0],[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[0,0,0,1,0],[0,0,1,0,0],[0,1,0,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [[0,0,1,0,0],[0,0,0,1,0],[0,1,0,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[[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]]
=> [[0,0,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [[0,0,0,0,1],[0,0,0,1,0],[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [[0,0,0,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [[0,0,1,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [[0,0,0,1,0],[0,1,0,0,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [[0,0,1,0,0],[0,1,0,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [[0,1,0,0,0],[0,0,1,0,0],[1,-1,0,0,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [[0,0,1,0,0],[0,0,0,0,1],[1,0,0,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[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]]
=> [[0,0,0,1,0],[0,1,0,-1,1],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [[0,0,1,0,0],[0,1,-1,0,1],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [[0,1,0,0,0],[0,0,0,0,1],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [[0,0,0,1,0],[0,1,0,-1,1],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [[0,0,1,0,0],[0,1,-1,0,1],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [[0,1,0,0,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [[0,0,0,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [[0,0,1,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [[0,1,0,0,0],[1,-1,1,0,0],[0,0,0,0,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [[0,1,0,0,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [[0,0,0,1,0],[1,0,0,-1,1],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [[0,0,1,0,0],[1,0,-1,0,1],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
Description
The logarithmic height of a Dyck path.
This is the floor of the binary logarithm of the usual height increased by one:
$$
\lfloor\log_2(1+height(D))\rfloor
$$
Matching statistic: St001239
(load all 30 compositions to match this statistic)
(load all 30 compositions to match this statistic)
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001239: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St001239: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1,0]
=> [1,0]
=> 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[[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,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[[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,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[[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,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[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,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[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,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2
Description
The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra.
Matching statistic: St001257
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001257: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001257: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1,0]
=> [1,0]
=> 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2
[[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,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[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,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[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,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[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,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[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,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2
Description
The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J.
Matching statistic: St001741
(load all 91 compositions to match this statistic)
(load all 91 compositions to match this statistic)
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St001741: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
St001741: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,2,3,4] => [1,4,3,2] => 2
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,2,4,3] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [2,1,4,3] => [2,1,4,3] => 2
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,3,4,2] => [1,4,3,2] => 2
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [2,3,4,1] => [2,4,3,1] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [2,3,1,4,5] => [2,5,1,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,3,4,2,5] => [1,5,4,3,2] => 2
[[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] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,3,2,5,4] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [2,3,1,5,4] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [3,2,1,5,4] => [3,2,1,5,4] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [2,1,5,3,4] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,3,5,2,4] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [2,3,5,1,4] => [2,5,4,1,3] => 2
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,2,4,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,4,2,5,3] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [2,4,1,5,3] => [2,5,1,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[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] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,2,5,4,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [2,1,5,4,3] => [2,1,5,4,3] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,4,5,2,3] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [2,4,5,1,3] => [2,5,4,1,3] => 2
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,4,3,5,2] => [1,5,4,3,2] => 2
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [3,4,1,5,2] => [3,5,1,4,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,3,5,4,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,4,5,3,2] => [1,5,4,3,2] => 2
Description
The largest integer such that all patterns of this size are contained in the permutation.
Matching statistic: St001011
(load all 19 compositions to match this statistic)
(load all 19 compositions to match this statistic)
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1,0]
=> [1,1,0,0]
=> 0 = 1 - 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 2 - 1
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 2 - 1
[[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,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 1 = 2 - 1
[[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,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 1 = 2 - 1
[[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,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[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,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[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,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
Description
Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001185
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00007: Alternating sign matrices —to Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001185: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St001185: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1,0]
=> [1,0]
=> 0 = 1 - 1
[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0],[0,0,1,0],[1,0,-1,1],[0,0,1,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0],[1,-1,1,0],[0,0,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0],[0,0,1,0],[1,-1,0,1],[0,1,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0],[0,0,1,0],[0,0,0,1],[1,0,0,0]]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[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,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,1,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[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,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,0,0,1]]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[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,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,0,-1,1],[0,0,0,1,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[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,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,0,0,0],[0,0,0,1,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,1,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,0,-1,0,1],[0,0,1,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,0,0,-1,1],[0,0,0,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[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,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,1,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,0,-1,1,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1],[1,0,0,0,0],[0,0,1,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[1,0,-1,1,0],[0,0,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[1,-1,1,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,0,1,0,0],[0,0,0,1,0],[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0]]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,1,-1,1],[0,0,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[1,-1,0,1,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[1,-1,0,1,0],[0,0,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
[[0,1,0,0,0],[0,0,0,1,0],[1,-1,0,0,1],[0,0,1,0,0],[0,1,0,0,0]]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 2 - 1
Description
The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra.
The following 459 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000007The number of saliances of the permutation. St000010The length of the partition. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000025The number of initial rises of a Dyck path. St000054The first entry of the permutation. St000058The order of a permutation. St000093The cardinality of a maximal independent set of vertices of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000159The number of distinct parts of the integer partition. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000244The cardinality of the automorphism group of a graph. St000258The burning number of a graph. St000259The diameter of a connected graph. St000298The order dimension or Dushnik-Miller dimension of a poset. St000346The number of coarsenings of a partition. St000364The exponent of the automorphism group of a graph. St000381The largest part of an integer composition. St000396The register function (or Horton-Strahler number) of a binary tree. St000397The Strahler number of a rooted tree. St000451The length of the longest pattern of the form k 1 2. St000454The largest eigenvalue of a graph if it is integral. St000469The distinguishing number of a graph. St000527The width of the poset. St000528The height of a poset. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000537The cutwidth of a graph. St000542The number of left-to-right-minima of a permutation. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000701The protection number of a binary tree. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000822The Hadwiger number of the graph. St000903The number of different parts of an integer composition. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000991The number of right-to-left minima of a permutation. St001029The size of the core of a graph. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001109The number of proper colourings of a graph with as few colours as possible. St001111The weak 2-dynamic chromatic number of a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows:
St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001261The Castelnuovo-Mumford regularity of a graph. St001270The bandwidth of a graph. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001343The dimension of the reduced incidence algebra of a poset. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001432The order dimension of the partition. St001471The magnitude of a Dyck path. St001481The minimal height of a peak of a Dyck path. St001494The Alon-Tarsi number of a graph. St001530The depth of a Dyck path. St001580The acyclic chromatic number of a graph. St001644The dimension of a graph. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001716The 1-improper chromatic number of a graph. St001717The largest size of an interval in a poset. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001962The proper pathwidth of a graph. St000028The number of stack-sorts needed to sort a permutation. St000053The number of valleys of the Dyck path. St000080The rank of the poset. St000141The maximum drop size of a permutation. St000225Difference between largest and smallest parts in a partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000306The bounce count of a Dyck path. St000310The minimal degree of a vertex of a graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000352The Elizalde-Pak rank of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000439The position of the first down step of a Dyck path. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000647The number of big descents of a permutation. St000660The number of rises of length at least 3 of a Dyck path. St000662The staircase size of the code of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000742The number of big ascents of a permutation after prepending zero. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000759The smallest missing part in an integer partition. St000845The maximal number of elements covered by an element in a poset. St000864The number of circled entries of the shifted recording tableau of a permutation. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000996The number of exclusive left-to-right maxima of a permutation. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001092The number of distinct even parts of a partition. St001108The 2-dynamic chromatic number of a graph. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. 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. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001271The competition number of a graph. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001280The number of parts of an integer partition that are at least two. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001333The cardinality of a minimal edge-isolating set of a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001358The largest degree of a regular subgraph of a graph. St001393The induced matching number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001469The holeyness of a permutation. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001587Half of the largest even part of an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001638The book thickness of a graph. St001665The number of pure excedances of a permutation. St001737The number of descents of type 2 in a permutation. St001743The discrepancy of a graph. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001792The arboricity of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001949The rigidity index of a graph. St000351The determinant of the adjacency matrix of a graph. St000623The number of occurrences of the pattern 52341 in a permutation. St001141The number of occurrences of hills of size 3 in a Dyck path. St000842The breadth of a permutation. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000487The length of the shortest cycle of a permutation. St000570The Edelman-Greene number of a permutation. St000990The first ascent of a permutation. St001162The minimum jump of a permutation. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001344The neighbouring number of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000486The number of cycles of length at least 3 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. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000629The defect of a binary word. St000661The number of rises of length 3 of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000929The constant term of the character polynomial of an integer partition. St000931The number of occurrences of the pattern UUU in a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001082The number of boxed occurrences of 123 in a permutation. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001130The number of two successive successions in a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001552The number of inversions between excedances and fixed points of a permutation. St000444The length of the maximal rise of a Dyck path. St000485The length of the longest cycle of a permutation. St000619The number of cyclic descents of a permutation. St000668The least common multiple of the parts of the partition. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000981The length of the longest zigzag subpath. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001060The distinguishing index of a graph. St001128The exponens consonantiae of a partition. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000061The number of nodes on the left branch of a binary tree. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000255The number of reduced Kogan faces with the permutation as type. St000326The position of the first one in a binary word after appending a 1 at the end. St000392The length of the longest run of ones in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000456The monochromatic index of a connected graph. St000501The size of the first part in the decomposition of a permutation. St000504The cardinality of the first block of a set partition. St000627The exponent of a binary word. St000628The balance of a binary word. St000640The rank of the largest boolean interval in a poset. St000654The first descent of a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000678The number of up steps after the last double rise of a Dyck path. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000762The sum of the positions of the weak records of an integer composition. St000781The number of proper colouring schemes of a Ferrers diagram. St000823The number of unsplittable factors of the set partition. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000847The number of standard Young tableaux whose descent set is the binary word. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000886The number of permutations with the same antidiagonal sums. St000914The sum of the values of the Möbius function of a poset. St000919The number of maximal left branches of a binary tree. St000993The multiplicity of the largest part of an integer partition. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001075The minimal size of a block of a set partition. St001081The number of minimal length factorizations of a permutation into star transpositions. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001256Number of simple reflexive modules that are 2-stable reflexive. St001260The permanent of an alternating sign matrix. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001468The smallest fixpoint of a permutation. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001568The smallest positive integer that does not appear twice in the partition. St001592The maximal number of simple paths between any two different vertices of a graph. St001722The number of minimal chains with small intervals between a binary word and the top element. 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. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000065The number of entries equal to -1 in an alternating sign matrix. St000119The number of occurrences of the pattern 321 in a permutation. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000210Minimum over maximum difference of elements in cycles. St000219The number of occurrences of the pattern 231 in a permutation. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000290The major index of a binary word. St000291The number of descents of a binary word. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000317The cycle descent number of a permutation. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000347The inversion sum of a binary word. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000367The number of simsun double descents of a permutation. St000370The genus of a graph. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000379The number of Hamiltonian cycles in a graph. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000461The rix statistic of a permutation. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000516The number of stretching pairs of a permutation. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000562The number of internal points of a set partition. St000565The major index of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000646The number of big ascents of a permutation. St000649The number of 3-excedences of a permutation. St000650The number of 3-rises of a permutation. St000658The number of rises of length 2 of a Dyck path. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000674The number of hills of a Dyck path. St000699The toughness times the least common multiple of 1,. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000748The major index of the permutation obtained by flattening the set partition. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000872The number of very big descents of a permutation. St000873The aix statistic of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000879The number of long braid edges in the graph of braid moves of a permutation. St000921The number of internal inversions of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000961The shifted major index of a permutation. St000962The 3-shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St000989The number of final rises of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St001281The normalized isoperimetric number of a graph. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001371The length of the longest Yamanouchi prefix of a binary word. St001381The fertility of a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001429The number of negative entries in a signed permutation. St001434The number of negative sum pairs of a signed permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001513The number of nested exceedences of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001793The difference between the clique number and the chromatic number of a graph. St001811The Castelnuovo-Mumford regularity of a permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000264The girth of a graph, which is not a tree. St000455The second largest eigenvalue of a graph if it is integral. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000260The radius of a connected graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000741The Colin de Verdière graph invariant. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St000846The maximal number of elements covering an element of a poset. St000100The number of linear extensions of a poset. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000633The size of the automorphism group of 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. St001095The number of non-isomorphic posets with precisely one further covering relation. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St000891The number of distinct diagonal sums of a permutation matrix. St000035The number of left outer peaks of a permutation. St000153The number of adjacent cycles of a permutation. St000237The number of small exceedances. St000402Half the size of the symmetry class of a permutation. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000245The number of ascents of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000834The number of right outer peaks of a permutation. St000871The number of very big ascents of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000740The last entry of a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001517The length of a longest pair of twins in a permutation. St001518The number of graphs with the same ordinary spectrum as the given graph. St001729The number of visible descents of a permutation. St001734The lettericity of a graph. St001806The upper middle entry of a permutation. St001928The number of non-overlapping descents in a permutation. St000630The length of the shortest palindromic decomposition of a binary word. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001115The number of even descents of a permutation. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001566The length of the longest arithmetic progression in a permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001180Number of indecomposable injective modules with projective dimension at most 1. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001569The maximal modular displacement of a permutation. St001890The maximum magnitude of the Möbius function of a poset. St001960The number of descents of a permutation minus one if its first entry is not one. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001948The number of augmented double ascents of a permutation. St001557The number of inversions of the second entry of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000635The number of strictly order preserving maps of a poset into itself. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000648The number of 2-excedences of a 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!