searching the database
Your data matches 2 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: St001571
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
St001571: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1
[2]
=> 2
[1,1]
=> 1
[3]
=> 3
[2,1]
=> 1
[1,1,1]
=> 1
[4]
=> 4
[3,1]
=> 2
[2,2]
=> 2
[2,1,1]
=> 1
[1,1,1,1]
=> 1
[5]
=> 5
[4,1]
=> 3
[3,2]
=> 2
[3,1,1]
=> 2
[2,2,1]
=> 1
[2,1,1,1]
=> 1
[1,1,1,1,1]
=> 1
[6]
=> 6
[5,1]
=> 4
[4,2]
=> 4
[4,1,1]
=> 3
[3,3]
=> 3
[3,2,1]
=> 1
[3,1,1,1]
=> 2
[2,2,2]
=> 2
[2,2,1,1]
=> 1
[2,1,1,1,1]
=> 1
[1,1,1,1,1,1]
=> 1
[7]
=> 7
[6,1]
=> 5
[5,2]
=> 6
[5,1,1]
=> 4
[4,3]
=> 3
[4,2,1]
=> 2
[4,1,1,1]
=> 3
[3,3,1]
=> 2
[3,2,2]
=> 2
[3,2,1,1]
=> 1
[3,1,1,1,1]
=> 2
[2,2,2,1]
=> 1
[2,2,1,1,1]
=> 1
[2,1,1,1,1,1]
=> 1
[1,1,1,1,1,1,1]
=> 1
[8]
=> 8
[7,1]
=> 6
[6,2]
=> 8
[6,1,1]
=> 5
[5,3]
=> 6
[5,2,1]
=> 3
Description
The Cartan determinant of the integer partition.
Let $p=[p_1,...,p_r]$ be a given integer partition with highest part t. Let $A=K[x]/(x^t)$ be the finite dimensional algebra over the field $K$ and $M$ the direct sum of the indecomposable $A$-modules of vector space dimension $p_i$ for each $i$. Then the Cartan determinant of $p$ is the Cartan determinant of the endomorphism algebra of $M$ over $A$.
Explicitly, this is the determinant of the matrix $\left(\min(\bar p_i, \bar p_j)\right)_{i,j}$, where $\bar p$ is the set of distinct parts of the partition.
Matching statistic: St001232
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 10% ●values known / values provided: 10%●distinct values known / distinct values provided: 43%
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 10% ●values known / values provided: 10%●distinct values known / distinct values provided: 43%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[2]
=> [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[1,1]
=> [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> ? = 1
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[4]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> ? = 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> ? = 1
[1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[5]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5
[4,1]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> ? = 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 1
[2,1,1,1]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> ? = 1
[1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[6]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 6
[5,1]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> ? = 4
[4,2]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> ? = 4
[4,1,1]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ? = 3
[3,3]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 1
[3,1,1,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> ? = 2
[2,2,2]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[2,2,1,1]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> ? = 1
[2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 1
[1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[7]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0]
=> ? = 7
[6,1]
=> [1,1,1,1,1,0,1,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 5
[5,2]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> ? = 6
[5,1,1]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> ? = 4
[4,3]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> ? = 3
[4,2,1]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ? = 2
[4,1,1,1]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 3
[3,3,1]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> ? = 2
[3,2,2]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> ? = 2
[3,2,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> ? = 1
[3,1,1,1,1]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> ? = 2
[2,2,2,1]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 1
[2,2,1,1,1]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> ? = 1
[2,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
[8]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0]
=> ? = 8
[7,1]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> ? = 6
[6,2]
=> [1,1,1,1,1,0,0,1,0,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,1,0,0,0,0,0]
=> ? = 8
[6,1,1]
=> [1,1,1,1,0,1,1,0,0,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> ? = 5
[5,3]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> ? = 6
[5,2,1]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> ? = 3
[5,1,1,1]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> ? = 4
[4,4]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4
[4,3,1]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ? = 2
[4,2,2]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 4
[4,2,1,1]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ? = 2
[4,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,0,1,1,0,0]
=> ? = 3
[3,3,2]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 2
[3,3,1,1]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 2
[3,2,2,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> ? = 1
[3,2,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> ? = 1
[3,1,1,1,1,1]
=> [1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,1,0,0,0,0]
=> ? = 2
[2,2,2,2]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[2,2,2,1,1]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> ? = 1
[2,2,1,1,1,1]
=> [1,0,1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
=> ? = 1
[2,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> ? = 1
[1,1,1,1,1,1,1,1]
=> [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> ? = 1
[3,3,3]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3
[5,5]
=> [1,1,1,1,1,0,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 5
[2,2,2,2,2]
=> [1,1,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
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!