searching the database
Your data matches 64 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: St000689
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
St000689: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 2
[1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> 0
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 3
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> 0
Description
The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid.
The correspondence between LNakayama algebras and Dyck paths is explained in [[St000684]]. A module $M$ is $n$-rigid, if $\operatorname{Ext}^i(M,M)=0$ for $1\leq i\leq n$.
This statistic gives the maximal $n$ such that the minimal generator-cogenerator module $A \oplus D(A)$ of the LNakayama algebra $A$ corresponding to a Dyck path is $n$-rigid.
An application is to check for maximal $n$-orthogonal objects in the module category in the sense of [2].
Matching statistic: St001198
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001198: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 64%●distinct values known / distinct values provided: 20%
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001198: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 64%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [1] => [1] => [1,0]
=> ? = 0 + 2
[1,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> ? = 1 + 2
[1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => [1,1,1,0,0,0]
=> ? = 2 + 2
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => [1,1,1,0,0,0]
=> ? = 1 + 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> ? = 3 + 2
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 4 + 2
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,3,2,1,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,4,2,1,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 2 + 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,1,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 0 + 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,4,3,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,4,1,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,1,4,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 2 + 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,1,3,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,1,3,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,5,4,2,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => [5,1,2,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => [5,1,4,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
Description
The 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$.
Matching statistic: St001206
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001206: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 64%●distinct values known / distinct values provided: 20%
Mp00236: Permutations —Clarke-Steingrimsson-Zeng inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001206: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 64%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [1] => [1] => [1,0]
=> ? = 0 + 2
[1,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> ? = 1 + 2
[1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => [1,1,1,0,0,0]
=> ? = 2 + 2
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => [1,1,1,0,0,0]
=> ? = 1 + 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> ? = 3 + 2
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 2
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 4 + 2
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,3,2,1,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,4,2,1,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 2 + 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,1,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 2 = 0 + 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,4,3,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,4,1,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,1,4,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 2 + 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,1,3,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,1,3,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,5,4,2,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => [5,1,2,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => [5,1,4,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 2 = 0 + 2
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 0 + 2
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 0 + 2
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 0 + 2
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 2
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
Description
The 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$.
Matching statistic: St001632
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001632: Posets ⟶ ℤResult quality: 20% ●values known / values provided: 58%●distinct values known / distinct values provided: 20%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001632: Posets ⟶ ℤResult quality: 20% ●values known / values provided: 58%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [2,1] => [2,1] => ([],2)
=> ? = 0
[1,0,1,0]
=> [3,1,2] => [3,1,2] => ([(1,2)],3)
=> ? = 1
[1,1,0,0]
=> [2,3,1] => [2,3,1] => ([(1,2)],3)
=> ? = 0
[1,0,1,0,1,0]
=> [4,1,2,3] => [4,1,3,2] => ([(1,2),(1,3)],4)
=> ? = 2
[1,0,1,1,0,0]
=> [3,1,4,2] => [3,1,4,2] => ([(0,3),(1,2),(1,3)],4)
=> 0
[1,1,0,0,1,0]
=> [2,4,1,3] => [2,4,1,3] => ([(0,3),(1,2),(1,3)],4)
=> 0
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,3,1,2] => ([(2,3)],4)
=> ? = 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [2,4,3,1] => ([(1,2),(1,3)],4)
=> ? = 0
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [5,1,4,3,2] => ([(1,2),(1,3),(1,4)],5)
=> ? = 3
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [3,1,5,4,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [5,1,4,3,2] => ([(1,2),(1,3),(1,4)],5)
=> ? = 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [3,1,5,4,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [2,5,1,4,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [2,5,1,4,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [5,3,1,4,2] => ([(1,4),(2,3),(2,4)],5)
=> ? = 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [5,4,1,3,2] => ([(2,3),(2,4)],5)
=> ? = 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [4,3,1,5,2] => ([(0,4),(1,4),(2,3),(2,4)],5)
=> 0
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [2,5,4,1,3] => ([(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [2,5,4,1,3] => ([(0,4),(1,2),(1,3),(1,4)],5)
=> 0
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> ? = 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [2,5,4,3,1] => ([(1,2),(1,3),(1,4)],5)
=> ? = 0
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [6,1,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5)],6)
=> ? = 4
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [5,1,6,4,3,2] => ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [4,1,6,5,3,2] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [6,1,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5)],6)
=> ? = 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [4,1,6,5,3,2] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [3,1,6,5,4,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,6,5,4,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [6,1,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5)],6)
=> ? = 2
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [6,1,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5)],6)
=> ? = 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [5,1,6,4,3,2] => ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [3,1,6,5,4,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [3,1,6,5,4,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [6,1,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5)],6)
=> ? = 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [3,1,6,5,4,2] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [2,6,1,5,4,3] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [2,6,1,5,4,3] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [2,6,1,5,4,3] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [2,6,1,5,4,3] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [2,6,1,5,4,3] => ([(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [6,3,1,5,4,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> ? = 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [5,3,1,6,4,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [6,4,1,5,3,2] => ([(1,5),(2,3),(2,4),(2,5)],6)
=> ? = 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [5,6,1,4,3,2] => ([(0,5),(1,2),(1,3),(1,4)],6)
=> ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [5,4,1,6,3,2] => ([(0,5),(1,5),(2,3),(2,4),(2,5)],6)
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [4,3,1,6,5,2] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [6,3,1,5,4,2] => ([(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> ? = 0
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [6,4,1,5,3,2] => ([(1,5),(2,3),(2,4),(2,5)],6)
=> ? = 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [4,3,1,6,5,2] => ([(0,4),(0,5),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [2,6,5,1,4,3] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [2,6,5,1,4,3] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [2,6,5,1,4,3] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [2,6,5,1,4,3] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [2,6,5,1,4,3] => ([(0,4),(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [6,3,5,1,4,2] => ([(1,4),(1,5),(2,3),(2,5)],6)
=> ? = 1
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [6,3,5,1,4,2] => ([(1,4),(1,5),(2,3),(2,5)],6)
=> ? = 1
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [6,5,4,1,3,2] => ([(3,4),(3,5)],6)
=> ? = 1
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [5,3,6,1,4,2] => ([(0,4),(1,4),(1,5),(2,3),(2,5)],6)
=> 0
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [2,6,5,4,1,3] => ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [2,6,5,4,1,3] => ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [2,6,5,4,1,3] => ([(0,5),(1,2),(1,3),(1,4),(1,5)],6)
=> 0
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [6,3,5,4,1,2] => ([(1,5),(2,3),(2,4)],6)
=> ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [2,6,5,4,3,1] => ([(1,2),(1,3),(1,4),(1,5)],6)
=> ? = 0
Description
The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset.
Matching statistic: St000772
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000772: Graphs ⟶ ℤResult quality: 20% ●values known / values provided: 58%●distinct values known / distinct values provided: 20%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000772: Graphs ⟶ ℤResult quality: 20% ●values known / values provided: 58%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [2,1] => [1,2] => ([],2)
=> ? = 0 + 1
[1,0,1,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> ? = 1 + 1
[1,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> ? = 0 + 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> ? = 2 + 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [2,1,3,4] => ([(2,3)],4)
=> ? = 1 + 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 3 + 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,5,2,1,4] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [4,2,5,1,3] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 + 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [2,5,4,1,3] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [4,2,1,3,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 + 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> ? = 1 + 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> ? = 1 + 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [5,4,3,2,1,6] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [4,6,3,2,1,5] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [5,3,6,2,1,4] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [4,3,5,2,1,6] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,6,5,2,1,4] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [5,4,2,6,1,3] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [4,6,2,5,1,3] => ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [5,3,2,4,1,6] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [4,3,2,5,1,6] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [3,6,2,4,1,5] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [5,2,6,4,1,3] => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [4,2,5,6,1,3] => ([(0,3),(0,5),(1,3),(1,5),(2,4),(2,5),(3,4),(4,5)],6)
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [3,2,5,4,1,6] => ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [2,6,5,4,1,3] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [5,4,3,1,6,2] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [4,6,3,1,5,2] => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [5,3,6,1,4,2] => ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [4,3,5,1,6,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [3,6,5,1,4,2] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [5,4,2,1,3,6] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [4,6,2,1,3,5] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 1 = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [5,3,2,1,4,6] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [4,3,2,1,6,5] => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [3,6,2,1,4,5] => ([(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [5,2,6,1,3,4] => ([(0,3),(0,5),(1,3),(1,5),(2,4),(2,5),(3,4),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [4,2,5,1,3,6] => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [3,2,5,1,4,6] => ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [2,6,5,1,3,4] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [5,4,1,6,3,2] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [4,6,1,5,3,2] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [5,3,1,4,6,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [4,3,1,5,6,2] => ([(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [3,6,1,4,5,2] => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [5,2,1,4,3,6] => ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [4,2,1,5,3,6] => ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [3,2,1,4,5,6] => ([(3,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [2,6,1,4,3,5] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [5,1,6,4,3,2] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [4,1,5,6,3,2] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [3,1,5,4,6,2] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [2,1,5,4,3,6] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,6,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0 + 1
Description
The multiplicity of the largest distance Laplacian eigenvalue in a connected graph.
The distance Laplacian of a graph is the (symmetric) matrix with row and column sums $0$, which has the negative distances between two vertices as its off-diagonal entries. This statistic is the largest multiplicity of an eigenvalue.
For example, the cycle on four vertices has distance Laplacian
$$
\left(\begin{array}{rrrr}
4 & -1 & -2 & -1 \\
-1 & 4 & -1 & -2 \\
-2 & -1 & 4 & -1 \\
-1 & -2 & -1 & 4
\end{array}\right).
$$
Its eigenvalues are $0,4,4,6$, so the statistic is $1$.
The path on four vertices has eigenvalues $0, 4.7\dots, 6, 9.2\dots$ and therefore also statistic $1$.
The graphs with statistic $n-1$, $n-2$ and $n-3$ have been characterised, see [1].
Matching statistic: St000260
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 20% ●values known / values provided: 58%●distinct values known / distinct values provided: 20%
Mp00064: Permutations —reverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 20% ●values known / values provided: 58%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [2,1] => [1,2] => ([],2)
=> ? = 0 + 2
[1,0,1,0]
=> [3,1,2] => [2,1,3] => ([(1,2)],3)
=> ? = 1 + 2
[1,1,0,0]
=> [2,3,1] => [1,3,2] => ([(1,2)],3)
=> ? = 0 + 2
[1,0,1,0,1,0]
=> [4,1,2,3] => [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> ? = 2 + 2
[1,0,1,1,0,0]
=> [3,1,4,2] => [2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,0,0,1,0]
=> [2,4,1,3] => [3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> 2 = 0 + 2
[1,1,0,1,0,0]
=> [4,3,1,2] => [2,1,3,4] => ([(2,3)],4)
=> ? = 1 + 2
[1,1,1,0,0,0]
=> [2,3,4,1] => [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> ? = 0 + 2
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 3 + 2
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [3,5,2,1,4] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 0 + 2
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [4,2,5,1,3] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 0 + 2
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 + 2
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [2,5,4,1,3] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 0 + 2
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [4,3,1,5,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 0 + 2
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 0 + 2
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [4,2,1,3,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 1 + 2
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [3,2,1,4,5] => ([(2,3),(2,4),(3,4)],5)
=> ? = 1 + 2
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [2,5,1,3,4] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 2 = 0 + 2
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [4,1,5,3,2] => ([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5)
=> 2 = 0 + 2
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [3,1,4,5,2] => ([(0,4),(1,4),(2,3),(3,4)],5)
=> 2 = 0 + 2
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> ? = 1 + 2
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> ? = 0 + 2
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [5,4,3,2,1,6] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 4 + 2
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [4,6,3,2,1,5] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [5,3,6,2,1,4] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [4,3,5,2,1,6] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [3,6,5,2,1,4] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [5,4,2,6,1,3] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [4,6,2,5,1,3] => ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [5,3,2,4,1,6] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 2 + 2
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [4,3,2,5,1,6] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [3,6,2,4,1,5] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [5,2,6,4,1,3] => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [4,2,5,6,1,3] => ([(0,3),(0,5),(1,3),(1,5),(2,4),(2,5),(3,4),(4,5)],6)
=> 2 = 0 + 2
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [3,2,5,4,1,6] => ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [2,6,5,4,1,3] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [5,4,3,1,6,2] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [4,6,3,1,5,2] => ([(0,4),(0,5),(1,2),(1,3),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [5,3,6,1,4,2] => ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [4,3,5,1,6,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 0 + 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [3,6,5,1,4,2] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [5,4,2,1,3,6] => ([(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [4,6,2,1,3,5] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 0 + 2
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [5,3,2,1,4,6] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [4,3,2,1,6,5] => ([(0,1),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 2 + 2
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [3,6,2,1,4,5] => ([(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [5,2,6,1,3,4] => ([(0,3),(0,5),(1,3),(1,5),(2,4),(2,5),(3,4),(4,5)],6)
=> 2 = 0 + 2
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [4,2,5,1,3,6] => ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ? = 0 + 2
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [3,2,5,1,4,6] => ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [2,6,5,1,3,4] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [5,4,1,6,3,2] => ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [4,6,1,5,3,2] => ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [5,3,1,4,6,2] => ([(0,5),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [4,3,1,5,6,2] => ([(0,5),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [3,6,1,4,5,2] => ([(0,1),(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [5,2,1,4,3,6] => ([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [4,2,1,5,3,6] => ([(1,4),(2,3),(2,5),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [3,2,1,4,5,6] => ([(3,4),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [2,6,1,4,3,5] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [5,1,6,4,3,2] => ([(0,5),(1,2),(1,3),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [4,1,5,6,3,2] => ([(0,3),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [3,1,5,4,6,2] => ([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6)
=> 2 = 0 + 2
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [2,1,5,4,3,6] => ([(1,2),(3,4),(3,5),(4,5)],6)
=> ? = 1 + 2
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [1,6,5,4,3,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0 + 2
Description
The radius of a connected graph.
This is the minimum eccentricity of any vertex.
Matching statistic: St001491
(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
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00114: Permutations —connectivity set⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 20% ●values known / values provided: 47%●distinct values known / distinct values provided: 20%
Mp00068: Permutations —Simion-Schmidt map⟶ Permutations
Mp00114: Permutations —connectivity set⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 20% ●values known / values provided: 47%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [1] => [1] => => ? = 0 + 1
[1,0,1,0]
=> [2,1] => [2,1] => 0 => ? = 1 + 1
[1,1,0,0]
=> [1,2] => [1,2] => 1 => 1 = 0 + 1
[1,0,1,0,1,0]
=> [2,3,1] => [2,3,1] => 00 => ? = 2 + 1
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => 01 => 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => 10 => 1 = 0 + 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => 00 => ? = 1 + 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,3,2] => 10 => 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [2,4,3,1] => 000 => ? = 3 + 1
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [2,4,1,3] => 000 => ? = 0 + 1
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => 010 => 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [2,4,1,3] => 000 => ? = 1 + 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,4,3] => 010 => 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [3,1,4,2] => 000 => ? = 1 + 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [3,4,1,2] => 000 => ? = 1 + 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,4,2] => 000 => ? = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,3,2] => 000 => ? = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,4,3,2] => 100 => 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [2,5,4,3,1] => 0000 => ? = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [2,5,4,1,3] => 0000 => ? = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [2,5,1,4,3] => 0000 => ? = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [2,5,4,1,3] => 0000 => ? = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [2,5,1,4,3] => 0000 => ? = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [2,5,1,4,3] => 0000 => ? = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [2,5,4,1,3] => 0000 => ? = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [2,5,1,4,3] => 0000 => ? = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [2,5,1,4,3] => 0000 => ? = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,5,4,3] => 0100 => 1 = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [3,1,5,4,2] => 0000 => ? = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [3,5,1,4,2] => 0000 => ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [3,5,4,1,2] => 0000 => ? = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [3,5,1,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [3,5,1,4,2] => 0000 => ? = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,5,4,2] => 0000 => ? = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1,2,5,3] => [4,1,5,3,2] => 0000 => ? = 1 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => [4,1,5,3,2] => 0000 => ? = 1 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => [4,5,1,3,2] => 0000 => ? = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => [4,1,5,3,2] => 0000 => ? = 0 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => [5,1,4,3,2] => 0000 => ? = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => [1,5,4,3,2] => 1000 => 1 = 0 + 1
Description
The number of indecomposable projective-injective modules in the algebra corresponding to a subset.
Let $A_n=K[x]/(x^n)$.
We associate to a nonempty subset S of an (n-1)-set the module $M_S$, which is the direct sum of $A_n$-modules with indecomposable non-projective direct summands of dimension $i$ when $i$ is in $S$ (note that such modules have vector space dimension at most n-1). Then the corresponding algebra associated to S is the stable endomorphism ring of $M_S$. We decode the subset as a binary word so that for example the subset $S=\{1,3 \} $ of $\{1,2,3 \}$ is decoded as 101.
Matching statistic: St001498
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001498: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 39%●distinct values known / distinct values provided: 20%
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001498: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 39%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> ? = 0
[1,0,1,0]
=> [3,1,2] => [3,2,1] => [1,1,1,0,0,0]
=> ? = 1
[1,1,0,0]
=> [2,3,1] => [3,2,1] => [1,1,1,0,0,0]
=> ? = 0
[1,0,1,0,1,0]
=> [4,1,2,3] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ? = 2
[1,0,1,1,0,0]
=> [3,1,4,2] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ? = 0
[1,1,0,0,1,0]
=> [2,4,1,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 0
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> ? = 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ? = 0
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 3
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [3,5,1,4,2] => [1,1,1,0,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => [1,1,1,0,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [4,5,3,1,2] => [1,1,1,1,0,1,0,0,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 4
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [5,2,3,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [6,2,3,5,4,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [6,2,5,4,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [6,2,5,4,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [6,2,4,3,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [5,2,3,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [5,2,6,4,1,3] => [1,1,1,1,1,0,0,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [6,2,5,4,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [3,6,1,4,5,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [3,6,1,4,5,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [3,5,1,6,2,4] => [1,1,1,0,1,1,0,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [3,6,1,5,4,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [3,6,1,4,5,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [5,3,2,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [6,3,2,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [4,6,5,1,3,2] => [1,1,1,1,0,1,1,0,0,0,0,0]
=> 0
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [4,6,5,1,3,2] => [1,1,1,1,0,1,1,0,0,0,0,0]
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [4,6,3,1,5,2] => [1,1,1,1,0,1,1,0,0,0,0,0]
=> 0
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [5,2,3,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 0
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [5,2,6,4,1,3] => [1,1,1,1,1,0,0,1,0,0,0,0]
=> 0
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [5,6,4,3,1,2] => [1,1,1,1,1,0,1,0,0,0,0,0]
=> 0
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0
Description
The normalised height of a Nakayama algebra with magnitude 1.
We use the bijection (see code) suggested by Christian Stump, to have a bijection between such Nakayama algebras with magnitude 1 and Dyck paths. The normalised height is the height of the (periodic) Dyck path given by the top of the Auslander-Reiten quiver. Thus when having a CNakayama algebra it is the Loewy length minus the number of simple modules and for the LNakayama algebras it is the usual height.
Matching statistic: St001199
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00201: Dyck paths —Ringel⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001199: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 39%●distinct values known / distinct values provided: 20%
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001199: Dyck paths ⟶ ℤResult quality: 20% ●values known / values provided: 39%●distinct values known / distinct values provided: 20%
Values
[1,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> ? = 0 + 1
[1,0,1,0]
=> [3,1,2] => [3,2,1] => [1,1,1,0,0,0]
=> ? = 1 + 1
[1,1,0,0]
=> [2,3,1] => [3,2,1] => [1,1,1,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,0]
=> [4,1,2,3] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ? = 2 + 1
[1,0,1,1,0,0]
=> [3,1,4,2] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ? = 0 + 1
[1,1,0,0,1,0]
=> [2,4,1,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [4,3,1,2] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> ? = 1 + 1
[1,1,1,0,0,0]
=> [2,3,4,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,0,1,0]
=> [5,1,2,3,4] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 3 + 1
[1,0,1,0,1,1,0,0]
=> [4,1,2,5,3] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,0,1,1,0,0,1,0]
=> [3,1,5,2,4] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 1
[1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,0,1,0,1,0]
=> [2,5,1,3,4] => [3,5,1,4,2] => [1,1,1,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [2,4,1,5,3] => [3,5,1,4,2] => [1,1,1,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [5,3,1,2,4] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 1
[1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 1
[1,1,0,1,1,0,0,0]
=> [4,3,1,5,2] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,1,1,0,0,0,1,0]
=> [2,3,5,1,4] => [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => [4,5,3,1,2] => [1,1,1,1,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 1 + 1
[1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [6,1,2,3,4,5] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [5,1,2,3,6,4] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,1,2,6,3,5] => [5,2,3,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => [6,2,3,5,4,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [3,1,6,2,4,5] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [6,1,4,2,3,5] => [6,2,5,4,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => [6,2,5,4,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [5,1,4,2,6,3] => [6,2,4,3,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [3,1,4,6,2,5] => [5,2,3,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => [5,2,6,4,1,3] => [1,1,1,1,1,0,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [6,1,4,5,2,3] => [6,2,5,4,3,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [3,1,4,5,6,2] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,6,1,3,4,5] => [3,6,1,4,5,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,5,1,3,6,4] => [3,6,1,4,5,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [3,5,1,6,2,4] => [1,1,1,0,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,6,1,5,3,4] => [3,6,1,5,4,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,4,1,5,6,3] => [3,6,1,4,5,2] => [1,1,1,0,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [6,3,1,2,4,5] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [5,3,1,2,6,4] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [6,4,1,2,3,5] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [5,4,1,2,6,3] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,3,1,6,2,5] => [5,3,2,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [6,3,1,5,2,4] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [6,4,1,5,2,3] => [6,5,3,4,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [4,3,1,5,6,2] => [6,3,2,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [2,3,6,1,4,5] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [2,3,5,1,6,4] => [4,2,6,1,5,3] => [1,1,1,1,0,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [2,6,4,1,3,5] => [4,6,5,1,3,2] => [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => [4,6,5,1,3,2] => [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,5,4,1,6,3] => [4,6,3,1,5,2] => [1,1,1,1,0,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [6,3,5,1,2,4] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [6,5,4,1,2,3] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [5,3,4,1,6,2] => [6,4,3,2,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [2,3,4,6,1,5] => [5,2,3,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => [5,2,6,4,1,3] => [1,1,1,1,1,0,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [2,6,4,5,1,3] => [5,6,4,3,1,2] => [1,1,1,1,1,0,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [6,3,4,5,1,2] => [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => [6,2,3,4,5,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 0 + 1
Description
The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$.
Matching statistic: St000741
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000741: Graphs ⟶ ℤResult quality: 34% ●values known / values provided: 34%●distinct values known / distinct values provided: 40%
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000741: Graphs ⟶ ℤResult quality: 34% ●values known / values provided: 34%●distinct values known / distinct values provided: 40%
Values
[1,0]
=> [1,1,0,0]
=> [1,2] => ([],2)
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> ? = 2 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => ([(1,3),(2,3)],4)
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ? = 3 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ? = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => ([(0,4),(1,3),(2,3),(2,4)],5)
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ? = 1 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => ([(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => ([(1,3),(1,4),(2,3),(2,4)],5)
=> ? = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => ([(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,1,5,2,3] => ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> ? = 1 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [4,5,1,2,3] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> ? = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [4,1,2,3,5] => ([(1,4),(2,4),(3,4)],5)
=> ? = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,2,5,3,4] => ([(2,4),(3,4)],5)
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,5,2,3,4] => ([(1,4),(2,4),(3,4)],5)
=> ? = 0 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5,1,2,3,4] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => ([],5)
=> 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]
=> [3,4,5,6,1,2] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 4 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [3,4,5,1,2,6] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [3,4,1,6,2,5] => ([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [3,4,6,1,2,5] => ([(0,5),(1,3),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [3,4,1,2,5,6] => ([(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [3,1,5,6,2,4] => ([(0,4),(1,2),(1,3),(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,1,5,2,4,6] => ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [3,5,1,6,2,4] => ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
=> ? = 2 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [3,5,6,1,2,4] => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [3,5,1,2,4,6] => ([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [3,1,2,6,4,5] => ([(0,5),(1,5),(2,4),(3,4)],6)
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [3,1,6,2,4,5] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ? = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [3,6,1,2,4,5] => ([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [3,1,2,4,5,6] => ([(3,5),(4,5)],6)
=> 1 = 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,4,5,6,2,3] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,4,5,2,3,6] => ([(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,4,2,6,3,5] => ([(1,5),(2,4),(3,4),(3,5)],6)
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,4,6,2,3,5] => ([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,4,2,3,5,6] => ([(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [4,1,5,6,2,3] => ([(0,5),(1,3),(1,4),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [4,1,5,2,3,6] => ([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [4,5,1,6,2,3] => ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [4,5,6,1,2,3] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5)],6)
=> ? = 2 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [4,5,1,2,3,6] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [4,1,2,6,3,5] => ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ? = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [4,1,6,2,3,5] => ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [4,6,1,2,3,5] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [4,1,2,3,5,6] => ([(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,2,5,6,3,4] => ([(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,2,5,3,4,6] => ([(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,5,2,6,3,4] => ([(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,5,6,2,3,4] => ([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,5,2,3,4,6] => ([(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [5,1,2,6,3,4] => ([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6)
=> ? = 1 + 1
[1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [5,1,6,2,3,4] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 + 1
[1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [5,6,1,2,3,4] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6)
=> ? = 1 + 1
[1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [5,1,2,3,4,6] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [1,2,3,6,4,5] => ([(3,5),(4,5)],6)
=> 1 = 0 + 1
[1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,2,6,3,4,5] => ([(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,6,2,3,4,5] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> ? = 0 + 1
[1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [6,1,2,3,4,5] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2 = 1 + 1
[1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => ([],6)
=> 1 = 0 + 1
Description
The Colin de Verdière graph invariant.
The following 54 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000264The girth of a graph, which is not a tree. St000455The second largest eigenvalue of a graph if it is integral. 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$. St000441The number of successions of a permutation. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001846The number of elements which do not have a complement in the lattice. St000534The number of 2-rises of a permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. 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. St000944The 3-degree of an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000618The number of self-evacuating tableaux of given shape. St000667The greatest common divisor of the parts of the partition. St000706The product of the factorials of the multiplicities of an integer partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001432The order dimension of the partition. St001571The Cartan determinant of the integer partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001330The hat guessing number of a graph. St000650The number of 3-rises of a permutation. St000663The number of right floats of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000654The first descent of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001904The length of the initial strictly increasing segment of a parking function. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St000307The number of rowmotion orbits of a poset.
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!