searching the database
Your data matches 10 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: St001123
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00313: Integer partitions —Glaisher-Franklin inverse⟶ Integer partitions
St001123: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00313: Integer partitions —Glaisher-Franklin inverse⟶ Integer partitions
St001123: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> [1,1,1]
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [3,1]
=> 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [5,1]
=> 0
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [3,1,1,1]
=> 1
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [5,3,1]
=> 0
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [5,3,1]
=> 0
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> [4,3,2,1]
=> [3,1,1,1,1,1,1,1]
=> 0
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> [5,3,3,1]
=> [6,5,1]
=> 0
Description
The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition.
The Kronecker coefficient is the multiplicity $g_{\mu,\nu}^\lambda$ of the Specht module $S^\lambda$ in $S^\mu\otimes S^\nu$:
$$ S^\mu\otimes S^\nu = \bigoplus_\lambda g_{\mu,\nu}^\lambda S^\lambda $$
This statistic records the Kronecker coefficient $g_{\lambda,\lambda}^{21^{n-2}}$, for $\lambda\vdash n$.
Matching statistic: St001949
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 2 = 1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 1 = 0 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> 2 = 1 + 1
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
=> ? = 0 + 1
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
=> ? = 0 + 1
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
=> ? = 0 + 1
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
=> ? = 0 + 1
Description
The rigidity index of a graph.
A base of a permutation group is a set $B$ such that the pointwise stabilizer of $B$ is trivial. For example, a base of the symmetric group on $n$ letters must contain all but one letter.
This statistic yields the minimal size of a base for the automorphism group of a graph.
Matching statistic: St001654
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 2 = 0 + 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 1 + 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 2 = 0 + 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 3 = 1 + 2
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
=> ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0 + 2
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
=> ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0 + 2
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
=> ([(0,3),(0,4),(0,7),(0,8),(0,9),(1,2),(1,4),(1,5),(1,6),(1,8),(1,9),(2,3),(2,5),(2,6),(2,8),(2,9),(3,4),(3,5),(3,7),(3,8),(4,6),(4,7),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,8),(7,9),(8,9)],10)
=> ? = 0 + 2
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
=> ([(0,1),(0,2),(0,3),(0,7),(0,9),(0,10),(0,11),(1,2),(1,3),(1,6),(1,8),(1,10),(1,11),(2,3),(2,5),(2,8),(2,9),(2,11),(3,4),(3,8),(3,9),(3,10),(4,5),(4,6),(4,7),(4,8),(4,9),(4,10),(4,11),(5,6),(5,7),(5,8),(5,9),(5,10),(5,11),(6,7),(6,8),(6,9),(6,10),(6,11),(7,8),(7,9),(7,10),(7,11),(8,9),(8,10),(8,11),(9,10),(9,11),(10,11)],12)
=> ? = 0 + 2
Description
The monophonic hull number of a graph.
The monophonic hull of a set of vertices $M$ of a graph $G$ is the set of vertices that lie on at least one induced path between vertices in $M$. The monophonic hull number is the size of the smallest set $M$ such that the monophonic hull of $M$ is all of $G$.
For example, the monophonic hull number of a graph $G$ with $n$ vertices is $n$ if and only if $G$ is a disjoint union of complete graphs.
Matching statistic: St000636
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> 3 = 0 + 3
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(0,3),(1,3),(2,3)],4)
=> ([(1,2),(1,3),(2,3)],4)
=> 4 = 1 + 3
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> ([(0,2),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(3,4),(3,5),(4,5)],6)
=> 3 = 0 + 3
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,4),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 4 = 1 + 3
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
=> ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0 + 3
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(0,8),(1,7),(2,6),(3,6),(3,8),(4,7),(4,8),(5,6),(5,7),(5,8)],9)
=> ([(0,2),(0,3),(0,7),(0,8),(1,4),(1,5),(1,6),(1,7),(1,8),(2,3),(2,5),(2,6),(2,8),(3,4),(3,6),(3,7),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0 + 3
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(0,8),(1,7),(2,5),(2,6),(3,7),(3,9),(4,8),(4,9),(5,7),(5,9),(6,8),(6,9)],10)
=> ([(0,3),(0,4),(0,7),(0,8),(0,9),(1,2),(1,4),(1,5),(1,6),(1,8),(1,9),(2,3),(2,5),(2,6),(2,8),(2,9),(3,4),(3,5),(3,7),(3,8),(4,6),(4,7),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,8),(7,9),(8,9)],10)
=> ? = 0 + 3
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(0,11),(1,10),(2,9),(3,8),(4,8),(4,9),(4,10),(5,8),(5,9),(5,11),(6,8),(6,10),(6,11),(7,9),(7,10),(7,11)],12)
=> ([(0,1),(0,2),(0,3),(0,7),(0,9),(0,10),(0,11),(1,2),(1,3),(1,6),(1,8),(1,10),(1,11),(2,3),(2,5),(2,8),(2,9),(2,11),(3,4),(3,8),(3,9),(3,10),(4,5),(4,6),(4,7),(4,8),(4,9),(4,10),(4,11),(5,6),(5,7),(5,8),(5,9),(5,10),(5,11),(6,7),(6,8),(6,9),(6,10),(6,11),(7,8),(7,9),(7,10),(7,11),(8,9),(8,10),(8,11),(9,10),(9,11),(10,11)],12)
=> ? = 0 + 3
Description
The hull number of a graph.
The convex hull of a set of vertices $S$ of a graph is the smallest set $h(S)$ such that for any pair $u,v\in h(S)$ all vertices on a shortest path from $u$ to $v$ are also in $h(S)$.
The hull number is the size of the smallest set $S$ such that $h(S)$ is the set of all vertices.
Matching statistic: St001364
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St001364: Integer partitions ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St001364: Integer partitions ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [3,2]
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [4,2]
=> 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [6,2]
=> 0
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [8,4,2]
=> ? = 1
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [6,6,6,2]
=> ? = 0
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [6,6,6,2]
=> ? = 0
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> [10,10,10,5,5,2]
=> ? = 0
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> [6,6,6,6,6,6,6,3,3,2]
=> ? = 0
Description
The number of permutations whose cube equals a fixed permutation of given cycle type.
For example, the permutation $\pi=412365$ has cycle type $(4,2)$ and $234165$ is the unique permutation whose cube is $\pi$.
Matching statistic: St000752
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000752: Integer partitions ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St000752: Integer partitions ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [3,2]
=> 1 = 0 + 1
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [4,2]
=> 2 = 1 + 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [6,2]
=> 1 = 0 + 1
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [8,4,2]
=> ? = 1 + 1
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [6,6,6,2]
=> ? = 0 + 1
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [6,6,6,2]
=> ? = 0 + 1
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> [10,10,10,5,5,2]
=> ? = 0 + 1
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> [6,6,6,6,6,6,6,3,3,2]
=> ? = 0 + 1
Description
The Grundy value for the game 'Couples are forever' on an integer partition.
Two players alternately choose a part of the partition greater than two, and split it into two parts. The player facing a partition with all parts at most two looses.
Matching statistic: St001638
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> ([(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> ([(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> ([(4,5)],6)
=> ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> ? = 0
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> ([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6)
=> ([(0,4),(0,5),(1,3),(1,5),(2,3),(2,4),(2,5),(3,5),(4,5)],6)
=> 1
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
=> ([(0,3),(0,6),(0,7),(0,8),(1,2),(1,4),(1,6),(1,7),(1,8),(2,4),(2,5),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> ([(2,7),(3,5),(3,8),(4,6),(4,8),(5,6),(5,7),(6,8),(7,8)],9)
=> ([(0,3),(0,6),(0,7),(0,8),(1,2),(1,4),(1,6),(1,7),(1,8),(2,4),(2,5),(2,7),(2,8),(3,5),(3,6),(3,7),(3,8),(4,5),(4,6),(4,7),(4,8),(5,6),(5,7),(5,8),(6,7),(6,8),(7,8)],9)
=> ? = 0
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> ([(1,2),(1,7),(1,9),(2,6),(2,8),(3,4),(3,6),(3,8),(3,9),(4,7),(4,8),(4,9),(5,6),(5,7),(5,8),(5,9),(6,7),(6,9),(7,8),(8,9)],10)
=> ([(0,3),(0,8),(0,9),(1,2),(1,7),(1,9),(2,5),(2,7),(2,9),(3,6),(3,8),(3,9),(4,5),(4,6),(4,7),(4,8),(4,9),(5,7),(5,8),(5,9),(6,7),(6,8),(6,9),(7,9),(8,9)],10)
=> ? = 0
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> ([(2,9),(2,10),(2,11),(3,4),(3,5),(3,8),(3,11),(4,5),(4,7),(4,10),(5,6),(5,9),(6,7),(6,8),(6,10),(6,11),(7,8),(7,9),(7,11),(8,9),(8,10),(9,10),(9,11),(10,11)],12)
=> ([(0,5),(0,7),(0,8),(0,10),(0,11),(1,4),(1,6),(1,8),(1,10),(1,11),(2,3),(2,6),(2,7),(2,10),(2,11),(3,6),(3,7),(3,9),(3,10),(3,11),(4,6),(4,8),(4,9),(4,10),(4,11),(5,7),(5,8),(5,9),(5,10),(5,11),(6,9),(6,10),(6,11),(7,9),(7,10),(7,11),(8,9),(8,10),(8,11),(9,10),(9,11),(10,11)],12)
=> ? = 0
Description
The book thickness of a graph.
The book thickness (or pagenumber, or stacknumber) of a graph is the minimal number of pages required for a book embedding of a graph.
Matching statistic: St001200
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001200: Dyck paths ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001200: Dyck paths ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> [1,0,1,1,0,0]
=> 2 = 0 + 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3 = 1 + 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 0 + 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 1 + 2
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 0 + 2
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 0 + 2
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> ? = 0 + 2
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> [5,3,3,1]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
Description
The 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$.
Matching statistic: St001514
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001514: Dyck paths ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001514: Dyck paths ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> [1,0,1,1,0,0]
=> 2 = 0 + 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3 = 1 + 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 0 + 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 1 + 2
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 0 + 2
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 0 + 2
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> ? = 0 + 2
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> [5,3,3,1]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
Description
The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule.
Matching statistic: St001515
Mp00148: Finite Cartan types —to root poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001515: Dyck paths ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001515: Dyck paths ⟶ ℤResult quality: 38% ●values known / values provided: 38%●distinct values known / distinct values provided: 100%
Values
['A',2]
=> ([(0,2),(1,2)],3)
=> [2,1]
=> [1,0,1,1,0,0]
=> 2 = 0 + 2
['B',2]
=> ([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 3 = 1 + 2
['G',2]
=> ([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> ? = 0 + 2
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 1 + 2
['B',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 0 + 2
['C',3]
=> ([(0,7),(1,8),(2,7),(2,8),(4,5),(5,3),(6,5),(7,6),(8,4),(8,6)],9)
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 0 + 2
['A',4]
=> ([(0,8),(1,7),(2,7),(2,9),(3,8),(3,9),(5,4),(6,4),(7,5),(8,6),(9,5),(9,6)],10)
=> [4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> ? = 0 + 2
['D',4]
=> ([(0,10),(1,9),(2,8),(3,8),(3,9),(3,10),(5,11),(6,11),(7,11),(8,5),(8,6),(9,5),(9,7),(10,6),(10,7),(11,4)],12)
=> [5,3,3,1]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 0 + 2
Description
The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule).
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!