searching the database
Your data matches 46 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: St001524
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00135: Binary words —rotate front-to-back⟶ Binary words
Mp00158: Binary words —alternating inverse⟶ Binary words
Mp00136: Binary words —rotate back-to-front⟶ Binary words
St001524: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00158: Binary words —alternating inverse⟶ Binary words
Mp00136: Binary words —rotate back-to-front⟶ Binary words
St001524: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => 0 => 0 => 0 => 0
1 => 1 => 1 => 1 => 0
00 => 00 => 01 => 10 => 0
01 => 10 => 11 => 11 => 1
10 => 01 => 00 => 00 => 1
11 => 11 => 10 => 01 => 0
000 => 000 => 010 => 001 => 0
001 => 010 => 000 => 000 => 1
010 => 100 => 110 => 011 => 0
011 => 110 => 100 => 010 => 1
100 => 001 => 011 => 101 => 1
101 => 011 => 001 => 100 => 0
110 => 101 => 111 => 111 => 1
111 => 111 => 101 => 110 => 0
0000 => 0000 => 0101 => 1010 => 0
1111 => 1111 => 1010 => 0101 => 0
00000 => 00000 => 01010 => 00101 => 1
11111 => 11111 => 10101 => 11010 => 1
000000 => 000000 => 010101 => 101010 => 0
111111 => 111111 => 101010 => 010101 => 0
Description
The degree of symmetry of a binary word.
For a binary word $w$ of length $n$, this is the number of positions $i\leq n/2$ such that $w_i = w_{n+1-i}$.
Matching statistic: St001795
Values
0 => ([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 0
1 => ([(0,1)],2)
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 0
00 => ([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 1
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 1
11 => ([(0,2),(2,1)],3)
=> ([(0,2),(1,2)],3)
=> ([(0,2),(1,2)],3)
=> 0
000 => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 0
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6)
=> 1
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6)
=> 0
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6)
=> 1
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6)
=> 1
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,4),(2,5),(3,4),(3,5)],6)
=> ([(0,1),(0,5),(1,5),(2,3),(2,4),(3,4),(4,5)],6)
=> 0
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(0,3),(0,5),(1,2),(1,5),(2,4),(3,4),(4,5)],6)
=> ([(0,4),(0,5),(1,2),(1,3),(2,3),(2,5),(3,4),(4,5)],6)
=> 1
111 => ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> ([(0,3),(1,2),(2,3)],4)
=> 0
0000 => ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
1111 => ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> ([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5)
=> 0
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> ([(0,1),(0,3),(0,5),(1,2),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([(0,6),(1,5),(2,3),(2,4),(3,5),(4,6)],7)
=> ([(0,1),(0,3),(0,4),(0,6),(1,2),(1,4),(1,5),(2,3),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 0
Description
The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1).
Matching statistic: St001604
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St001604: Integer partitions ⟶ ℤResult quality: 70% ●values known / values provided: 70%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St001604: Integer partitions ⟶ ℤResult quality: 70% ●values known / values provided: 70%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1]
=> [1]
=> ? = 0
1 => [1] => [1]
=> [1]
=> ? = 0
00 => [2] => [2]
=> [1,1]
=> ? = 0
01 => [1,1] => [1,1]
=> [2]
=> ? = 1
10 => [1,1] => [1,1]
=> [2]
=> ? = 1
11 => [2] => [2]
=> [1,1]
=> ? = 0
000 => [3] => [3]
=> [1,1,1]
=> 0
001 => [2,1] => [2,1]
=> [3]
=> 1
010 => [1,1,1] => [1,1,1]
=> [2,1]
=> 0
011 => [1,2] => [2,1]
=> [3]
=> 1
100 => [1,2] => [2,1]
=> [3]
=> 1
101 => [1,1,1] => [1,1,1]
=> [2,1]
=> 0
110 => [2,1] => [2,1]
=> [3]
=> 1
111 => [3] => [3]
=> [1,1,1]
=> 0
0000 => [4] => [4]
=> [1,1,1,1]
=> 0
1111 => [4] => [4]
=> [1,1,1,1]
=> 0
00000 => [5] => [5]
=> [1,1,1,1,1]
=> 1
11111 => [5] => [5]
=> [1,1,1,1,1]
=> 1
000000 => [6] => [6]
=> [1,1,1,1,1,1]
=> 0
111111 => [6] => [6]
=> [1,1,1,1,1,1]
=> 0
Description
The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons.
Equivalently, this is the multiplicity of the irreducible representation corresponding to a partition in the cycle index of the dihedral group.
This statistic is only defined for partitions of size at least 3, to avoid ambiguity.
Matching statistic: St001738
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Values
0 => ([(0,1)],2)
=> ([],2)
=> 2 = 0 + 2
1 => ([(0,1)],2)
=> ([],2)
=> 2 = 0 + 2
00 => ([(0,2),(2,1)],3)
=> ([],3)
=> 2 = 0 + 2
01 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 3 = 1 + 2
10 => ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(2,3)],4)
=> 3 = 1 + 2
11 => ([(0,2),(2,1)],3)
=> ([],3)
=> 2 = 0 + 2
000 => ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 2 = 0 + 2
001 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> ? = 1 + 2
010 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 2
011 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> ? = 1 + 2
100 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> ? = 1 + 2
101 => ([(0,1),(0,2),(1,4),(1,5),(2,4),(2,5),(4,3),(5,3)],6)
=> ([(2,5),(3,4)],6)
=> ? = 0 + 2
110 => ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> ([(2,5),(3,4),(4,5)],6)
=> ? = 1 + 2
111 => ([(0,3),(2,1),(3,2)],4)
=> ([],4)
=> 2 = 0 + 2
0000 => ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 2 = 0 + 2
1111 => ([(0,4),(2,3),(3,1),(4,2)],5)
=> ([],5)
=> 2 = 0 + 2
00000 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ? = 1 + 2
11111 => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> ([],6)
=> ? = 1 + 2
000000 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ? = 0 + 2
111111 => ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> ([],7)
=> ? = 0 + 2
Description
The minimal order of a graph which is not an induced subgraph of the given graph.
For example, the graph with two isolated vertices is not an induced subgraph of the complete graph on three vertices.
By contrast, the minimal number of vertices of a graph which is not a subgraph of a graph is one plus the clique number [[St000097]].
Matching statistic: St000046
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000046: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000046: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1]
=> []
=> ? = 0
1 => [1] => [1]
=> []
=> ? = 0
00 => [2] => [2]
=> []
=> ? = 0
01 => [1,1] => [1,1]
=> [1]
=> 1
10 => [1,1] => [1,1]
=> [1]
=> 1
11 => [2] => [2]
=> []
=> ? = 0
000 => [3] => [3]
=> []
=> ? = 0
001 => [2,1] => [2,1]
=> [1]
=> 1
010 => [1,1,1] => [1,1,1]
=> [1,1]
=> 0
011 => [1,2] => [2,1]
=> [1]
=> 1
100 => [1,2] => [2,1]
=> [1]
=> 1
101 => [1,1,1] => [1,1,1]
=> [1,1]
=> 0
110 => [2,1] => [2,1]
=> [1]
=> 1
111 => [3] => [3]
=> []
=> ? = 0
0000 => [4] => [4]
=> []
=> ? = 0
1111 => [4] => [4]
=> []
=> ? = 0
00000 => [5] => [5]
=> []
=> ? = 1
11111 => [5] => [5]
=> []
=> ? = 1
000000 => [6] => [6]
=> []
=> ? = 0
111111 => [6] => [6]
=> []
=> ? = 0
Description
The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition.
Matching statistic: St000137
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000137: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000137: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1]
=> []
=> ? = 0
1 => [1] => [1]
=> []
=> ? = 0
00 => [2] => [2]
=> []
=> ? = 0
01 => [1,1] => [1,1]
=> [1]
=> 1
10 => [1,1] => [1,1]
=> [1]
=> 1
11 => [2] => [2]
=> []
=> ? = 0
000 => [3] => [3]
=> []
=> ? = 0
001 => [2,1] => [2,1]
=> [1]
=> 1
010 => [1,1,1] => [1,1,1]
=> [1,1]
=> 0
011 => [1,2] => [2,1]
=> [1]
=> 1
100 => [1,2] => [2,1]
=> [1]
=> 1
101 => [1,1,1] => [1,1,1]
=> [1,1]
=> 0
110 => [2,1] => [2,1]
=> [1]
=> 1
111 => [3] => [3]
=> []
=> ? = 0
0000 => [4] => [4]
=> []
=> ? = 0
1111 => [4] => [4]
=> []
=> ? = 0
00000 => [5] => [5]
=> []
=> ? = 1
11111 => [5] => [5]
=> []
=> ? = 1
000000 => [6] => [6]
=> []
=> ? = 0
111111 => [6] => [6]
=> []
=> ? = 0
Description
The Grundy value of an integer partition.
Consider the two-player game on an integer partition.
In each move, a player removes either a box, or a 2x2-configuration of boxes such that the resulting diagram is still a partition.
The first player that cannot move lose. This happens exactly when the empty partition is reached.
The grundy value of an integer partition is defined as the grundy value of this two-player game as defined in [1].
This game was described to me during Norcom 2013, by Urban Larsson, and it seems to be quite difficult to give a good description of the partitions with Grundy value 0.
Matching statistic: St000260
Mp00135: Binary words —rotate front-to-back⟶ Binary words
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000260: Graphs ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
0 => 0 => [1] => ([],1)
=> 0
1 => 1 => [1] => ([],1)
=> 0
00 => 00 => [2] => ([],2)
=> ? = 0
01 => 10 => [1,1] => ([(0,1)],2)
=> 1
10 => 01 => [1,1] => ([(0,1)],2)
=> 1
11 => 11 => [2] => ([],2)
=> ? = 0
000 => 000 => [3] => ([],3)
=> ? = 0
001 => 010 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
010 => 100 => [1,2] => ([(1,2)],3)
=> ? = 0
011 => 110 => [2,1] => ([(0,2),(1,2)],3)
=> 1
100 => 001 => [2,1] => ([(0,2),(1,2)],3)
=> 1
101 => 011 => [1,2] => ([(1,2)],3)
=> ? = 0
110 => 101 => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
111 => 111 => [3] => ([],3)
=> ? = 0
0000 => 0000 => [4] => ([],4)
=> ? = 0
1111 => 1111 => [4] => ([],4)
=> ? = 0
00000 => 00000 => [5] => ([],5)
=> ? = 1
11111 => 11111 => [5] => ([],5)
=> ? = 1
000000 => 000000 => [6] => ([],6)
=> ? = 0
111111 => 111111 => [6] => ([],6)
=> ? = 0
Description
The radius of a connected graph.
This is the minimum eccentricity of any vertex.
Matching statistic: St000618
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000618: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St000618: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1,0]
=> []
=> ? = 0
1 => [1] => [1,0]
=> []
=> ? = 0
00 => [2] => [1,1,0,0]
=> []
=> ? = 0
01 => [1,1] => [1,0,1,0]
=> [1]
=> 1
10 => [1,1] => [1,0,1,0]
=> [1]
=> 1
11 => [2] => [1,1,0,0]
=> []
=> ? = 0
000 => [3] => [1,1,1,0,0,0]
=> []
=> ? = 0
001 => [2,1] => [1,1,0,0,1,0]
=> [2]
=> 1
010 => [1,1,1] => [1,0,1,0,1,0]
=> [2,1]
=> 0
011 => [1,2] => [1,0,1,1,0,0]
=> [1,1]
=> 1
100 => [1,2] => [1,0,1,1,0,0]
=> [1,1]
=> 1
101 => [1,1,1] => [1,0,1,0,1,0]
=> [2,1]
=> 0
110 => [2,1] => [1,1,0,0,1,0]
=> [2]
=> 1
111 => [3] => [1,1,1,0,0,0]
=> []
=> ? = 0
0000 => [4] => [1,1,1,1,0,0,0,0]
=> []
=> ? = 0
1111 => [4] => [1,1,1,1,0,0,0,0]
=> []
=> ? = 0
00000 => [5] => [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 1
11111 => [5] => [1,1,1,1,1,0,0,0,0,0]
=> []
=> ? = 1
000000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 0
111111 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> []
=> ? = 0
Description
The number of self-evacuating tableaux of given shape.
This is the same as the number of standard domino tableaux of the given shape.
Matching statistic: St001122
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001122: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001122: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1]
=> []
=> ? = 0
1 => [1] => [1]
=> []
=> ? = 0
00 => [2] => [2]
=> []
=> ? = 0
01 => [1,1] => [1,1]
=> [1]
=> 1
10 => [1,1] => [1,1]
=> [1]
=> 1
11 => [2] => [2]
=> []
=> ? = 0
000 => [3] => [3]
=> []
=> ? = 0
001 => [2,1] => [2,1]
=> [1]
=> 1
010 => [1,1,1] => [1,1,1]
=> [1,1]
=> 0
011 => [1,2] => [2,1]
=> [1]
=> 1
100 => [1,2] => [2,1]
=> [1]
=> 1
101 => [1,1,1] => [1,1,1]
=> [1,1]
=> 0
110 => [2,1] => [2,1]
=> [1]
=> 1
111 => [3] => [3]
=> []
=> ? = 0
0000 => [4] => [4]
=> []
=> ? = 0
1111 => [4] => [4]
=> []
=> ? = 0
00000 => [5] => [5]
=> []
=> ? = 1
11111 => [5] => [5]
=> []
=> ? = 1
000000 => [6] => [6]
=> []
=> ? = 0
111111 => [6] => [6]
=> []
=> ? = 0
Description
The multiplicity of the sign 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}^{1^n}$, for $\lambda\vdash n$. It equals $1$ if and only if $\lambda$ is self-conjugate.
Matching statistic: St001123
Mp00097: Binary words —delta morphism⟶ Integer compositions
Mp00133: Integer compositions —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001123: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Mp00133: Integer compositions —delta morphism⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001123: Integer partitions ⟶ ℤResult quality: 40% ●values known / values provided: 40%●distinct values known / distinct values provided: 100%
Values
0 => [1] => [1] => [1]
=> ? = 0
1 => [1] => [1] => [1]
=> ? = 0
00 => [2] => [1] => [1]
=> ? = 0
01 => [1,1] => [2] => [2]
=> 1
10 => [1,1] => [2] => [2]
=> 1
11 => [2] => [1] => [1]
=> ? = 0
000 => [3] => [1] => [1]
=> ? = 0
001 => [2,1] => [1,1] => [1,1]
=> 1
010 => [1,1,1] => [3] => [3]
=> 0
011 => [1,2] => [1,1] => [1,1]
=> 1
100 => [1,2] => [1,1] => [1,1]
=> 1
101 => [1,1,1] => [3] => [3]
=> 0
110 => [2,1] => [1,1] => [1,1]
=> 1
111 => [3] => [1] => [1]
=> ? = 0
0000 => [4] => [1] => [1]
=> ? = 0
1111 => [4] => [1] => [1]
=> ? = 0
00000 => [5] => [1] => [1]
=> ? = 1
11111 => [5] => [1] => [1]
=> ? = 1
000000 => [6] => [1] => [1]
=> ? = 0
111111 => [6] => [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$.
The following 36 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001383The BG-rank of an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000145The Dyson rank of a partition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001118The acyclic chromatic index of a graph. St000474Dyson's crank of a partition. St001330The hat guessing number of a graph. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000741The Colin de Verdière graph invariant. St000454The largest eigenvalue of a graph if it is integral. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000455The second largest eigenvalue of a graph if it is integral. St000456The monochromatic index of a connected graph. St000762The sum of the positions of the weak records of an integer composition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000464The Schultz index of a connected graph. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. 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$. 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$. 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$. St001545The second Elser number of a connected graph. St000806The semiperimeter of the associated bargraph. St001060The distinguishing index of a graph.
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!