searching the database
Your data matches 1 statistic 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: St001122
Mp00100: Dyck paths —touch composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St001122: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●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: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,1]
=> [1]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> [1,1]
=> 0
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> [1]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> [1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> [1,1]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> [1,1]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,3] => [3,1]
=> [1]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> [1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> [1,1]
=> 0
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> [2]
=> 0
[1,1,0,1,0,0,1,0]
=> [3,1] => [3,1]
=> [1]
=> 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> [1]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> [1,1,1,1]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => [3,1,1]
=> [1,1]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> [1,1]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> [2,1]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> [1,1]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => [4,1]
=> [1]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => [4,1]
=> [1]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> [1,1]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => [4,1]
=> [1]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => [4,1]
=> [1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> [1]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> [1,1,1]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> [2,1]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> [2,1]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => [3,2]
=> [2]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> [2]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> [1,1]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => [3,2]
=> [2]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => [4,1]
=> [1]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => [4,1]
=> [1]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1]
=> [1,1]
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [3,2] => [3,2]
=> [2]
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [4,1] => [4,1]
=> [1]
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [4,1] => [4,1]
=> [1]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [4,1] => [4,1]
=> [1]
=> 1
[1,0,1,0,1,0,1,0,1,0,1,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,1,0,0]
=> [1,1,1,1,2] => [2,1,1,1,1]
=> [1,1,1,1]
=> 0
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,2,1] => [2,1,1,1,1]
=> [1,1,1,1]
=> 0
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,3] => [3,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,3] => [3,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,2,1,1] => [2,1,1,1,1]
=> [1,1,1,1]
=> 0
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,2,2] => [2,2,1,1]
=> [2,1,1]
=> 0
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,3,1] => [3,1,1,1]
=> [1,1,1]
=> 0
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,4] => [4,1,1]
=> [1,1]
=> 0
Description
The multiplicity of the sign representation in the Kronecker square corresponding to a partition.
The Kronecker coefficient is the multiplicity gλμ,ν of the Specht module Sλ in Sμ⊗Sν:
Sμ⊗Sν=⨁λgλμ,νSλ
This statistic records the Kronecker coefficient g1nλ,λ, for λ⊢n. It equals 1 if and only if λ is self-conjugate.
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!