Processing math: 100%

Your data matches 196 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001850: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 1
[2,1] => 1
[1,2,3] => 1
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 0
[3,1,2] => 0
[3,2,1] => 3
[1,2,3,4] => 1
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 0
[1,4,2,3] => 0
[1,4,3,2] => 3
[2,1,3,4] => 1
[2,1,4,3] => 1
[2,3,1,4] => 0
[2,3,4,1] => 0
[2,4,1,3] => 0
[2,4,3,1] => 0
[3,1,2,4] => 0
[3,1,4,2] => 0
[3,2,1,4] => 3
[3,2,4,1] => 0
[3,4,1,2] => 1
[3,4,2,1] => 0
[4,1,2,3] => 0
[4,1,3,2] => 0
[4,2,1,3] => 0
[4,2,3,1] => 5
[4,3,1,2] => 0
[4,3,2,1] => 7
Description
The number of Hecke atoms of a permutation. For a permutation zSn, this is the cardinality of the set {wSn|w1w=z}, where denotes the Demazure product. Note that ww1w is a surjection onto the set of involutions.
Mp00170: Permutations to signed permutationSigned permutations
St001851: Signed permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1
[1,2] => [1,2] => 1
[2,1] => [2,1] => 1
[1,2,3] => [1,2,3] => 1
[1,3,2] => [1,3,2] => 1
[2,1,3] => [2,1,3] => 1
[2,3,1] => [2,3,1] => 0
[3,1,2] => [3,1,2] => 0
[3,2,1] => [3,2,1] => 3
[1,2,3,4] => [1,2,3,4] => 1
[1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,3,4,2] => 0
[1,4,2,3] => [1,4,2,3] => 0
[1,4,3,2] => [1,4,3,2] => 3
[2,1,3,4] => [2,1,3,4] => 1
[2,1,4,3] => [2,1,4,3] => 1
[2,3,1,4] => [2,3,1,4] => 0
[2,3,4,1] => [2,3,4,1] => 0
[2,4,1,3] => [2,4,1,3] => 0
[2,4,3,1] => [2,4,3,1] => 0
[3,1,2,4] => [3,1,2,4] => 0
[3,1,4,2] => [3,1,4,2] => 0
[3,2,1,4] => [3,2,1,4] => 3
[3,2,4,1] => [3,2,4,1] => 0
[3,4,1,2] => [3,4,1,2] => 1
[3,4,2,1] => [3,4,2,1] => 0
[4,1,2,3] => [4,1,2,3] => 0
[4,1,3,2] => [4,1,3,2] => 0
[4,2,1,3] => [4,2,1,3] => 0
[4,2,3,1] => [4,2,3,1] => 5
[4,3,1,2] => [4,3,1,2] => 0
[4,3,2,1] => [4,3,2,1] => 7
Description
The number of Hecke atoms of a signed permutation. For a signed permutation zHn, this is the cardinality of the set {wHn|w1w=z}, where denotes the Demazure product. Note that ww1w is a surjection onto the set of involutions.
Mp00160: Permutations graph of inversionsGraphs
Mp00275: Graphs to edge-partition of connected componentsInteger partitions
St000512: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => ([],1)
=> []
=> ? = 1
[1,2] => ([],2)
=> []
=> ? ∊ {1,1}
[2,1] => ([(0,1)],2)
=> [1]
=> ? ∊ {1,1}
[1,2,3] => ([],3)
=> []
=> ? ∊ {1,1,3}
[1,3,2] => ([(1,2)],3)
=> [1]
=> ? ∊ {1,1,3}
[2,1,3] => ([(1,2)],3)
=> [1]
=> ? ∊ {1,1,3}
[2,3,1] => ([(0,2),(1,2)],3)
=> [2]
=> 0
[3,1,2] => ([(0,2),(1,2)],3)
=> [2]
=> 0
[3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> [3]
=> 1
[1,2,3,4] => ([],4)
=> []
=> ? ∊ {3,3,5,7}
[1,2,4,3] => ([(2,3)],4)
=> [1]
=> ? ∊ {3,3,5,7}
[1,3,2,4] => ([(2,3)],4)
=> [1]
=> ? ∊ {3,3,5,7}
[1,3,4,2] => ([(1,3),(2,3)],4)
=> [2]
=> 0
[1,4,2,3] => ([(1,3),(2,3)],4)
=> [2]
=> 0
[1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 1
[2,1,3,4] => ([(2,3)],4)
=> [1]
=> ? ∊ {3,3,5,7}
[2,1,4,3] => ([(0,3),(1,2)],4)
=> [1,1]
=> 0
[2,3,1,4] => ([(1,3),(2,3)],4)
=> [2]
=> 0
[2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 1
[2,4,1,3] => ([(0,3),(1,2),(2,3)],4)
=> [3]
=> 1
[2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[3,1,2,4] => ([(1,3),(2,3)],4)
=> [2]
=> 0
[3,1,4,2] => ([(0,3),(1,2),(2,3)],4)
=> [3]
=> 1
[3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> [3]
=> 1
[3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> [4]
=> 0
[3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
[4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> [3]
=> 1
[4,1,3,2] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> [4]
=> 0
[4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
[4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [5]
=> 0
[4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> [6]
=> 0
Description
The number of invariant subsets of size 3 when acting with a permutation of given cycle type.
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St001122: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => [1,0]
=> []
=> ? = 1
[1,2] => [1,0,1,0]
=> [1]
=> 1
[2,1] => [1,1,0,0]
=> []
=> ? = 1
[1,2,3] => [1,0,1,0,1,0]
=> [2,1]
=> 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,1]
=> 0
[2,1,3] => [1,1,0,0,1,0]
=> [2]
=> 0
[2,3,1] => [1,1,0,1,0,0]
=> [1]
=> 1
[3,1,2] => [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[3,2,1] => [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 0
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 0
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [3,2]
=> 0
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> 1
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [3,1]
=> 0
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,1]
=> 1
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 0
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 0
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3]
=> 0
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [2]
=> 0
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [3]
=> 0
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [2]
=> 0
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
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.
Mp00170: Permutations to signed permutationSigned permutations
Mp00281: Signed permutations rowmotionSigned permutations
Mp00169: Signed permutations odd cycle typeInteger partitions
St001123: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => [1] => [-1] => [1]
=> ? = 1
[1,2] => [1,2] => [-2,1] => [2]
=> 1
[2,1] => [2,1] => [1,-2] => [1]
=> ? = 1
[1,2,3] => [1,2,3] => [-3,1,2] => [3]
=> 0
[1,3,2] => [1,3,2] => [-3,2,1] => [2]
=> 1
[2,1,3] => [2,1,3] => [1,-3,2] => [2]
=> 1
[2,3,1] => [2,3,1] => [2,1,-3] => [1]
=> ? ∊ {1,3}
[3,1,2] => [3,1,2] => [2,-3,1] => [3]
=> 0
[3,2,1] => [3,2,1] => [1,2,-3] => [1]
=> ? ∊ {1,3}
[1,2,3,4] => [1,2,3,4] => [-4,1,2,3] => [4]
=> 0
[1,2,4,3] => [1,2,4,3] => [-4,1,3,2] => [3]
=> 0
[1,3,2,4] => [1,3,2,4] => [-4,2,1,3] => [3]
=> 0
[1,3,4,2] => [1,3,4,2] => [-4,2,3,1] => [2]
=> 1
[1,4,2,3] => [1,4,2,3] => [-4,3,1,2] => [4]
=> 0
[1,4,3,2] => [1,4,3,2] => [-4,3,2,1] => [2]
=> 1
[2,1,3,4] => [2,1,3,4] => [1,-4,2,3] => [3]
=> 0
[2,1,4,3] => [2,1,4,3] => [1,-4,3,2] => [2]
=> 1
[2,3,1,4] => [2,3,1,4] => [2,1,-4,3] => [2]
=> 1
[2,3,4,1] => [2,3,4,1] => [3,1,2,-4] => [1]
=> ? ∊ {0,0,3,3,5,7}
[2,4,1,3] => [2,4,1,3] => [3,1,-4,2] => [4]
=> 0
[2,4,3,1] => [2,4,3,1] => [3,2,1,-4] => [1]
=> ? ∊ {0,0,3,3,5,7}
[3,1,2,4] => [3,1,2,4] => [2,-4,1,3] => [4]
=> 0
[3,1,4,2] => [3,1,4,2] => [2,-4,3,1] => [3]
=> 0
[3,2,1,4] => [3,2,1,4] => [1,2,-4,3] => [2]
=> 1
[3,2,4,1] => [3,2,4,1] => [1,3,2,-4] => [1]
=> ? ∊ {0,0,3,3,5,7}
[3,4,1,2] => [3,4,1,2] => [3,2,-4,1] => [3]
=> 0
[3,4,2,1] => [3,4,2,1] => [2,1,3,-4] => [1]
=> ? ∊ {0,0,3,3,5,7}
[4,1,2,3] => [4,1,2,3] => [3,-4,1,2] => [2]
=> 1
[4,1,3,2] => [4,1,3,2] => [3,-4,2,1] => [4]
=> 0
[4,2,1,3] => [4,2,1,3] => [1,3,-4,2] => [3]
=> 0
[4,2,3,1] => [4,2,3,1] => [2,3,1,-4] => [1]
=> ? ∊ {0,0,3,3,5,7}
[4,3,1,2] => [4,3,1,2] => [2,3,-4,1] => [4]
=> 0
[4,3,2,1] => [4,3,2,1] => [1,2,3,-4] => [1]
=> ? ∊ {0,0,3,3,5,7}
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λμ,ν of the Specht module Sλ in SμSν: SμSν=λgλμ,νSλ This statistic records the Kronecker coefficient g21n2λ,λ, for λn.
Matching statistic: St001217
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00027: Dyck paths to partitionInteger partitions
Mp00230: Integer partitions parallelogram polyominoDyck paths
St001217: Dyck paths ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => [1,0]
=> []
=> []
=> ? = 1
[1,2] => [1,0,1,0]
=> [1]
=> [1,0]
=> 1
[2,1] => [1,1,0,0]
=> []
=> []
=> ? = 1
[1,2,3] => [1,0,1,0,1,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 0
[1,3,2] => [1,0,1,1,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> [2]
=> [1,0,1,0]
=> 0
[2,3,1] => [1,1,0,1,0,0]
=> [1]
=> [1,0]
=> 1
[3,1,2] => [1,1,1,0,0,0]
=> []
=> []
=> ? ∊ {1,3}
[3,2,1] => [1,1,1,0,0,0]
=> []
=> []
=> ? ∊ {1,3}
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 0
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 0
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> 0
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> 0
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,1]
=> [1,0,1,1,0,0]
=> 0
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> [1,1,0,0]
=> 1
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3]
=> [1,0,1,0,1,0]
=> 0
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [2]
=> [1,0,1,0]
=> 0
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [3]
=> [1,0,1,0,1,0]
=> 0
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [2]
=> [1,0,1,0]
=> 0
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1]
=> [1,0]
=> 1
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1]
=> [1,0]
=> 1
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> []
=> []
=> ? ∊ {0,0,3,3,5,7}
Description
The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1.
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00123: Dyck paths Barnabei-Castronuovo involutionDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St001283: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => [1,0]
=> [1,0]
=> []
=> ? = 1
[1,2] => [1,0,1,0]
=> [1,0,1,0]
=> [1]
=> 1
[2,1] => [1,1,0,0]
=> [1,1,0,0]
=> []
=> ? = 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1]
=> 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2]
=> 0
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [2,1]
=> 0
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 0
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 0
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 0
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 0
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 0
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> 0
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 0
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 1
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> 0
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 0
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 0
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 1
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 1
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 0
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 0
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
Description
The number of finite solvable groups that are realised by the given partition over the complex numbers. A finite group G is ''realised'' by the partition (a1,,am) if its group algebra over the complex numbers is isomorphic to the direct product of ai×ai matrix rings over the complex numbers. The smallest partition which does not realise a solvable group, but does realise a finite group, is (5,4,3,3,1).
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00123: Dyck paths Barnabei-Castronuovo involutionDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St001284: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => [1,0]
=> [1,0]
=> []
=> ? = 1
[1,2] => [1,0,1,0]
=> [1,0,1,0]
=> [1]
=> 1
[2,1] => [1,1,0,0]
=> [1,1,0,0]
=> []
=> ? = 1
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [1]
=> 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2]
=> 0
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1]
=> 1
[2,3,1] => [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [2,1]
=> 0
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [3,2,1]
=> 0
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,2,1]
=> 0
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> [2]
=> 0
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 0
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3]
=> 0
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> [3,2]
=> 0
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2]
=> 0
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1]
=> 1
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,1]
=> 0
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 0
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1]
=> 0
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 1
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 1
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 1
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [2,1,1]
=> 1
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 0
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [3,1,1]
=> 0
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
Description
The number of finite groups that are realised by the given partition over the complex numbers. A finite group G is 'realised' by the partition (a1,...,am) if its group algebra over the complex numbers is isomorphic to the direct product of ai×ai matrix rings over the complex numbers.
Mp00068: Permutations Simion-Schmidt mapPermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00027: Dyck paths to partitionInteger partitions
St001593: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 70%distinct values known / distinct values provided: 40%
Values
[1] => [1] => [1,0]
=> []
=> ? = 1
[1,2] => [1,2] => [1,0,1,0]
=> [1]
=> 1
[2,1] => [2,1] => [1,1,0,0]
=> []
=> ? = 1
[1,2,3] => [1,3,2] => [1,0,1,1,0,0]
=> [1,1]
=> 0
[1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> [1,1]
=> 0
[2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> [2]
=> 1
[2,3,1] => [2,3,1] => [1,1,0,1,0,0]
=> [1]
=> 1
[3,1,2] => [3,1,2] => [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> []
=> ? ∊ {1,3}
[1,2,3,4] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[1,2,4,3] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[1,3,2,4] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[1,3,4,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[1,4,2,3] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1]
=> 0
[2,1,3,4] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> 0
[2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2]
=> 0
[2,3,1,4] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 0
[2,3,4,1] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 0
[2,4,1,3] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 0
[2,4,3,1] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1]
=> 0
[3,1,2,4] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[3,1,4,2] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [3]
=> 1
[3,2,4,1] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [2]
=> 1
[3,4,1,2] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[3,4,2,1] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1]
=> 1
[4,1,2,3] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,1,3,2] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,1,3] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,1,2] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
[4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> []
=> ? ∊ {0,0,3,3,5,7}
Description
This is the number of standard Young tableaux of the given shifted shape. For an integer partition λ=(λ1,,λk), the shifted diagram is obtained by moving the i-th row in the diagram i1 boxes to the right, i.e., λ={(i,j)|1ik,ijλi+i1}. In particular, this statistic is zero if and only if λi+1=λi for some i.
Mp00108: Permutations cycle typeInteger partitions
Mp00322: Integer partitions Loehr-WarringtonInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000478: Integer partitions ⟶ ℤResult quality: 40% values known / values provided: 67%distinct values known / distinct values provided: 40%
Values
[1] => [1]
=> [1]
=> []
=> ? = 1
[1,2] => [1,1]
=> [2]
=> []
=> ? ∊ {1,1}
[2,1] => [2]
=> [1,1]
=> [1]
=> ? ∊ {1,1}
[1,2,3] => [1,1,1]
=> [2,1]
=> [1]
=> ? ∊ {1,1,1,3}
[1,3,2] => [2,1]
=> [3]
=> []
=> ? ∊ {1,1,1,3}
[2,1,3] => [2,1]
=> [3]
=> []
=> ? ∊ {1,1,1,3}
[2,3,1] => [3]
=> [1,1,1]
=> [1,1]
=> 0
[3,1,2] => [3]
=> [1,1,1]
=> [1,1]
=> 0
[3,2,1] => [2,1]
=> [3]
=> []
=> ? ∊ {1,1,1,3}
[1,2,3,4] => [1,1,1,1]
=> [3,1]
=> [1]
=> ? ∊ {3,3,5,7}
[1,2,4,3] => [2,1,1]
=> [2,2]
=> [2]
=> 1
[1,3,2,4] => [2,1,1]
=> [2,2]
=> [2]
=> 1
[1,3,4,2] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[1,4,2,3] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[1,4,3,2] => [2,1,1]
=> [2,2]
=> [2]
=> 1
[2,1,3,4] => [2,1,1]
=> [2,2]
=> [2]
=> 1
[2,1,4,3] => [2,2]
=> [4]
=> []
=> ? ∊ {3,3,5,7}
[2,3,1,4] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[2,3,4,1] => [4]
=> [1,1,1,1]
=> [1,1,1]
=> 0
[2,4,1,3] => [4]
=> [1,1,1,1]
=> [1,1,1]
=> 0
[2,4,3,1] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[3,1,2,4] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[3,1,4,2] => [4]
=> [1,1,1,1]
=> [1,1,1]
=> 0
[3,2,1,4] => [2,1,1]
=> [2,2]
=> [2]
=> 1
[3,2,4,1] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[3,4,1,2] => [2,2]
=> [4]
=> []
=> ? ∊ {3,3,5,7}
[3,4,2,1] => [4]
=> [1,1,1,1]
=> [1,1,1]
=> 0
[4,1,2,3] => [4]
=> [1,1,1,1]
=> [1,1,1]
=> 0
[4,1,3,2] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[4,2,1,3] => [3,1]
=> [2,1,1]
=> [1,1]
=> 0
[4,2,3,1] => [2,1,1]
=> [2,2]
=> [2]
=> 1
[4,3,1,2] => [4]
=> [1,1,1,1]
=> [1,1,1]
=> 0
[4,3,2,1] => [2,2]
=> [4]
=> []
=> ? ∊ {3,3,5,7}
Description
Another weight of a partition according to Alladi. According to Theorem 3.4 (Alladi 2012) in [1] πGG1(r)w1(π) equals the number of partitions of r whose odd parts are all distinct. GG1(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.
The following 186 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000929The constant term of the character polynomial of an integer partition. St000934The 2-degree of an integer partition. St000941The number of characters of the symmetric group whose value on the partition is even. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000379The number of Hamiltonian cycles in a graph. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000699The toughness times the least common multiple of 1,. St001176The size of a partition minus its first part. St001280The number of parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001541The Gini index of an integer partition. St001587Half of the largest even part of an integer partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000455The second largest eigenvalue of a graph if it is integral. St001570The minimal number of edges to add to make a graph Hamiltonian. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000661The number of rises of length 3 of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. St000947The major index east count of a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001141The number of occurrences of hills of size 3 in a Dyck path. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn1] such that n=c0<ci for all i>0 a special CNakayama algebra. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001525The number of symmetric hooks on the diagonal of a partition. 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. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000137The Grundy value of an integer partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. 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. St000944The 3-degree of an integer partition. St001175The size of a partition minus the hook length of the base cell. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001632The number of indecomposable injective modules I with dimExt1(I,A)=1 for the incidence algebra A of a poset. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000145The Dyson rank of a partition. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001195The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000693The modular (standard) major index of a standard tableau. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001875The number of simple modules with projective dimension at most 1. St000456The monochromatic index of a connected graph. St001651The Frankl number of a lattice. St000422The energy of a graph, if it is integral. St001383The BG-rank of an integer partition. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. 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. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001564The value of the forgotten symmetric functions when all variables set to 1. 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. St001943The sum of the squares of the hook lengths of an integer partition. St000181The number of connected components of the Hasse diagram for the poset. St000284The Plancherel distribution on integer partitions. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001128The exponens consonantiae of a partition. St001490The number of connected components of a skew partition. St001890The maximum magnitude of the Möbius function of a poset. St001624The breadth of a lattice. St001118The acyclic chromatic index of a graph. St001199The dominant dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St000782The indicator function of whether a given perfect matching is an L & P matching. St001964The interval resolution global dimension of a poset. St000509The diagonal index (content) of a partition. St000668The least common multiple of the parts of the partition. St000706The product of the factorials of the multiplicities of an integer partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000815The number of semistandard Young tableaux of partition weight of given shape. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001568The smallest positive integer that does not appear twice in the partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000102The charge of a semistandard tableau. St000096The number of spanning trees of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000287The number of connected components of a graph. St000309The number of vertices with even degree. St000310The minimal degree of a vertex of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000736The last entry in the first row of a semistandard tableau. St000739The first entry in the last row of a semistandard tableau. St001208The number of connected components of the quiver of A/T when T is the 1-tilting module corresponding to the permutation in the Auslander algebra A of K[x]/(xn). St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001518The number of graphs with the same ordinary spectrum as the given graph. St001569The maximal modular displacement of a permutation. St001613The binary logarithm of the size of the center of a lattice. St001621The number of atoms of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001828The Euler characteristic of a graph. St001881The number of factors of a lattice as a Cartesian product of lattices. St000095The number of triangles of a graph. St000101The cocharge of a semistandard tableau. St000112The sum of the entries reduced by the index of their row in a semistandard tableau. St000274The number of perfect matchings of a graph. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by 4. St000315The number of isolated vertices of a graph. St000822The Hadwiger number of the graph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001060The distinguishing index of a graph. St001556The number of inversions of the third entry of a permutation. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001625The Möbius invariant of a lattice. St001631The number of simple modules S with dimExt1(S,A)=1 in the incidence algebra A of the poset. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001734The lettericity of a graph. St001783The number of odd automorphisms of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001856The number of edges in the reduced word graph of a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001871The number of triconnected components of a graph. St001948The number of augmented double ascents of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001738The minimal order of a graph which is not an induced subgraph of the given graph.