searching the database
Your data matches 256 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: St001513
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St001513: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001513: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 0
[1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,3,2] => 0
[1,1,0,0,1,0]
=> [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,3,1] => 0
[1,1,1,0,0,0]
=> [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 0
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 0
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 0
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 1
Description
The number of nested exceedences of a permutation.
For a permutation $\pi$, this is the number of pairs $i,j$ such that $i < j < \pi(j) < \pi(i)$. For exceedences, see [[St000155]].
Matching statistic: St000233
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000233: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
St000233: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => {{1}}
=> 0
[1,0,1,0]
=> [1,2] => {{1},{2}}
=> 0
[1,1,0,0]
=> [2,1] => {{1,2}}
=> 0
[1,0,1,0,1,0]
=> [1,2,3] => {{1},{2},{3}}
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => {{1},{2,3}}
=> 0
[1,1,0,0,1,0]
=> [2,1,3] => {{1,2},{3}}
=> 0
[1,1,0,1,0,0]
=> [2,3,1] => {{1,2,3}}
=> 0
[1,1,1,0,0,0]
=> [3,2,1] => {{1,3},{2}}
=> 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => {{1},{2},{3,4}}
=> 0
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => {{1},{2,3},{4}}
=> 0
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => {{1},{2,3,4}}
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => {{1},{2,4},{3}}
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => {{1,2},{3},{4}}
=> 0
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => {{1,2},{3,4}}
=> 0
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => {{1,2,3},{4}}
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => {{1,2,3,4}}
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => {{1,2,4},{3}}
=> 0
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => {{1,3},{2},{4}}
=> 0
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => {{1,3,4},{2}}
=> 0
[1,1,1,0,1,0,0,0]
=> [3,4,2,1] => {{1,3},{2,4}}
=> 0
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => {{1,4},{2,3}}
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => {{1},{2},{3,4,5}}
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => {{1},{2},{3,5},{4}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => {{1},{2,3,4},{5}}
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => {{1},{2,3,4,5}}
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => {{1},{2,3,5},{4}}
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => {{1},{2,4,5},{3}}
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,3,2] => {{1},{2,4},{3,5}}
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => {{1},{2,5},{3,4}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => {{1,2},{3,4,5}}
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => {{1,2},{3,5},{4}}
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => {{1,2,3},{4},{5}}
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => {{1,2,3},{4,5}}
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => {{1,2,3,4},{5}}
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => {{1,2,3,4,5}}
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => {{1,2,3,5},{4}}
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => {{1,2,4},{3},{5}}
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => {{1,2,4,5},{3}}
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => {{1,2,4},{3,5}}
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => {{1,2,5},{3,4}}
=> 1
Description
The number of nestings of a set partition.
This is given by the number of $i < i' < j' < j$ such that $i,j$ are two consecutive entries on one block, and $i',j'$ are consecutive entries in another block.
Matching statistic: St000375
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000375: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00064: Permutations —reverse⟶ Permutations
St000375: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [1,2] => 0
[1,1,0,0]
=> [1,2] => [2,1] => 0
[1,0,1,0,1,0]
=> [3,2,1] => [1,2,3] => 0
[1,0,1,1,0,0]
=> [2,3,1] => [1,3,2] => 0
[1,1,0,0,1,0]
=> [3,1,2] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [2,1,3] => [3,1,2] => 0
[1,1,1,0,0,0]
=> [1,2,3] => [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [1,2,4,3] => 0
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [1,3,2,4] => 0
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [1,4,2,3] => 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [1,4,3,2] => 0
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [2,1,4,3] => 0
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [3,1,2,4] => 0
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [4,1,2,3] => 0
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [4,1,3,2] => 0
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [3,2,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [4,2,1,3] => 0
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [4,3,1,2] => 0
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [4,3,2,1] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [1,2,3,5,4] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [1,2,4,3,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [1,2,5,3,4] => 0
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [1,2,5,4,3] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [1,3,2,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [1,3,2,5,4] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [1,4,2,3,5] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [1,5,2,3,4] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [1,5,2,4,3] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [1,4,3,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [1,5,3,2,4] => 0
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [1,5,4,2,3] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [2,1,3,5,4] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [2,1,4,3,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [2,1,5,3,4] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [2,1,5,4,3] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [3,1,2,4,5] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [3,1,2,5,4] => 0
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [4,1,2,3,5] => 0
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [5,1,2,3,4] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [5,1,2,4,3] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [4,1,3,2,5] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [5,1,3,2,4] => 0
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [5,1,4,2,3] => 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [5,1,4,3,2] => 1
Description
The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also [[St000213]] and [[St000119]].
Matching statistic: St000665
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000665: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000665: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,0,1,0]
=> [2,1] => 0
[1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 1
Description
The number of rafts of a permutation.
Let $\pi$ be a permutation of length $n$. A small ascent of $\pi$ is an index $i$ such that $\pi(i+1)= \pi(i)+1$, see [[St000441]], and a raft of $\pi$ is a non-empty maximal sequence of consecutive small ascents.
Matching statistic: St000754
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000754: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000754: Perfect matchings ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [(1,2)]
=> 0
[1,0,1,0]
=> [1,0,1,0]
=> [(1,2),(3,4)]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [(1,2),(3,4)]
=> 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 0
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 0
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 0
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6)]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8)]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [(1,2),(3,6),(4,5),(7,8)]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [(1,2),(3,4),(5,8),(6,7),(9,10)]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [(1,2),(3,4),(5,6),(7,8),(9,10)]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [(1,2),(3,4),(5,8),(6,7),(9,10)]
=> 1
Description
The Grundy value for the game of removing nestings in a perfect matching.
A move consists of choosing a nesting, that is two pairs $(a,d)$ and $(b,c)$ with $a < b < c < d$ and replacing them with the two pairs $(a,b)$ and $(c,d)$. The player facing a non-nesting matching looses.
Matching statistic: St001086
(load all 10 compositions to match this statistic)
(load all 10 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001086: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001086: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,2] => 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 1
Description
The number of occurrences of the consecutive pattern 132 in a permutation.
This is the number of occurrences of the pattern $132$, where the matched entries are all adjacent.
Matching statistic: St001222
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001222: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001222: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
Description
Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module.
Matching statistic: St001276
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
Description
The number of 2-regular indecomposable modules in the corresponding Nakayama algebra.
Generalising the notion of k-regular modules from simple to arbitrary indecomposable modules, we call an indecomposable module $M$ over an algebra $A$ k-regular in case it has projective dimension k and $Ext_A^i(M,A)=0$ for $i \neq k$ and $Ext_A^k(M,A)$ is 1-dimensional.
The number of Dyck paths where the statistic returns 0 might be given by [[OEIS:A035929]] .
Matching statistic: St001024
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St001024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St001024: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
Description
Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001201
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001201: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001201: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
Description
The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path.
The following 246 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001732The number of peaks visible from the left. St000023The number of inner peaks of a permutation. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000232The number of crossings of a set partition. St000252The number of nodes of degree 3 of a binary tree. St000257The number of distinct parts of a partition that occur at least twice. St000352The Elizalde-Pak rank of a permutation. St000360The number of occurrences of the pattern 32-1. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000386The number of factors DDU in a Dyck path. St000481The number of upper covers of a partition in dominance order. St000534The number of 2-rises of a permutation. St000658The number of rises of length 2 of a Dyck path. St000660The number of rises of length at least 3 of a Dyck path. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000864The number of circled entries of the shifted recording tableau of a permutation. St000871The number of very big ascents of a permutation. St000884The number of isolated descents of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive 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. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001394The genus of a permutation. St001673The degree of asymmetry of an integer composition. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St000007The number of saliances of the permutation. St000025The number of initial rises of a Dyck path. St000099The number of valleys of a permutation, including the boundary. St000201The number of leaf nodes in a binary tree. St000335The difference of lower and upper interactions. St000396The register function (or Horton-Strahler number) of a binary tree. St000542The number of left-to-right-minima of a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000701The protection number of a binary tree. St000758The length of the longest staircase fitting into an integer composition. St000862The number of parts of the shifted shape of a permutation. St000920The logarithmic height of a Dyck path. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000971The smallest closer of a set partition. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. 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. St001273The projective dimension of the first term in an injective coresolution of the regular module. 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. St001481The minimal height of a peak of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001733The number of weak left to right maxima of a Dyck path. St000439The position of the first down step of a Dyck path. St000981The length of the longest zigzag subpath. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000486The number of cycles of length at least 3 of a permutation. St000516The number of stretching pairs of a permutation. St000538The number of even inversions 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. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000661The number of rises of length 3 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000732The number of double deficiencies of a permutation. St000779The tier of a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000836The number of descents of distance 2 of a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St001114The number of odd descents of a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. 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)$. 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. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000354The number of recoils of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000504The cardinality of the first block of a set partition. St000678The number of up steps after the last double rise of a Dyck path. St000886The number of permutations with the same antidiagonal sums. St000919The number of maximal left branches of a binary tree. St000956The maximal displacement of a permutation. St000988The orbit size of a permutation under Foata's bijection. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000444The length of the maximal rise of a Dyck path. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. 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$. St000710The number of big deficiencies of a permutation. St000035The number of left outer peaks of a permutation. St001096The size of the overlap set of a permutation. St001737The number of descents of type 2 in a permutation. St000366The number of double descents of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000374The number of exclusive right-to-left minima of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000996The number of exclusive left-to-right maxima of a permutation. St000451The length of the longest pattern of the form k 1 2. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000069The number of maximal elements of a poset. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St001613The binary logarithm of the size of the center of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000264The girth of a graph, which is not a tree. St000455The second largest eigenvalue of a graph if it is integral. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000068The number of minimal elements in a poset. St000914The sum of the values of the Möbius function of a poset. St001621The number of atoms of a lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000145The Dyson rank of a partition. St000570The Edelman-Greene number of a permutation. 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)$. St000022The number of fixed points of a permutation. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000355The number of occurrences of the pattern 21-3. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000646The number of big ascents of a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001549The number of restricted non-inversions between exceedances. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000314The number of left-to-right-maxima of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000991The number of right-to-left minima of a permutation. St001729The number of visible descents of a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St001569The maximal modular displacement of a permutation. St001330The hat guessing number of a graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001964The interval resolution global dimension of a poset. St000181The number of connected components of the Hasse diagram for the poset. St001720The minimal length of a chain of small intervals in a lattice. St001890The maximum magnitude of the Möbius function of a poset. St001498The normalised height of a Nakayama algebra with magnitude 1. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001846The number of elements which do not have a complement in the lattice. 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$. St001866The nesting alignments of a signed permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000618The number of self-evacuating tableaux of given shape. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001875The number of simple modules with projective dimension at most 1. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001960The number of descents of a permutation minus one if its first entry is not one. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000348The non-inversion sum of a binary word. St000682The Grundy value of Welter's game on a binary word. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001413Half the length of the longest even length palindromic prefix of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001520The number of strict 3-descents. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001712The number of natural descents of a standard Young tableau. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001821The sorting index of a signed permutation. St001823The Stasinski-Voll length of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001948The number of augmented double ascents of a permutation. St000390The number of runs of ones in a binary word. St000805The number of peaks of the associated bargraph. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St000983The length of the longest alternating subword. St001313The number of Dyck paths above the lattice path given by a binary word. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001462The number of factors of a standard tableaux under concatenation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001768The number of reduced words of a signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001884The number of borders of a binary word. St001889The size of the connectivity set of a signed permutation. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000326The position of the first one in a binary word after appending a 1 at the end. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. 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. St001172The number of 1-rises at odd height of a Dyck path. St001584The area statistic between a Dyck path and its bounce path. St001910The height of the middle non-run of a Dyck path. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000546The number of global descents of a permutation. St000054The first entry of the permutation. St000842The breadth 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!