searching the database
Your data matches 381 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: St000047
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
St000047: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 1 = 0 + 1
[1,1] => 1 = 0 + 1
[2] => 1 = 0 + 1
[1,1,1] => 1 = 0 + 1
[1,2] => 1 = 0 + 1
[2,1] => 2 = 1 + 1
[3] => 1 = 0 + 1
[1,1,1,1] => 1 = 0 + 1
[1,1,2] => 1 = 0 + 1
[1,2,1] => 2 = 1 + 1
[1,3] => 1 = 0 + 1
[2,1,1] => 3 = 2 + 1
[2,2] => 3 = 2 + 1
[3,1] => 3 = 2 + 1
[4] => 1 = 0 + 1
Description
The number of standard immaculate tableaux of a given shape.
See Proposition 3.13 of [2] for a hook-length counting formula of these tableaux.
Matching statistic: St000218
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000218: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000218: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [1,2] => 0
[2] => [1,1,0,0]
=> [2,1] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,2] => [1,0,1,1,0,0]
=> [1,3,2] => 0
[2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 1
[3] => [1,1,1,0,0,0]
=> [3,1,2] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2
[4] => [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 0
Description
The number of occurrences of the pattern 213 in a permutation.
Matching statistic: St000220
(load all 12 compositions to match this statistic)
(load all 12 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000220: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000220: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [1,2] => 0
[2] => [1,1,0,0]
=> [2,1] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,2] => [1,0,1,1,0,0]
=> [1,3,2] => 1
[2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 0
[3] => [1,1,1,0,0,0]
=> [3,1,2] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 0
[4] => [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 0
Description
The number of occurrences of the pattern 132 in a permutation.
Matching statistic: St000225
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00040: Integer compositions —to partition⟶ Integer partitions
Mp00323: Integer partitions —Loehr-Warrington inverse⟶ Integer partitions
St000225: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00323: Integer partitions —Loehr-Warrington inverse⟶ Integer partitions
St000225: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1]
=> [1]
=> 0
[1,1] => [1,1]
=> [2]
=> 0
[2] => [2]
=> [1,1]
=> 0
[1,1,1] => [1,1,1]
=> [3]
=> 0
[1,2] => [2,1]
=> [1,1,1]
=> 0
[2,1] => [2,1]
=> [1,1,1]
=> 0
[3] => [3]
=> [2,1]
=> 1
[1,1,1,1] => [1,1,1,1]
=> [4]
=> 0
[1,1,2] => [2,1,1]
=> [3,1]
=> 2
[1,2,1] => [2,1,1]
=> [3,1]
=> 2
[1,3] => [3,1]
=> [1,1,1,1]
=> 0
[2,1,1] => [2,1,1]
=> [3,1]
=> 2
[2,2] => [2,2]
=> [2,1,1]
=> 1
[3,1] => [3,1]
=> [1,1,1,1]
=> 0
[4] => [4]
=> [2,2]
=> 0
Description
Difference between largest and smallest parts in a partition.
Matching statistic: St000355
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000355: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000355: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [1,2] => 0
[2] => [1,1,0,0]
=> [2,1] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,2] => [1,0,1,1,0,0]
=> [1,3,2] => 0
[2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 1
[3] => [1,1,1,0,0,0]
=> [3,2,1] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2
[4] => [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 0
Description
The number of occurrences of the pattern 21-3.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $21\!\!-\!\!3$.
Matching statistic: St000359
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000359: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [2,1] => 0
[2] => [1,1,0,0]
=> [1,2] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,2] => [1,0,1,1,0,0]
=> [2,3,1] => 1
[2,1] => [1,1,0,0,1,0]
=> [3,1,2] => 0
[3] => [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 2
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 0
[2,2] => [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 0
[4] => [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
Description
The number of occurrences of the pattern 23-1.
See [[Permutations/#Pattern-avoiding_permutations]] for the definition of the pattern $23\!\!-\!\!1$.
Matching statistic: St000424
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000424: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000424: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [1,2] => 0
[2] => [1,1,0,0]
=> [2,1] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,2] => [1,0,1,1,0,0]
=> [1,3,2] => 1
[2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 0
[3] => [1,1,1,0,0,0]
=> [3,1,2] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 0
[4] => [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 0
Description
The number of occurrences of the pattern 132 or of the pattern 231 in a permutation.
Matching statistic: St000426
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000426: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000426: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [2,1] => 0
[2] => [1,1,0,0]
=> [1,2] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [2,3,1] => 0
[1,2] => [1,0,1,1,0,0]
=> [2,1,3] => 0
[2,1] => [1,1,0,0,1,0]
=> [1,3,2] => 1
[3] => [1,1,1,0,0,0]
=> [1,2,3] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
[1,3] => [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 2
[2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
[3,1] => [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 2
[4] => [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
Description
The number of occurrences of the pattern 132 or of the pattern 312 in a permutation.
Matching statistic: St000431
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000431: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000431: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [1,2] => 0
[2] => [1,1,0,0]
=> [2,1] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,2] => [1,0,1,1,0,0]
=> [1,3,2] => 0
[2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 1
[3] => [1,1,1,0,0,0]
=> [3,1,2] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 0
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 2
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2
[4] => [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 0
Description
The number of occurrences of the pattern 213 or of the pattern 321 in a permutation.
Matching statistic: St000433
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000433: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000433: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 0
[1,1] => [1,0,1,0]
=> [1,2] => 0
[2] => [1,1,0,0]
=> [2,1] => 0
[1,1,1] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,2] => [1,0,1,1,0,0]
=> [1,3,2] => 1
[2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 0
[3] => [1,1,1,0,0,0]
=> [3,1,2] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2
[1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2
[2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0
[2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[3,1] => [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 0
[4] => [1,1,1,1,0,0,0,0]
=> [4,1,2,3] => 0
Description
The number of occurrences of the pattern 132 or of the pattern 321 in a permutation.
The following 371 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001377The major index minus the number of inversions of a permutation. St000255The number of reduced Kogan faces with the permutation as type. St001282The number of graphs with the same chromatic polynomial. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000217The number of occurrences of the pattern 312 in a permutation. St000222The number of alignments in the permutation. St000356The number of occurrences of the pattern 13-2. St000358The number of occurrences of the pattern 31-2. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000377The dinv defect of an integer partition. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000427The number of occurrences of the pattern 123 or of the pattern 231 in a permutation. St000430The number of occurrences of the pattern 123 or of the pattern 312 in a permutation. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000663The number of right floats of a permutation. St000682The Grundy value of Welter's game on a binary word. St000750The number of occurrences of the pattern 4213 in a permutation. St000769The major index of a composition regarded as a word. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000921The number of internal inversions of a binary word. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001397Number of pairs of incomparable elements in a finite poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001403The number of vertical separators in a permutation. St001423The number of distinct cubes in a binary word. St001556The number of inversions of the third entry of a permutation. St001584The area statistic between a Dyck path and its bounce path. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001727The number of invisible inversions of a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001841The number of inversions of a set partition. St001842The major index of a set partition. St001843The Z-index of a set partition. St001911A descent variant minus the number of inversions. St000003The number of standard Young tableaux of the partition. St000078The number of alternating sign matrices whose left key is the permutation. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000345The number of refinements of a partition. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000789The number of crossing-similar perfect matchings of a perfect matching. St000935The number of ordered refinements of an integer partition. St001268The size of the largest ordinal summand in the poset. St001313The number of Dyck paths above the lattice path given by a binary word. St001779The order of promotion on the set of linear extensions of a poset. St001780The order of promotion on the set of standard tableaux of given shape. St001917The order of toric promotion on the set of labellings of a graph. St000451The length of the longest pattern of the form k 1 2. St000434The number of occurrences of the pattern 213 or of the pattern 312 in a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000586The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal. St000599The number of occurrences of the pattern {{1},{2,3}} such that (2,3) are consecutive in a block. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000462The major index minus the number of excedences of a permutation. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000565The major index of a set partition. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000849The number of 1/3-balanced pairs in a poset. St000961The shifted major index of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001557The number of inversions of the second entry of a permutation. St000045The number of linear extensions of a binary tree. St000100The number of linear extensions of a poset. St000988The orbit size of a permutation under Foata's bijection. St000064The number of one-box pattern of a permutation. St001845The number of join irreducibles minus the rank of a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000219The number of occurrences of the pattern 231 in a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000915The Ore degree of a graph. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001176The size of a partition minus its first part. St001280The number of parts of an integer partition that are at least two. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St000699The toughness times the least common multiple of 1,. St001281The normalized isoperimetric number of a graph. St000422The energy of a graph, if it is integral. St000454The largest eigenvalue of a graph if it is integral. St000467The hyper-Wiener index of a connected graph. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001964The interval resolution global dimension of a poset. St001651The Frankl number of a lattice. St000478Another weight of a partition according to Alladi. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000938The number of zeros of the symmetric group character corresponding to the partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000260The radius of a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001722The number of minimal chains with small intervals between a binary word and the top element. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000091The descent variation of a composition. 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. 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. St000562The number of internal points of a set partition. 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. St000661The number of rises of length 3 of a Dyck path. St000674The number of hills of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. 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. St000872The number of very big descents of a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St000934The 2-degree of an integer partition. St000941The number of characters of the symmetric group whose value on the partition is even. St000944The 3-degree of an integer partition. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. 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. St001130The number of two successive successions in a permutation. St001141The number of occurrences of hills of size 3 in a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. 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. St001470The cyclic holeyness of a permutation. St001541The Gini index of an integer partition. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001857The number of edges in the reduced word graph of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001344The neighbouring number of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001896The number of right descents of a signed permutations. St000236The number of cyclical small weak excedances. St000241The number of cyclical small excedances. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000455The second largest eigenvalue of a graph if it is integral. St000567The sum of the products of all pairs of parts. St000879The number of long braid edges in the graph of braid moves of a permutation. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. 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. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001570The minimal number of edges to add to make a graph Hamiltonian. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000181The number of connected components of the Hasse diagram for the poset. St001890The maximum magnitude of the Möbius function of a poset. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000010The length of the partition. St000012The area of a Dyck path. St000016The number of attacking pairs of a standard tableau. St000017The number of inversions of a standard tableau. St000053The number of valleys of the Dyck path. St000117The number of centered tunnels of a Dyck path. St000120The number of left tunnels of a Dyck path. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000147The largest part of an integer partition. St000148The number of odd parts of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. St000185The weighted size of a partition. St000228The size of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000290The major index of a binary word. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000296The length of the symmetric border of a binary word. St000306The bounce count of a Dyck path. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000347The inversion sum of a binary word. St000348The non-inversion sum of a binary word. St000378The diagonal inversion number of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000459The hook length of the base cell of a partition. St000475The number of parts equal to 1 in a partition. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000519The largest length of a factor maximising the subword complexity. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000547The number of even non-empty partial sums of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000628The balance of a binary word. St000629The defect of a binary word. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000691The number of changes of a binary word. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000783The side length of the largest staircase partition fitting into a partition. St000784The maximum of the length and the largest part of the integer partition. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000867The sum of the hook lengths in the first row of an integer partition. St000869The sum of the hook lengths of an integer partition. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000877The depth of the binary word interpreted as a path. St000897The number of different multiplicities of parts of an integer partition. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000992The alternating sum of the parts of an integer partition. St000995The largest even part of an integer partition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001127The sum of the squares of the parts of a partition. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001214The aft of an integer partition. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001231The 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. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001252Half the sum of the even parts of a partition. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001371The length of the longest Yamanouchi prefix of a binary word. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001424The number of distinct squares in a binary word. St001435The number of missing boxes in the first row. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001438The number of missing boxes of a skew partition. St001484The number of singletons of an integer partition. St001485The modular major index of a binary word. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001524The degree of symmetry of a binary word. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001596The number of two-by-two squares inside a skew partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001695The natural comajor index of a standard Young tableau. St001697The shifted natural comajor index of a standard Young tableau. St001712The number of natural descents of a standard Young tableau. St001721The degree of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001910The height of the middle non-run of a Dyck path. St001916The number of transient elements in the orbit of Bulgarian solitaire corresponding to a necklace. St001930The weak major index of a binary word. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001956The comajor index for set-valued two-row standard Young tableaux. St000259The diameter of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000782The indicator function of whether a given perfect matching is an L & P matching. St001645The pebbling number of a connected graph. St000102The charge of a semistandard tableau. St000668The least common multiple of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. 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. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. 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. 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]/(x^n)$. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001569The maximal modular displacement of a permutation.
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!