Your data matches 50 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000854
St000854: Finite Cartan types ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',3]
=> 1 = 0 + 1
['B',3]
=> 2 = 1 + 1
['C',3]
=> 2 = 1 + 1
['A',4]
=> 1 = 0 + 1
['B',4]
=> 2 = 1 + 1
['C',4]
=> 2 = 1 + 1
['D',4]
=> 1 = 0 + 1
['A',5]
=> 1 = 0 + 1
Description
The number of orbits of reflections of a finite Cartan type. Let $W$ be the Weyl group of a Cartan type. The reflections in $W$ are closed under conjugation, and this statistic counts the number of conjugacy classes of $W$ that are reflections. It is well-known that there are either one or two such conjugacy classes.
Mp00148: Finite Cartan types to root posetPosets
Mp00198: Posets incomparability graphGraphs
St000312: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['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
['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)
=> 1
['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)
=> 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)
=> ([(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
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
=> 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> ([(2,10),(3,6),(3,10),(3,13),(4,9),(4,11),(4,14),(4,15),(5,12),(5,13),(5,14),(5,15),(6,12),(6,14),(6,15),(7,8),(7,9),(7,12),(7,14),(7,15),(8,11),(8,13),(8,14),(8,15),(9,11),(9,13),(9,15),(10,12),(10,14),(10,15),(11,12),(11,14),(11,15),(12,13),(13,14),(13,15)],16)
=> 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)
=> ([(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
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> ([(1,2),(1,10),(1,12),(1,14),(2,9),(2,11),(2,13),(3,7),(3,8),(3,11),(3,12),(3,13),(3,14),(4,9),(4,10),(4,11),(4,12),(4,13),(4,14),(5,6),(5,8),(5,9),(5,11),(5,12),(5,13),(5,14),(6,7),(6,10),(6,11),(6,12),(6,13),(6,14),(7,8),(7,9),(7,11),(7,13),(7,14),(8,10),(8,12),(8,13),(8,14),(9,10),(9,12),(9,14),(10,11),(10,13),(11,12),(11,14),(12,13),(13,14)],15)
=> 0
Description
The number of leaves in a graph. That is, the number of vertices of a graph that have degree 1.
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000478: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [2,1]
=> 0
['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]
=> [3,1]
=> 1
['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]
=> [3,1]
=> 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)
=> [4,3,2,1]
=> [3,2,1]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [5,3,1]
=> 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [5,3,1]
=> 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)
=> [5,3,3,1]
=> [3,3,1]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [4,3,2,1]
=> 0
Description
Another weight of a partition according to Alladi. According to Theorem 3.4 (Alladi 2012) in [1] $$ \sum_{\pi\in GG_1(r)} w_1(\pi) $$ equals the number of partitions of $r$ whose odd parts are all distinct. $GG_1(r)$ is the set of partitions of $r$ where consecutive entries differ by at least $2$, and consecutive even entries differ by at least $4$.
Matching statistic: St000660
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St000660: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 0
['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,1,1,0,1,0,0,1,0,0,1,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)
=> [5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,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)
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,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)
=> [5,3,3,1]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
Description
The number of rises of length at least 3 of a Dyck path. The number of Dyck paths without such rises are counted by the Motzkin numbers [1].
Matching statistic: St001484
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00321: Integer partitions 2-conjugateInteger partitions
St001484: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [3,3]
=> 0
['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]
=> [3,2,2,1,1]
=> 1
['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]
=> [3,2,2,1,1]
=> 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)
=> [4,3,2,1]
=> [5,5]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [4,3,3,2,2,1,1]
=> 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [4,3,3,2,2,1,1]
=> 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)
=> [5,3,3,1]
=> [3,3,2,2,1,1]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [5,5,5]
=> 0
Description
The number of singletons of an integer partition. A singleton in an integer partition is a part that appear precisely once.
Matching statistic: St000920
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St000920: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 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]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> 2 = 1 + 1
['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,1,1,0,1,0,0,1,0,0,1,0]
=> 2 = 1 + 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)
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> 2 = 1 + 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> 2 = 1 + 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)
=> [5,3,3,1]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
Description
The logarithmic height of a Dyck path. This is the floor of the binary logarithm of the usual height increased by one: $$ \lfloor\log_2(1+height(D))\rfloor $$
Matching statistic: St000661
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St000661: Dyck paths ⟶ ℤResult quality: 75% values known / values provided: 75%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 0
['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,1,1,0,1,0,0,1,0,0,1,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)
=> [5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,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)
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> ? = 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,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)
=> [5,3,3,1]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
Description
The number of rises of length 3 of a Dyck path.
Matching statistic: St000931
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St000931: Dyck paths ⟶ ℤResult quality: 75% values known / values provided: 75%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 0
['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,1,1,0,1,0,0,1,0,0,1,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)
=> [5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,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)
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> ? = 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,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)
=> [5,3,3,1]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
Description
The number of occurrences of the pattern UUU in a Dyck path. The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
Matching statistic: St000980
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St000980: Dyck paths ⟶ ℤResult quality: 75% values known / values provided: 75%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 0
['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,1,1,0,1,0,0,1,0,0,1,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)
=> [5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,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)
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> ? = 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,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)
=> [5,3,3,1]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
Description
The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. For example, the path $111011010000$ has three peaks in positions $03, 15, 26$. The boxes below $03$ are $01,02,\textbf{12}$, the boxes below $15$ are $\textbf{12},13,14,\textbf{23},\textbf{24},\textbf{34}$, and the boxes below $26$ are $\textbf{23},\textbf{24},25,\textbf{34},35,45$. We thus obtain the four boxes in positions $12,23,24,34$ that are below at least two peaks.
Matching statistic: St001231
Mp00148: Finite Cartan types to root posetPosets
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001231: Dyck paths ⟶ ℤResult quality: 75% values known / values provided: 75%distinct values known / distinct values provided: 100%
Values
['A',3]
=> ([(0,4),(1,3),(2,3),(2,4),(3,5),(4,5)],6)
=> [3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 0
['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,1,1,0,1,0,0,1,0,0,1,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)
=> [5,3,1]
=> [1,1,1,0,1,0,0,1,0,0,1,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)
=> [4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
['B',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,0]
=> ? = 1
['C',4]
=> ([(0,13),(1,12),(2,13),(2,15),(3,12),(3,15),(5,11),(6,7),(7,4),(8,9),(9,10),(10,7),(11,6),(11,10),(12,8),(13,5),(13,14),(14,9),(14,11),(15,8),(15,14)],16)
=> [7,5,3,1]
=> [1,1,1,1,0,1,0,0,1,0,0,1,0,0,1,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)
=> [5,3,3,1]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 0
['A',5]
=> ([(0,11),(1,10),(2,10),(2,13),(3,11),(3,14),(4,13),(4,14),(6,8),(7,9),(8,5),(9,5),(10,6),(11,7),(12,8),(12,9),(13,6),(13,12),(14,7),(14,12)],15)
=> [5,4,3,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
Description
The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. Actually the same statistics results for algebras with at most 7 simple modules when dropping the assumption that the module has projective dimension one. The author is not sure whether this holds in general.
The following 40 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001234The number of indecomposable three dimensional modules with projective dimension one. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000549The number of odd partial sums of an integer partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. 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. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St001055The Grundy value for the game of removing cells of a row in an integer partition. St000480The number of lower covers of a partition in dominance order. St000897The number of different multiplicities of parts of an integer partition. St000678The number of up steps after the last double rise of a Dyck path. St000997The even-odd crank of an integer partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St000143The largest repeated part of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001214The aft of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000783The side length of the largest staircase partition fitting into a partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001335The cardinality of a minimal cycle-isolating set of a graph. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000617The number of global maxima of a Dyck path. St000071The number of maximal chains in a poset. St000306The bounce count of a Dyck path. St000381The largest part of an integer composition. St000808The number of up steps of the associated bargraph. St001581The achromatic number of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square.