searching the database
Your data matches 4 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
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St001123: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St001123: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,1,1]
=> [1,1,1]
=> [1,1]
=> [1,1]
=> 1
[2,1,1,1]
=> [1,1,1]
=> [1,1]
=> [1,1]
=> 1
[1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[3,1,1,1]
=> [1,1,1]
=> [1,1]
=> [1,1]
=> 1
[2,2,2]
=> [2,2]
=> [2]
=> [2]
=> 1
[2,2,1,1]
=> [2,1,1]
=> [1,1]
=> [1,1]
=> 1
[2,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1,1]
=> 0
[4,1,1,1]
=> [1,1,1]
=> [1,1]
=> [1,1]
=> 1
[3,2,2]
=> [2,2]
=> [2]
=> [2]
=> 1
[3,2,1,1]
=> [2,1,1]
=> [1,1]
=> [1,1]
=> 1
[3,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[2,2,2,1]
=> [2,2,1]
=> [2,1]
=> [3]
=> 0
[2,2,1,1,1]
=> [2,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1,1]
=> 0
[1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1,1]
=> 0
[5,1,1,1]
=> [1,1,1]
=> [1,1]
=> [1,1]
=> 1
[4,2,2]
=> [2,2]
=> [2]
=> [2]
=> 1
[4,2,1,1]
=> [2,1,1]
=> [1,1]
=> [1,1]
=> 1
[4,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[3,3,2]
=> [3,2]
=> [2]
=> [2]
=> 1
[3,3,1,1]
=> [3,1,1]
=> [1,1]
=> [1,1]
=> 1
[3,2,2,1]
=> [2,2,1]
=> [2,1]
=> [3]
=> 0
[3,2,1,1,1]
=> [2,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[3,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1,1]
=> 0
[2,2,2,2]
=> [2,2,2]
=> [2,2]
=> [4]
=> 0
[2,2,2,1,1]
=> [2,2,1,1]
=> [2,1,1]
=> [3,1]
=> 1
[2,2,1,1,1,1]
=> [2,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1,1]
=> 0
[2,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1,1]
=> 0
[1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> 0
[6,1,1,1]
=> [1,1,1]
=> [1,1]
=> [1,1]
=> 1
[5,2,2]
=> [2,2]
=> [2]
=> [2]
=> 1
[5,2,1,1]
=> [2,1,1]
=> [1,1]
=> [1,1]
=> 1
[5,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[4,3,2]
=> [3,2]
=> [2]
=> [2]
=> 1
[4,3,1,1]
=> [3,1,1]
=> [1,1]
=> [1,1]
=> 1
[4,2,2,1]
=> [2,2,1]
=> [2,1]
=> [3]
=> 0
[4,2,1,1,1]
=> [2,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[4,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1,1]
=> 0
[3,3,3]
=> [3,3]
=> [3]
=> [2,1]
=> 1
[3,3,2,1]
=> [3,2,1]
=> [2,1]
=> [3]
=> 0
[3,3,1,1,1]
=> [3,1,1,1]
=> [1,1,1]
=> [1,1,1]
=> 0
[3,2,2,2]
=> [2,2,2]
=> [2,2]
=> [4]
=> 0
[3,2,2,1,1]
=> [2,2,1,1]
=> [2,1,1]
=> [3,1]
=> 1
[3,2,1,1,1,1]
=> [2,1,1,1,1]
=> [1,1,1,1]
=> [1,1,1,1]
=> 0
[3,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1,1]
=> 0
[2,2,2,2,1]
=> [2,2,2,1]
=> [2,2,1]
=> [5]
=> 0
[2,2,2,1,1,1]
=> [2,2,1,1,1]
=> [2,1,1,1]
=> [3,1,1]
=> 1
[2,2,1,1,1,1,1]
=> [2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,1,1,1]
=> 0
[2,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,1,1,1,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: St000782
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000782: Perfect matchings ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 25%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00146: Dyck paths —to tunnel matching⟶ Perfect matchings
St000782: Perfect matchings ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 25%
Values
[1,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[2,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> ? = 0
[3,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[2,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[2,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> ? = 1
[2,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> ? = 0
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> ? = 0
[4,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[3,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[3,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> ? = 1
[3,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> ? = 0
[2,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> ? = 0
[2,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> ? = 0
[2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> ? = 0
[1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,12),(2,3),(4,5),(6,7),(8,9),(10,11)]
=> ? = 0
[5,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[4,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[4,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> ? = 1
[4,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> ? = 0
[3,3,2]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> ? = 1
[3,3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> ? = 1
[3,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> ? = 0
[3,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> ? = 0
[3,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> ? = 0
[2,2,2,2]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> ? = 0
[2,2,2,1,1]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [(1,10),(2,5),(3,4),(6,7),(8,9)]
=> ? = 1
[2,2,1,1,1,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,5),(6,7),(8,9),(10,11)]
=> ? = 0
[2,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,12),(2,3),(4,5),(6,7),(8,9),(10,11)]
=> ? = 0
[1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,14),(2,3),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> ? = 0
[6,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[5,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[5,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> ? = 1
[5,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> ? = 0
[4,3,2]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> ? = 1
[4,3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> ? = 1
[4,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> ? = 0
[4,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> ? = 0
[4,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> ? = 0
[3,3,3]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [(1,8),(2,7),(3,4),(5,6)]
=> ? = 1
[3,3,2,1]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [(1,2),(3,10),(4,7),(5,6),(8,9)]
=> ? = 0
[3,3,1,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,4),(5,12),(6,7),(8,9),(10,11)]
=> ? = 0
[3,2,2,2]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [(1,8),(2,7),(3,6),(4,5)]
=> ? = 0
[3,2,2,1,1]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [(1,10),(2,5),(3,4),(6,7),(8,9)]
=> ? = 1
[3,2,1,1,1,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,12),(4,5),(6,7),(8,9),(10,11)]
=> ? = 0
[3,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,12),(2,3),(4,5),(6,7),(8,9),(10,11)]
=> ? = 0
[2,2,2,2,1]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [(1,10),(2,7),(3,6),(4,5),(8,9)]
=> ? = 0
[2,2,2,1,1,1]
=> [2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [(1,12),(2,5),(3,4),(6,7),(8,9),(10,11)]
=> ? = 1
[2,2,1,1,1,1,1]
=> [2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,2),(3,14),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> ? = 0
[2,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,14),(2,3),(4,5),(6,7),(8,9),(10,11),(12,13)]
=> ? = 0
[1,1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [(1,16),(2,3),(4,5),(6,7),(8,9),(10,11),(12,13),(14,15)]
=> ? = 0
[7,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[6,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[6,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [(1,2),(3,8),(4,5),(6,7)]
=> ? = 1
[6,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [(1,8),(2,3),(4,5),(6,7)]
=> ? = 0
[5,3,2]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [(1,2),(3,8),(4,7),(5,6)]
=> ? = 1
[5,3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,10),(6,7),(8,9)]
=> ? = 1
[5,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [(1,8),(2,5),(3,4),(6,7)]
=> ? = 0
[5,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [(1,2),(3,10),(4,5),(6,7),(8,9)]
=> ? = 0
[5,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [(1,10),(2,3),(4,5),(6,7),(8,9)]
=> ? = 0
[4,4,2]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [(1,2),(3,4),(5,10),(6,9),(7,8)]
=> ? = 1
[4,4,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [(1,2),(3,4),(5,6),(7,12),(8,9),(10,11)]
=> ? = 1
[8,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[7,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[9,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[8,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[10,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[9,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[11,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[10,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[12,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[11,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[13,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[12,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
[14,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [(1,6),(2,3),(4,5)]
=> 1
[13,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [(1,6),(2,5),(3,4)]
=> 1
Description
The indicator function of whether a given perfect matching is an L & P matching.
An L&P matching is built inductively as follows:
starting with either a single edge, or a hairpin $([1,3],[2,4])$, insert a noncrossing matching or inflate an edge by a ladder, that is, a number of nested edges.
The number of L&P matchings is (see [thm. 1, 2])
$$\frac{1}{2} \cdot 4^{n} + \frac{1}{n + 1}{2 \, n \choose n} - {2 \, n + 1 \choose n} + {2 \, n - 1 \choose n - 1}$$
Matching statistic: St001491
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 25%
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St001491: Binary words ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 25%
Values
[1,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[2,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[1,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 10000 => ? = 0
[3,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[2,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[2,2,1,1]
=> [2,1,1]
=> [3,1]
=> 10010 => ? = 1
[2,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 10000 => ? = 0
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [5]
=> 100000 => ? = 0
[4,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[3,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[3,2,1,1]
=> [2,1,1]
=> [3,1]
=> 10010 => ? = 1
[3,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 10000 => ? = 0
[2,2,2,1]
=> [2,2,1]
=> [3,2]
=> 10100 => ? = 0
[2,2,1,1,1]
=> [2,1,1,1]
=> [4,1]
=> 100010 => ? = 0
[2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [5]
=> 100000 => ? = 0
[1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [6]
=> 1000000 => ? = 0
[5,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[4,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[4,2,1,1]
=> [2,1,1]
=> [3,1]
=> 10010 => ? = 1
[4,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 10000 => ? = 0
[3,3,2]
=> [3,2]
=> [2,2,1]
=> 11010 => ? = 1
[3,3,1,1]
=> [3,1,1]
=> [3,1,1]
=> 100110 => ? = 1
[3,2,2,1]
=> [2,2,1]
=> [3,2]
=> 10100 => ? = 0
[3,2,1,1,1]
=> [2,1,1,1]
=> [4,1]
=> 100010 => ? = 0
[3,1,1,1,1,1]
=> [1,1,1,1,1]
=> [5]
=> 100000 => ? = 0
[2,2,2,2]
=> [2,2,2]
=> [3,3]
=> 11000 => ? = 0
[2,2,2,1,1]
=> [2,2,1,1]
=> [4,2]
=> 100100 => ? = 1
[2,2,1,1,1,1]
=> [2,1,1,1,1]
=> [5,1]
=> 1000010 => ? = 0
[2,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [6]
=> 1000000 => ? = 0
[1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [7]
=> 10000000 => ? = 0
[6,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[5,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[5,2,1,1]
=> [2,1,1]
=> [3,1]
=> 10010 => ? = 1
[5,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 10000 => ? = 0
[4,3,2]
=> [3,2]
=> [2,2,1]
=> 11010 => ? = 1
[4,3,1,1]
=> [3,1,1]
=> [3,1,1]
=> 100110 => ? = 1
[4,2,2,1]
=> [2,2,1]
=> [3,2]
=> 10100 => ? = 0
[4,2,1,1,1]
=> [2,1,1,1]
=> [4,1]
=> 100010 => ? = 0
[4,1,1,1,1,1]
=> [1,1,1,1,1]
=> [5]
=> 100000 => ? = 0
[3,3,3]
=> [3,3]
=> [2,2,2]
=> 11100 => ? = 1
[3,3,2,1]
=> [3,2,1]
=> [3,2,1]
=> 101010 => ? = 0
[3,3,1,1,1]
=> [3,1,1,1]
=> [4,1,1]
=> 1000110 => ? = 0
[3,2,2,2]
=> [2,2,2]
=> [3,3]
=> 11000 => ? = 0
[3,2,2,1,1]
=> [2,2,1,1]
=> [4,2]
=> 100100 => ? = 1
[3,2,1,1,1,1]
=> [2,1,1,1,1]
=> [5,1]
=> 1000010 => ? = 0
[3,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [6]
=> 1000000 => ? = 0
[2,2,2,2,1]
=> [2,2,2,1]
=> [4,3]
=> 101000 => ? = 0
[2,2,2,1,1,1]
=> [2,2,1,1,1]
=> [5,2]
=> 1000100 => ? = 1
[2,2,1,1,1,1,1]
=> [2,1,1,1,1,1]
=> [6,1]
=> 10000010 => ? = 0
[2,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [7]
=> 10000000 => ? = 0
[1,1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1,1]
=> [8]
=> 100000000 => ? = 0
[7,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[6,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[6,2,1,1]
=> [2,1,1]
=> [3,1]
=> 10010 => ? = 1
[6,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 10000 => ? = 0
[5,3,2]
=> [3,2]
=> [2,2,1]
=> 11010 => ? = 1
[5,3,1,1]
=> [3,1,1]
=> [3,1,1]
=> 100110 => ? = 1
[5,2,2,1]
=> [2,2,1]
=> [3,2]
=> 10100 => ? = 0
[5,2,1,1,1]
=> [2,1,1,1]
=> [4,1]
=> 100010 => ? = 0
[5,1,1,1,1,1]
=> [1,1,1,1,1]
=> [5]
=> 100000 => ? = 0
[4,4,2]
=> [4,2]
=> [2,2,1,1]
=> 110110 => ? = 1
[4,4,1,1]
=> [4,1,1]
=> [3,1,1,1]
=> 1001110 => ? = 1
[8,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[7,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[9,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[8,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[10,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[9,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[11,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[10,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[12,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[11,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[13,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[12,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 1
[14,1,1,1]
=> [1,1,1]
=> [3]
=> 1000 => 1
[13,2,2]
=> [2,2]
=> [2,2]
=> 1100 => 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: St001207
Mp00202: Integer partitions —first row removal⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001207: Permutations ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 25%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St001207: Permutations ⟶ ℤResult quality: 2% ●values known / values provided: 2%●distinct values known / distinct values provided: 25%
Values
[1,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[2,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[1,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => ? = 0 + 2
[3,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[2,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[2,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 1 + 2
[2,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => ? = 0 + 2
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => ? = 0 + 2
[4,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[3,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[3,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 1 + 2
[3,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => ? = 0 + 2
[2,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => ? = 0 + 2
[2,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => ? = 0 + 2
[2,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => ? = 0 + 2
[1,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [7,6,1,2,3,4,5] => ? = 0 + 2
[5,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[4,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[4,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 1 + 2
[4,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => ? = 0 + 2
[3,3,2]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 1 + 2
[3,3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => ? = 1 + 2
[3,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => ? = 0 + 2
[3,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => ? = 0 + 2
[3,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => ? = 0 + 2
[2,2,2,2]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ? = 0 + 2
[2,2,2,1,1]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => ? = 1 + 2
[2,2,1,1,1,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [6,1,7,2,3,4,5] => ? = 0 + 2
[2,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [7,6,1,2,3,4,5] => ? = 0 + 2
[1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [8,7,1,2,3,4,5,6] => ? = 0 + 2
[6,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[5,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[5,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 1 + 2
[5,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => ? = 0 + 2
[4,3,2]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 1 + 2
[4,3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => ? = 1 + 2
[4,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => ? = 0 + 2
[4,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => ? = 0 + 2
[4,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => ? = 0 + 2
[3,3,3]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [5,3,4,1,2] => ? = 1 + 2
[3,3,2,1]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [3,1,6,5,2,4] => ? = 0 + 2
[3,3,1,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [7,1,2,6,3,4,5] => ? = 0 + 2
[3,2,2,2]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ? = 0 + 2
[3,2,2,1,1]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [2,6,5,1,3,4] => ? = 1 + 2
[3,2,1,1,1,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [6,1,7,2,3,4,5] => ? = 0 + 2
[3,1,1,1,1,1,1]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [7,6,1,2,3,4,5] => ? = 0 + 2
[2,2,2,2,1]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [2,3,6,5,1,4] => ? = 0 + 2
[2,2,2,1,1,1]
=> [2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [2,6,7,1,3,4,5] => ? = 1 + 2
[2,2,1,1,1,1,1]
=> [2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [8,1,7,2,3,4,5,6] => ? = 0 + 2
[2,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [8,7,1,2,3,4,5,6] => ? = 0 + 2
[1,1,1,1,1,1,1,1,1]
=> [1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [8,9,1,2,3,4,5,6,7] => ? = 0 + 2
[7,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[6,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[6,2,1,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [5,1,4,2,3] => ? = 1 + 2
[6,1,1,1,1]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [5,4,1,2,3] => ? = 0 + 2
[5,3,2]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [3,1,4,5,2] => ? = 1 + 2
[5,3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [6,1,2,5,3,4] => ? = 1 + 2
[5,2,2,1]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [2,5,4,1,3] => ? = 0 + 2
[5,2,1,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [6,1,5,2,3,4] => ? = 0 + 2
[5,1,1,1,1,1]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5,6,1,2,3,4] => ? = 0 + 2
[4,4,2]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [4,1,2,5,6,3] => ? = 1 + 2
[4,4,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [7,1,2,3,6,4,5] => ? = 1 + 2
[8,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[7,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[9,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[8,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[10,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[9,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[11,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[10,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[12,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[11,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[13,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[12,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
[14,1,1,1]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [4,3,1,2] => 3 = 1 + 2
[13,2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [2,3,4,1] => 3 = 1 + 2
Description
The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.
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!