searching the database
Your data matches 341 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: St001296
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001296: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001296: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,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]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
Description
The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra.
See [[http://www.findstat.org/DyckPaths/NakayamaAlgebras]].
Matching statistic: St000684
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000684: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
Description
The global dimension of the LNakayama algebra associated to a Dyck path.
An n-LNakayama algebra is a quiver algebra with a directed line as a connected quiver with $n$ points for $n \geq 2$. Number those points from the left to the right by $0,1,\ldots,n-1$.
The algebra is then uniquely determined by the dimension $c_i$ of the projective indecomposable modules at point $i$. Such algebras are then uniquely determined by lists of the form $[c_0,c_1,...,c_{n-1}]$ with the conditions: $c_{n-1}=1$ and $c_i -1 \leq c_{i+1}$ for all $i$. The number of such algebras is then the $n-1$-st Catalan number $C_{n-1}$.
One can get also an interpretation with Dyck paths by associating the top boundary of the Auslander-Reiten quiver (which is a Dyck path) to those algebras. Example: [3,4,3,3,2,1] corresponds to the Dyck path [1,1,0,1,1,0,0,1,0,0].
Conjecture: that there is an explicit bijection between $n$-LNakayama algebras with global dimension bounded by $m$ and Dyck paths with height at most $m$.
Examples:
* For $m=2$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1,2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192.
* For $m=3$, the number of Dyck paths with global dimension at most $m$ starts for $n \geq 2$ with 1, 2, 5, 13, 34, 89, 233, 610, 1597, 4181, 10946, 28657, 75025, 196418.
Matching statistic: St000688
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000688: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000688: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,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,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> 1
Description
The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path.
The global dimension is given by [[St000684]] and the dominant dimension is given by [[St000685]]. To every Dyck path there is an LNakayama algebra associated as described in [[St000684]].
Dyck paths for which the global dimension and the dominant dimension of the the LNakayama algebra coincide and both dimensions at least $2$ correspond to the LNakayama algebras that are higher Auslander algebras in the sense of [1].
Matching statistic: St001026
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00124: Dyck paths —Adin-Bagno-Roichman transformation⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,1,0,1,1,0,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,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,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> 1
Description
The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001174
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001174: Permutations ⟶ ℤResult quality: 50% ●values known / values provided: 77%●distinct values known / distinct values provided: 50%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St001174: Permutations ⟶ ℤResult quality: 50% ●values known / values provided: 77%●distinct values known / distinct values provided: 50%
Values
[1,0]
=> []
=> []
=> [] => ? = 0 - 1
[1,0,1,0]
=> [1]
=> [1,0]
=> [1] => ? = 1 - 1
[1,1,0,0]
=> []
=> []
=> [] => ? = 0 - 1
[1,0,1,0,1,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => 1 = 2 - 1
[1,0,1,1,0,0]
=> [1,1]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1,0,0,1,0]
=> [2]
=> [1,0,1,0]
=> [2,1] => 0 = 1 - 1
[1,1,0,1,0,0]
=> [1]
=> [1,0]
=> [1] => ? = 1 - 1
[1,1,1,0,0,0]
=> []
=> []
=> [] => ? = 0 - 1
[1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 1 = 2 - 1
[1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 1 = 2 - 1
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 1 = 2 - 1
[1,0,1,1,0,1,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 1 = 2 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [2,1,3] => 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[1,1,0,1,0,0,1,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 1 = 2 - 1
[1,1,0,1,0,1,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1,1,0,0,0,1,0]
=> [3]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0 = 1 - 1
[1,1,1,0,0,1,0,0]
=> [2]
=> [1,0,1,0]
=> [2,1] => 0 = 1 - 1
[1,1,1,0,1,0,0,0]
=> [1]
=> [1,0]
=> [1] => ? = 1 - 1
[1,1,1,1,0,0,0,0]
=> []
=> []
=> [] => ? = 0 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [6,3,4,2,5,7,1] => ? = 3 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [5,2,3,1,4,6] => 1 = 2 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [6,3,4,5,7,2,1] => ? = 3 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [5,2,3,4,6,1] => 1 = 2 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,1,2,3,5] => 1 = 2 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [6,5,3,2,4,7,1] => ? = 3 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [5,4,2,1,3,6] => 1 = 2 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [6,5,3,4,7,2,1] => ? = 3 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [5,4,2,3,6,1] => 1 = 2 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => 1 = 2 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [6,5,4,7,3,2,1] => ? = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,2,1] => 1 = 2 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 1 = 2 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [3,4,2,5,6,1] => 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [2,3,1,4,5] => 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,2,1] => 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [5,3,2,4,6,1] => 1 = 2 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => 1 = 2 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [5,3,4,6,2,1] => 1 = 2 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => 1 = 2 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 1 = 2 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [5,4,6,3,2,1] => 1 = 2 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 1 = 2 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 1 = 2 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [2,1,3] => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => 1 = 2 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [2,1,3,4] => 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 1 = 2 - 1
[1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 1 = 2 - 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => 0 = 1 - 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 1 = 2 - 1
[1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 1 = 2 - 1
[1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => 1 = 2 - 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> [1,2] => 0 = 1 - 1
[1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0 = 1 - 1
[1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0 = 1 - 1
[1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [1,0,1,0]
=> [2,1] => 0 = 1 - 1
[1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [1,0]
=> [1] => ? = 1 - 1
[1,1,1,1,1,0,0,0,0,0]
=> []
=> []
=> [] => ? = 0 - 1
[]
=> []
=> []
=> [] => ? = 0 - 1
Description
The 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)$.
Matching statistic: St000354
(load all 17 compositions to match this statistic)
(load all 17 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000354: Permutations ⟶ ℤResult quality: 58% ●values known / values provided: 58%●distinct values known / distinct values provided: 75%
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000354: Permutations ⟶ ℤResult quality: 58% ●values known / values provided: 58%●distinct values known / distinct values provided: 75%
Values
[1,0]
=> [1,1,0,0]
=> [2,3,1] => [1,2,3] => 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => [1,4,2,3] => 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [1,5,3,2,4] => 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [1,4,5,2,3] => 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [1,2,5,3,4] => 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [1,5,2,3,4] => 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [1,5,3,2,6,4] => 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [1,5,6,3,2,4] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [1,6,4,5,2,3] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [1,6,3,2,4,5] => 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [1,4,5,6,2,3] => 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [1,2,6,4,3,5] => 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [1,2,5,6,3,4] => 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [1,6,4,2,3,5] => 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [1,6,3,4,2,5] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [1,5,6,2,3,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [1,2,3,6,4,5] => 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [1,2,6,3,4,5] => 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [1,6,2,3,4,5] => 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,2,3,4,5,6] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [7,6,1,2,3,4,5] => [1,7,5,3,2,6,4] => ? = 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [5,6,1,2,3,7,4] => [1,5,3,2,6,7,4] => ? = 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [7,4,1,2,6,3,5] => [1,7,5,6,3,2,4] => ? = 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [5,7,1,2,6,3,4] => [1,5,6,3,2,7,4] => ? = 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [5,4,1,2,6,7,3] => [1,5,6,7,3,2,4] => ? = 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [7,3,1,6,2,4,5] => [1,7,5,2,3,4,6] => ? = 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [6,3,1,5,2,7,4] => [1,6,7,4,5,2,3] => ? = 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [7,4,1,6,2,3,5] => [1,7,5,2,4,6,3] => ? = 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [6,7,1,5,2,3,4] => [1,6,3,2,7,4,5] => ? = 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [6,4,1,5,2,7,3] => [1,6,7,3,2,4,5] => ? = 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,3,1,7,6,2,5] => [1,4,7,5,6,2,3] => ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [7,3,1,5,6,2,4] => [1,7,4,5,6,2,3] => ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [7,4,1,5,6,2,3] => [1,7,3,2,4,5,6] => ? = 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [4,3,1,5,6,7,2] => [1,4,5,6,7,2,3] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [2,6,7,1,3,4,5] => [1,2,6,4,3,7,5] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [2,6,5,1,3,7,4] => [1,2,6,7,4,3,5] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [2,7,4,1,6,3,5] => [1,2,7,5,6,3,4] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [2,7,5,1,6,3,4] => [1,2,7,4,3,5,6] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,5,4,1,6,7,3] => [1,2,5,6,7,3,4] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [6,3,7,1,2,4,5] => [1,6,4,2,3,7,5] => ? = 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [6,3,5,1,2,7,4] => [1,6,7,4,2,3,5] => ? = 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [6,7,4,1,2,3,5] => [1,6,3,4,2,7,5] => ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [6,7,5,1,2,3,4] => [1,6,3,5,2,7,4] => ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [6,5,4,1,2,7,3] => [1,6,7,3,4,2,5] => ? = 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [7,3,4,1,6,2,5] => [1,7,5,6,2,3,4] => ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [7,3,5,1,6,2,4] => [1,7,4,2,3,5,6] => ? = 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [7,5,4,1,6,2,3] => [1,7,3,4,2,5,6] => ? = 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [5,3,4,1,6,7,2] => [1,5,6,7,2,3,4] => ? = 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [2,3,7,6,1,4,5] => [1,2,3,7,5,4,6] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [2,3,6,5,1,7,4] => [1,2,3,6,7,4,5] => 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [2,7,4,6,1,3,5] => [1,2,7,5,3,4,6] => 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [2,7,6,5,1,3,4] => [1,2,7,4,5,3,6] => 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,6,4,5,1,7,3] => [1,2,6,7,3,4,5] => 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [7,3,4,6,1,2,5] => [1,7,5,2,3,4,6] => ? = 2
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [7,3,6,5,1,2,4] => [1,7,4,5,2,3,6] => ? = 2
[1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [7,6,4,5,1,2,3] => [1,7,3,4,5,2,6] => ? = 2
[1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [6,3,4,5,1,7,2] => [1,6,7,2,3,4,5] => ? = 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [2,3,4,7,6,1,5] => [1,2,3,4,7,5,6] => 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [2,3,7,5,6,1,4] => [1,2,3,7,4,5,6] => 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2,7,4,5,6,1,3] => [1,2,7,3,4,5,6] => 1
[1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [7,3,4,5,6,1,2] => [1,7,2,3,4,5,6] => ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => [1,2,3,4,5,6,7] => 0
[]
=> [1,0]
=> [2,1] => [1,2] => 0
Description
The number of recoils of a permutation.
A '''recoil''', or '''inverse descent''' of a permutation $\pi$ is a value $i$ such that $i+1$ appears to the left of $i$ in $\pi_1,\pi_2,\dots,\pi_n$.
In other words, this is the number of descents of the inverse permutation. It can be also be described as the number of occurrences of the mesh pattern $([2,1], {(0,1),(1,1),(2,1)})$, i.e., the middle row is shaded.
Matching statistic: St001469
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St001469: Permutations ⟶ ℤResult quality: 58% ●values known / values provided: 58%●distinct values known / distinct values provided: 75%
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St001469: Permutations ⟶ ℤResult quality: 58% ●values known / values provided: 58%●distinct values known / distinct values provided: 75%
Values
[1,0]
=> [1,1,0,0]
=> [2,3,1] => [1,2,3] => 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => [1,4,2,3] => 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => [1,2,3,4] => 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [1,5,3,2,4] => 2
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [1,4,5,2,3] => 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [1,2,5,3,4] => 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [1,5,2,3,4] => 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [1,5,3,2,6,4] => 2
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [1,5,6,3,2,4] => 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [1,6,4,5,2,3] => 2
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [1,6,3,2,4,5] => 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [1,4,5,6,2,3] => 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [1,2,6,4,3,5] => 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [1,2,5,6,3,4] => 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [1,6,4,2,3,5] => 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [1,6,3,4,2,5] => 2
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [1,5,6,2,3,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [1,2,3,6,4,5] => 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [1,2,6,3,4,5] => 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [1,6,2,3,4,5] => 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,2,3,4,5,6] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [7,6,1,2,3,4,5] => [1,7,5,3,2,6,4] => ? = 3
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [5,6,1,2,3,7,4] => [1,5,3,2,6,7,4] => ? = 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [7,4,1,2,6,3,5] => [1,7,5,6,3,2,4] => ? = 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [5,7,1,2,6,3,4] => [1,5,6,3,2,7,4] => ? = 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [5,4,1,2,6,7,3] => [1,5,6,7,3,2,4] => ? = 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [7,3,1,6,2,4,5] => [1,7,5,2,3,4,6] => ? = 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [6,3,1,5,2,7,4] => [1,6,7,4,5,2,3] => ? = 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [7,4,1,6,2,3,5] => [1,7,5,2,4,6,3] => ? = 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [6,7,1,5,2,3,4] => [1,6,3,2,7,4,5] => ? = 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [6,4,1,5,2,7,3] => [1,6,7,3,2,4,5] => ? = 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,3,1,7,6,2,5] => [1,4,7,5,6,2,3] => ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [7,3,1,5,6,2,4] => [1,7,4,5,6,2,3] => ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [7,4,1,5,6,2,3] => [1,7,3,2,4,5,6] => ? = 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [4,3,1,5,6,7,2] => [1,4,5,6,7,2,3] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [2,6,7,1,3,4,5] => [1,2,6,4,3,7,5] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [2,6,5,1,3,7,4] => [1,2,6,7,4,3,5] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [2,7,4,1,6,3,5] => [1,2,7,5,6,3,4] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [2,7,5,1,6,3,4] => [1,2,7,4,3,5,6] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,5,4,1,6,7,3] => [1,2,5,6,7,3,4] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [6,3,7,1,2,4,5] => [1,6,4,2,3,7,5] => ? = 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [6,3,5,1,2,7,4] => [1,6,7,4,2,3,5] => ? = 2
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [6,7,4,1,2,3,5] => [1,6,3,4,2,7,5] => ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [6,7,5,1,2,3,4] => [1,6,3,5,2,7,4] => ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [6,5,4,1,2,7,3] => [1,6,7,3,4,2,5] => ? = 2
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [7,3,4,1,6,2,5] => [1,7,5,6,2,3,4] => ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [7,3,5,1,6,2,4] => [1,7,4,2,3,5,6] => ? = 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [7,5,4,1,6,2,3] => [1,7,3,4,2,5,6] => ? = 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [5,3,4,1,6,7,2] => [1,5,6,7,2,3,4] => ? = 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [2,3,7,6,1,4,5] => [1,2,3,7,5,4,6] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [2,3,6,5,1,7,4] => [1,2,3,6,7,4,5] => 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [2,7,4,6,1,3,5] => [1,2,7,5,3,4,6] => 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [2,7,6,5,1,3,4] => [1,2,7,4,5,3,6] => 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [2,6,4,5,1,7,3] => [1,2,6,7,3,4,5] => 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [7,3,4,6,1,2,5] => [1,7,5,2,3,4,6] => ? = 2
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [7,3,6,5,1,2,4] => [1,7,4,5,2,3,6] => ? = 2
[1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [7,6,4,5,1,2,3] => [1,7,3,4,5,2,6] => ? = 2
[1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [6,3,4,5,1,7,2] => [1,6,7,2,3,4,5] => ? = 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [2,3,4,7,6,1,5] => [1,2,3,4,7,5,6] => 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [2,3,7,5,6,1,4] => [1,2,3,7,4,5,6] => 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [2,7,4,5,6,1,3] => [1,2,7,3,4,5,6] => 1
[1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [7,3,4,5,6,1,2] => [1,7,2,3,4,5,6] => ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [2,3,4,5,6,7,1] => [1,2,3,4,5,6,7] => 0
[]
=> [1,0]
=> [2,1] => [1,2] => 0
Description
The holeyness of a permutation.
For $S\subset [n]:=\{1,2,\dots,n\}$ let $\delta(S)$ be the number of elements $m\in S$ such that $m+1\notin S$.
For a permutation $\pi$ of $[n]$ the holeyness of $\pi$ is $$\max_{S\subset [n]} (\delta(\pi(S))-\delta(S)).$$
Matching statistic: St001896
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00238: Permutations —Clarke-Steingrimsson-Zeng⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001896: Signed permutations ⟶ ℤResult quality: 55% ●values known / values provided: 55%●distinct values known / distinct values provided: 75%
Mp00238: Permutations —Clarke-Steingrimsson-Zeng⟶ Permutations
Mp00170: Permutations —to signed permutation⟶ Signed permutations
St001896: Signed permutations ⟶ ℤResult quality: 55% ●values known / values provided: 55%●distinct values known / distinct values provided: 75%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [2,1] => [2,1] => 1
[1,1,0,0]
=> [1,2] => [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => [3,2,1] => 2
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,3,2] => 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => [3,1,2] => 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,2,3,1] => [4,2,3,1] => 2
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => [3,2,1,4] => 2
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => [4,2,1,3] => 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => [1,4,3,2] => 2
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,3,1,2] => [4,3,1,2] => 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => [4,1,3,2] => 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => [3,1,2,4] => 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => [1,4,2,3] => 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => [4,1,2,3] => 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [5,2,3,4,1] => ? = 3
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => [4,2,3,1,5] => ? = 2
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => ? = 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [5,2,3,1,4] => ? = 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => ? = 2
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [2,1,5,4,3] => ? = 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => ? = 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,2,4,1,3] => [5,2,4,1,3] => ? = 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,1,4,3] => [5,2,1,4,3] => ? = 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => [4,2,1,3,5] => ? = 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => [2,1,5,3,4] => ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => [5,2,1,3,4] => ? = 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => ? = 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => [1,5,3,4,2] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => [1,5,3,2,4] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,3,1,4,2] => [5,3,1,4,2] => ? = 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,3,1,2,5] => [4,3,1,2,5] => ? = 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,4,3,1,2] => [5,4,3,1,2] => ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,1,3,4,2] => [5,1,3,4,2] => ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,1,3,2,5] => [4,1,3,2,5] => ? = 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => [3,1,2,5,4] => ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,3,1,2,4] => [5,3,1,2,4] => ? = 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,1,3,2,4] => [5,1,3,2,4] => ? = 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => [3,1,2,4,5] => ? = 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => [1,2,5,4,3] => 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,5,4,2,3] => [1,5,4,2,3] => 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => [1,5,2,4,3] => [1,5,2,4,3] => 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => [1,4,2,3,5] => [1,4,2,3,5] => 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => [5,1,4,2,3] => [5,1,4,2,3] => ? = 2
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => [5,4,1,2,3] => [5,4,1,2,3] => ? = 2
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => [5,1,2,4,3] => [5,1,2,4,3] => ? = 2
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => [4,1,2,3,5] => [4,1,2,3,5] => ? = 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => [1,2,5,3,4] => [1,2,5,3,4] => 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => [1,5,2,3,4] => [1,5,2,3,4] => 1
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => [5,1,2,3,4] => [5,1,2,3,4] => ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[]
=> [] => [] => [] => ? = 0
Description
The number of right descents of a signed permutations.
An index is a right descent if it is a left descent of the inverse signed permutation.
Matching statistic: St001487
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00189: Skew partitions —rotate⟶ Skew partitions
St001487: Skew partitions ⟶ ℤResult quality: 50% ●values known / values provided: 51%●distinct values known / distinct values provided: 50%
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00189: Skew partitions —rotate⟶ Skew partitions
St001487: Skew partitions ⟶ ℤResult quality: 50% ●values known / values provided: 51%●distinct values known / distinct values provided: 50%
Values
[1,0]
=> []
=> [[],[]]
=> ?
=> ? = 0
[1,0,1,0]
=> [1]
=> [[1],[]]
=> [[1],[]]
=> 1
[1,1,0,0]
=> []
=> [[],[]]
=> ?
=> ? = 0
[1,0,1,0,1,0]
=> [2,1]
=> [[2,1],[]]
=> [[2,2],[1]]
=> 2
[1,0,1,1,0,0]
=> [1,1]
=> [[1,1],[]]
=> [[1,1],[]]
=> 1
[1,1,0,0,1,0]
=> [2]
=> [[2],[]]
=> [[2],[]]
=> 1
[1,1,0,1,0,0]
=> [1]
=> [[1],[]]
=> [[1],[]]
=> 1
[1,1,1,0,0,0]
=> []
=> [[],[]]
=> ?
=> ? = 0
[1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [[3,2,1],[]]
=> [[3,3,3],[2,1]]
=> ? = 2
[1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [[2,2,1],[]]
=> [[2,2,2],[1]]
=> 2
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [[3,1,1],[]]
=> [[3,3,3],[2,2]]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,1,1]
=> [[2,1,1],[]]
=> [[2,2,2],[1,1]]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [[1,1,1],[]]
=> [[1,1,1],[]]
=> 1
[1,1,0,0,1,0,1,0]
=> [3,2]
=> [[3,2],[]]
=> [[3,3],[1]]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [[2,2],[]]
=> [[2,2],[]]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1]
=> [[3,1],[]]
=> [[3,3],[2]]
=> 2
[1,1,0,1,0,1,0,0]
=> [2,1]
=> [[2,1],[]]
=> [[2,2],[1]]
=> 2
[1,1,0,1,1,0,0,0]
=> [1,1]
=> [[1,1],[]]
=> [[1,1],[]]
=> 1
[1,1,1,0,0,0,1,0]
=> [3]
=> [[3],[]]
=> [[3],[]]
=> 1
[1,1,1,0,0,1,0,0]
=> [2]
=> [[2],[]]
=> [[2],[]]
=> 1
[1,1,1,0,1,0,0,0]
=> [1]
=> [[1],[]]
=> [[1],[]]
=> 1
[1,1,1,1,0,0,0,0]
=> []
=> [[],[]]
=> ?
=> ? = 0
[1,0,1,0,1,0,1,0,1,0]
=> [4,3,2,1]
=> [[4,3,2,1],[]]
=> [[4,4,4,4],[3,2,1]]
=> ? = 3
[1,0,1,0,1,0,1,1,0,0]
=> [3,3,2,1]
=> [[3,3,2,1],[]]
=> [[3,3,3,3],[2,1]]
=> ? = 2
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[4,2,2,1],[]]
=> [[4,4,4,4],[3,2,2]]
=> ? = 3
[1,0,1,0,1,1,0,1,0,0]
=> [3,2,2,1]
=> [[3,2,2,1],[]]
=> [[3,3,3,3],[2,1,1]]
=> ? = 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,2,2,1]
=> [[2,2,2,1],[]]
=> [[2,2,2,2],[1]]
=> ? = 2
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [[4,3,1,1],[]]
=> [[4,4,4,4],[3,3,1]]
=> ? = 3
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[3,3,1,1],[]]
=> [[3,3,3,3],[2,2]]
=> ? = 2
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [[4,2,1,1],[]]
=> [[4,4,4,4],[3,3,2]]
=> ? = 3
[1,0,1,1,0,1,0,1,0,0]
=> [3,2,1,1]
=> [[3,2,1,1],[]]
=> [[3,3,3,3],[2,2,1]]
=> ? = 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[2,2,1,1],[]]
=> [[2,2,2,2],[1,1]]
=> ? = 2
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [[4,1,1,1],[]]
=> [[4,4,4,4],[3,3,3]]
=> ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,1,1]
=> [[3,1,1,1],[]]
=> [[3,3,3,3],[2,2,2]]
=> ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,1,1,1]
=> [[2,1,1,1],[]]
=> [[2,2,2,2],[1,1,1]]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1]
=> [[1,1,1,1],[]]
=> [[1,1,1,1],[]]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [4,3,2]
=> [[4,3,2],[]]
=> [[4,4,4],[2,1]]
=> ? = 2
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[3,3,2],[]]
=> [[3,3,3],[1]]
=> ? = 2
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[4,2,2],[]]
=> [[4,4,4],[2,2]]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[3,2,2],[]]
=> [[3,3,3],[1,1]]
=> ? = 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[2,2,2],[]]
=> [[2,2,2],[]]
=> ? = 1
[1,1,0,1,0,0,1,0,1,0]
=> [4,3,1]
=> [[4,3,1],[]]
=> [[4,4,4],[3,1]]
=> ? = 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[3,3,1],[]]
=> [[3,3,3],[2]]
=> ? = 2
[1,1,0,1,0,1,0,0,1,0]
=> [4,2,1]
=> [[4,2,1],[]]
=> [[4,4,4],[3,2]]
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,2,1]
=> [[3,2,1],[]]
=> [[3,3,3],[2,1]]
=> ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,2,1]
=> [[2,2,1],[]]
=> [[2,2,2],[1]]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [4,1,1]
=> [[4,1,1],[]]
=> [[4,4,4],[3,3]]
=> ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[3,1,1],[]]
=> [[3,3,3],[2,2]]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,1,1]
=> [[2,1,1],[]]
=> [[2,2,2],[1,1]]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1]
=> [[1,1,1],[]]
=> [[1,1,1],[]]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [4,3]
=> [[4,3],[]]
=> [[4,4],[1]]
=> ? = 2
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[3,3],[]]
=> [[3,3],[]]
=> ? = 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[4,2],[]]
=> [[4,4],[2]]
=> ? = 2
[1,1,1,0,0,1,0,1,0,0]
=> [3,2]
=> [[3,2],[]]
=> [[3,3],[1]]
=> 2
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[2,2],[]]
=> [[2,2],[]]
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1]
=> [[4,1],[]]
=> [[4,4],[3]]
=> 2
[1,1,1,0,1,0,0,1,0,0]
=> [3,1]
=> [[3,1],[]]
=> [[3,3],[2]]
=> 2
[1,1,1,0,1,0,1,0,0,0]
=> [2,1]
=> [[2,1],[]]
=> [[2,2],[1]]
=> 2
[1,1,1,0,1,1,0,0,0,0]
=> [1,1]
=> [[1,1],[]]
=> [[1,1],[]]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [4]
=> [[4],[]]
=> [[4],[]]
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> [3]
=> [[3],[]]
=> [[3],[]]
=> 1
[1,1,1,1,0,0,1,0,0,0]
=> [2]
=> [[2],[]]
=> [[2],[]]
=> 1
[1,1,1,1,0,1,0,0,0,0]
=> [1]
=> [[1],[]]
=> [[1],[]]
=> 1
[1,1,1,1,1,0,0,0,0,0]
=> []
=> [[],[]]
=> ?
=> ? = 0
[]
=> []
=> [[],[]]
=> ?
=> ? = 0
Description
The number of inner corners of a skew partition.
Matching statistic: St000260
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 75%
Mp00160: Permutations —graph of inversions⟶ Graphs
Mp00247: Graphs —de-duplicate⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 75%
Values
[1,0]
=> [1] => ([],1)
=> ([],1)
=> 0
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,2] => ([],2)
=> ([],1)
=> 0
[1,0,1,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 2
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> ([],1)
=> 0
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> ([(0,3),(1,2)],4)
=> ? = 2
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 2
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> ([],1)
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 3
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 2
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 3
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 3
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 3
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 2
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => ([(0,1),(2,4),(3,4)],5)
=> ([(0,3),(1,2)],4)
=> ? = 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> ([(1,4),(2,3)],5)
=> ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,0,0,0,1,0,1,0]
=> [4,1,5,2,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,1,2,5,3] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> ([(0,3),(1,2),(2,3)],4)
=> 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,2,5,3] => ([(1,4),(2,3),(3,4)],5)
=> ([(1,4),(2,3),(3,4)],5)
=> ? = 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,3,5] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,1,0,1,0,0,1,0,0]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,1,0,1,0,1,0,0,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 2
[1,1,1,0,1,1,0,0,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> ([(0,1)],2)
=> 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,1,0,1,0,0,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> ([(1,2)],3)
=> ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> ([],1)
=> 0
[]
=> [] => ([],0)
=> ([],0)
=> ? = 0
Description
The radius of a connected graph.
This is the minimum eccentricity of any vertex.
The following 331 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001330The hat guessing number of a graph. St000834The number of right outer peaks of a permutation. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000353The number of inner valleys of a permutation. St000779The tier of a permutation. St000092The number of outer peaks of a permutation. St000758The length of the longest staircase fitting into an integer composition. St000829The Ulam distance of a permutation to the identity permutation. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001946The number of descents in a parking function. St001581The achromatic number of a graph. St000035The number of left outer peaks of a permutation. St000662The staircase size of the code of a permutation. St000871The number of very big ascents of a permutation. St000884The number of isolated descents of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. 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$. St001877Number of indecomposable injective modules with projective dimension 2. St000028The number of stack-sorts needed to sort a permutation. St000352The Elizalde-Pak rank of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000996The number of exclusive left-to-right maxima of a permutation. St001060The distinguishing index of a graph. St000245The number of ascents of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St001083The number of boxed occurrences of 132 in a permutation. St001864The number of excedances of a signed permutation. St000153The number of adjacent cycles of a permutation. 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)$. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St000291The number of descents of a binary word. St000306The bounce count of a Dyck path. St000390The number of runs of ones in a binary word. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000366The number of double descents of a permutation. St001115The number of even descents of a permutation. St001394The genus of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000850The number of 1/2-balanced pairs in a poset. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001712The number of natural descents of a standard Young tableau. St000264The girth of a graph, which is not a tree. St000331The number of upper interactions of a Dyck path. St000386The number of factors DDU in a Dyck path. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000711The number of big exceedences of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001169Number of simple modules with projective dimension at least two 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. 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$. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001423The number of distinct cubes in a binary word. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001520The number of strict 3-descents. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001728The number of invisible descents of a permutation. St001823The Stasinski-Voll length of a signed permutation. St001862The number of crossings of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001935The number of ascents in a parking function. St001960The number of descents of a permutation minus one if its first entry is not one. St000015The number of peaks of a Dyck path. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000284The Plancherel distribution on integer partitions. St000618The number of self-evacuating tableaux of given shape. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000702The number of weak deficiencies of a permutation. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000710The number of big deficiencies of a permutation. St000781The number of proper colouring schemes of a Ferrers diagram. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000934The 2-degree of an integer partition. St000942The number of critical left to right maxima of the parking functions. St000991The number of right-to-left minima of a permutation. St000993The multiplicity of the largest part of an integer partition. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001128The exponens consonantiae of a partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001280The number of parts of an integer partition that are at least two. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001530The depth of a Dyck path. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001568The smallest positive integer that does not appear twice in the partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001665The number of pure excedances of a permutation. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001780The order of promotion on the set of standard tableaux of given shape. St001863The number of weak excedances of a signed permutation. St001875The number of simple modules with projective dimension at most 1. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001967The coefficient of the monomial corresponding to the integer partition in a certain power series. St001968The coefficient of the monomial corresponding to the integer partition in a certain power series. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. 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. St000225Difference between largest and smallest parts in a partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000567The sum of the products of all pairs of parts. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001525The number of symmetric hooks on the diagonal of a partition. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001561The value of the elementary symmetric function evaluated at 1. St001586The number of odd parts smaller than the largest even part in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000023The number of inner peaks of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St001470The cyclic holeyness of a permutation. St001840The number of descents of a set partition. St000062The length of the longest increasing subsequence of the permutation. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000308The height of the tree associated to a permutation. St000502The number of successions of a set partitions. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St001061The number of indices that are both descents and recoils of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001737The number of descents of type 2 in a permutation. St000824The sum of the number of descents and the number of recoils of a permutation. St000004The major index of a permutation. St000021The number of descents of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000080The rank of the poset. St000083The number of left oriented leafs of a binary tree except the first one. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000174The flush statistic of a semistandard tableau. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000317The cycle descent number of a permutation. St000338The number of pixed points of a permutation. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000640The rank of the largest boolean interval in a poset. St000650The number of 3-rises of a permutation. St000653The last descent of a permutation. St000794The mak of a permutation. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000872The number of very big descents of a permutation. St000961The shifted major index of a permutation. St000989The number of final rises of a permutation. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001298The number of repeated entries in the Lehmer code of a permutation. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001388The number of non-attacking neighbors of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001726The number of visible inversions of a permutation. St001729The number of visible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001781The interlacing number of a set partition. St001810The number of fixed points of a permutation smaller than its largest moved point. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001839The number of excedances of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001874Lusztig's a-function for the symmetric group. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001928The number of non-overlapping descents in a permutation. St000053The number of valleys of the Dyck path. St000056The decomposition (or block) number of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000238The number of indices that are not small weak excedances. St000254The nesting number of a set partition. St000272The treewidth of a graph. St000307The number of rowmotion orbits of a poset. St000314The number of left-to-right-maxima of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000340The number of non-final maximal constant sub-paths of length greater than one. St000362The size of a minimal vertex cover of a graph. St000374The number of exclusive right-to-left minima of a permutation. St000387The matching number of a graph. St000470The number of runs in a permutation. St000536The pathwidth of a graph. St000619The number of cyclic descents of a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000831The number of indices that are either descents or recoils. St000864The number of circled entries of the shifted recording tableau of a permutation. St000925The number of topologically connected components of a set partition. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001114The number of odd descents of a permutation. St001125The number of simple modules that satisfy the 2-regular condition 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. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. 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$. 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001220The width of a permutation. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001274The number of indecomposable injective modules with projective dimension equal to two. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001393The induced matching number of a graph. St001405The number of bonds in a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. 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. St001512The minimum rank of a graph. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001732The number of peaks visible from the left. St001734The lettericity of a graph. St001741The largest integer such that all patterns of this size are contained in the permutation. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001812The biclique partition number of a graph. St001971The number of negative eigenvalues of the adjacency matrix of the graph. St000172The Grundy number of a graph. St000504The cardinality of the first block of a set partition. St000822The Hadwiger number of the graph. St000918The 2-limited packing number of a graph. St001029The size of the core of a graph. St001062The maximal size of a block of a set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001116The game chromatic number of a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001202Call 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. 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:
St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001261The Castelnuovo-Mumford regularity of a graph. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001471The magnitude of a Dyck path. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001670The connected partition number of a graph. St001902The number of potential covers of a poset. St001963The tree-depth of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St000741The Colin de Verdière graph invariant. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000882The number of connected components of short braid edges in the graph of braid moves 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!