searching the database
Your data matches 422 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: St000995
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St000995: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000995: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 0
[2]
=> [2]
=> 2
[1,1]
=> [1,1]
=> 0
[2,1]
=> [3]
=> 0
Description
The largest even part of an integer partition.
Matching statistic: St001177
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St001177: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001177: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 0
[2]
=> [1,1]
=> 2
[1,1]
=> [2]
=> 0
[2,1]
=> [3]
=> 0
Description
Twice the mean value of the major index among all standard Young tableaux of a partition.
For a partition $\lambda$ of $n$, this mean value is given in [1, Proposition 3.1] by
$$\frac{1}{2}\Big(\binom{n}{2} - \sum_i\binom{\lambda_i}{2} + \sum_i\binom{\lambda_i'}{2}\Big),$$
where $\lambda_i$ is the size of the $i$-th row of $\lambda$ and $\lambda_i'$ is the size of the $i$-th column.
Matching statistic: St001248
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St001248: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001248: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 0
[2]
=> [2]
=> 2
[1,1]
=> [1,1]
=> 0
[2,1]
=> [3]
=> 0
Description
Sum of the even parts of a partition.
Matching statistic: St000810
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St000810: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000810: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 1 = 0 + 1
[2]
=> [1,1]
=> 3 = 2 + 1
[1,1]
=> [2]
=> 1 = 0 + 1
[2,1]
=> [3]
=> 1 = 0 + 1
Description
The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions.
For example, $p_{22} = 2m_{22} + m_4$, so the statistic on the partition $22$ is 3.
Matching statistic: St001564
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St001564: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001564: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 1 = 0 + 1
[2]
=> [1,1]
=> 3 = 2 + 1
[1,1]
=> [2]
=> 1 = 0 + 1
[2,1]
=> [3]
=> 1 = 0 + 1
Description
The value of the forgotten symmetric functions when all variables set to 1.
Let $f_\lambda(x)$ denote the forgotten symmetric functions.
Then the statistic associated with $\lambda$, where $\lambda$ has $\ell$ parts,
is $f_\lambda(1,1,\dotsc,1)$ where there are $\ell$ variables substituted by $1$.
Matching statistic: St000511
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St000511: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000511: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> 2 = 0 + 2
[2]
=> [1,1]
=> 4 = 2 + 2
[1,1]
=> [2]
=> 2 = 0 + 2
[2,1]
=> [3]
=> 2 = 0 + 2
Description
The number of invariant subsets when acting with a permutation of given cycle type.
Matching statistic: St000051
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00140: Dyck paths —logarithmic height to pruning number⟶ Binary trees
St000051: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00140: Dyck paths —logarithmic height to pruning number⟶ Binary trees
St000051: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [.,[.,.]]
=> 0
[2]
=> [1,1,0,0,1,0]
=> [[.,[.,.]],.]
=> 2
[1,1]
=> [1,0,1,1,0,0]
=> [.,[[.,.],.]]
=> 0
[2,1]
=> [1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> 0
Description
The size of the left subtree of a binary tree.
Matching statistic: St000279
(load all 20 compositions to match this statistic)
(load all 20 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000279: 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
St000279: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [2,1] => 0
[2]
=> [1,1,0,0,1,0]
=> [1,3,2] => 2
[1,1]
=> [1,0,1,1,0,0]
=> [2,1,3] => 0
[2,1]
=> [1,0,1,0,1,0]
=> [2,3,1] => 0
Description
The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations.
Matching statistic: St000290
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000290: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00269: Binary words —flag zeros to zeros⟶ Binary words
St000290: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 10 => 00 => 0
[2]
=> 100 => 010 => 2
[1,1]
=> 110 => 001 => 0
[2,1]
=> 1010 => 0000 => 0
Description
The major index of a binary word.
This is the sum of the positions of descents, i.e., a one followed by a zero.
For words of length $n$ with $a$ zeros, the generating function for the major index is the $q$-binomial coefficient $\binom{n}{a}_q$.
Matching statistic: St000295
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00093: Dyck paths —to binary word⟶ Binary words
St000295: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00093: Dyck paths —to binary word⟶ Binary words
St000295: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> 10 => 0
[2]
=> [1,0,1,0]
=> 1010 => 2
[1,1]
=> [1,1,0,0]
=> 1100 => 0
[2,1]
=> [1,0,1,1,0,0]
=> 101100 => 0
Description
The length of the border of a binary word.
The border of a word is the longest word which is both a proper prefix and a proper suffix, including a possible empty border.
The following 412 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000534The number of 2-rises of a permutation. St000726The normalized sum of the leaf labels of the increasing binary tree associated to a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000951The dimension of $Ext^{1}(D(A),A)$ of the corresponding LNakayama algebra. St000979Half of MacMahon's equal index of a Dyck path. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001279The sum of the parts of an integer partition that are at least two. St001371The length of the longest Yamanouchi prefix of a binary word. St001485The modular major index of a binary word. St001557The number of inversions of the second entry of a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001916The number of transient elements in the orbit of Bulgarian solitaire corresponding to a necklace. St000011The number of touch points (or returns) of a Dyck path. St000238The number of indices that are not small weak excedances. St000391The sum of the positions of the ones in a binary word. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000715The number of semistandard Young tableaux of given shape and entries at most 3. St000756The sum of the positions of the left to right maxima of a permutation. St000763The sum of the positions of the strong records of an integer composition. St000792The Grundy value for the game of ruler on a binary word. St000874The position of the last double rise in a Dyck path. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000946The sum of the skew hook positions in a Dyck path. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000976The sum of the positions of double up-steps of a Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001202Call 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. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001468The smallest fixpoint of a permutation. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001915The size of the component corresponding to a necklace in Bulgarian solitaire. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001809The index of the step at the first peak of maximal height in a Dyck path. St000004The major index of a permutation. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000008The major index of the composition. St000027The major index of a Dyck path. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000043The number of crossings plus two-nestings of a perfect matching. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000119The number of occurrences of the pattern 321 in a permutation. St000120The number of left tunnels of a Dyck path. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000124The cardinality of the preimage of the Simion-Schmidt map. St000133The "bounce" of a permutation. St000148The number of odd parts of a partition. St000154The sum of the descent bottoms of a permutation. St000156The Denert index of a permutation. St000210Minimum over maximum difference of elements in cycles. St000217The number of occurrences of the pattern 312 in a permutation. St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000222The number of alignments in the permutation. St000234The number of global ascents of a permutation. St000235The number of indices that are not cyclical small weak excedances. St000237The number of small exceedances. St000289The decimal representation of a binary word. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000305The inverse major index of a permutation. St000315The number of isolated vertices of a graph. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000338The number of pixed points of a permutation. St000355The number of occurrences of the pattern 21-3. St000356The number of occurrences of the pattern 13-2. St000360The number of occurrences of the pattern 32-1. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000389The number of runs of ones of odd length in a binary word. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000431The number of occurrences of the pattern 213 or of the pattern 321 in a permutation. St000433The number of occurrences of the pattern 132 or of the pattern 321 in a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000445The number of rises of length 1 of a Dyck path. St000457The number of occurrences of one of the patterns 132, 213 or 321 in a permutation. St000461The rix statistic of a permutation. St000462The major index minus the number of excedences of a permutation. St000463The number of admissible inversions of a permutation. St000475The number of parts equal to 1 in a partition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000498The lcs statistic of a set partition. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000538The number of even inversions of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000546The number of global descents of a permutation. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000616The inversion index of a permutation. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000646The number of big ascents of a permutation. St000648The number of 2-excedences of a permutation. St000653The last descent of a permutation. St000658The number of rises of length 2 of a Dyck path. St000663The number of right floats of a permutation. St000664The number of right ropes of a permutation. St000673The number of non-fixed points of a permutation. St000676The number of odd rises of a Dyck path. St000682The Grundy value of Welter's game on a binary word. 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. St000692Babson and Steingrímsson's statistic of a permutation. St000732The number of double deficiencies of a permutation. St000747A variant of the major index of a set partition. St000748The major index of the permutation obtained by flattening the set partition. St000769The major index of a composition regarded as a word. St000794The mak of a permutation. St000796The stat' of a permutation. St000797The stat`` of a permutation. St000798The makl of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000824The sum of the number of descents and the number of recoils of a permutation. St000825The sum of the major and the inverse major index of a permutation. St000828The spearman's rho of a permutation and the identity permutation. St000830The total displacement of a permutation. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000873The aix statistic of a permutation. St000877The depth of the binary word interpreted as a path. St000879The number of long braid edges in the graph of braid moves of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000934The 2-degree of an integer partition. St000947The major index east count of a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000961The shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St000989The number of final rises of a permutation. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. 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. St001034The area of the parallelogram polyomino associated with the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001080The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001161The major index north count of a Dyck path. St001172The number of 1-rises at odd height of a Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001233The number of indecomposable 2-dimensional modules with projective dimension one. 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. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001351The Albertson index of a graph. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001367The smallest number which does not occur as degree of a vertex in a graph. St001374The Padmakar-Ivan index of a graph. St001379The number of inversions plus the major index of a permutation. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001423The number of distinct cubes in a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001510The number of self-evacuating linear extensions of a finite poset. St001524The degree of symmetry of a binary word. St001535The number of cyclic alignments of a permutation. St001536The number of cyclic misalignments of a permutation. St001556The number of inversions of the third entry of a permutation. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001669The number of single rises in a Dyck path. St001671Haglund's hag of a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001695The natural comajor index of a standard Young tableau. St001696The natural major index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001705The number of occurrences of the pattern 2413 in a permutation. St001727The number of invisible inversions of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001759The Rajchgot index of a permutation. St001777The number of weak descents in an integer composition. St001836The number of occurrences of a 213 pattern in the restricted growth word of a perfect matching. St001856The number of edges in the reduced word graph of a permutation. St001902The number of potential covers of a poset. St001911A descent variant minus the number of inversions. St000001The number of reduced words for a permutation. St000007The number of saliances of the permutation. St000012The area of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000037The sign of a permutation. St000047The number of standard immaculate tableaux of a given shape. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000054The first entry of the permutation. St000055The inversion sum of a permutation. St000056The decomposition (or block) number of a permutation. St000061The number of nodes on the left branch of a binary tree. St000078The number of alternating sign matrices whose left key is the permutation. St000084The number of subtrees. St000141The maximum drop size of a permutation. St000153The number of adjacent cycles of a permutation. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000224The sorting index of a permutation. St000230Sum of the minimal elements of the blocks of a set partition. St000242The number of indices that are not cyclical small weak excedances. St000255The number of reduced Kogan faces with the permutation as type. St000316The number of non-left-to-right-maxima of a permutation. St000326The position of the first one in a binary word after appending a 1 at the end. St000332The positive inversions of an alternating sign matrix. St000335The difference of lower and upper interactions. St000339The maf index of a permutation. 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. St000392The length of the longest run of ones in a binary word. St000416The number of inequivalent increasing trees of an ordered tree. St000420The number of Dyck paths that are weakly above a Dyck path. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000472The sum of the ascent bottoms of a permutation. St000487The length of the shortest cycle of a permutation. St000489The number of cycles of a permutation of length at most 3. St000501The size of the first part in the decomposition of a permutation. St000517The Kreweras number of an integer partition. St000529The number of permutations whose descent word is the given binary word. St000539The number of odd inversions of a permutation. St000542The number of left-to-right-minima of a permutation. St000543The size of the conjugacy class of a binary word. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000617The number of global maxima of a Dyck path. St000626The minimal period of a binary word. St000627The exponent of a binary word. St000651The maximal size of a rise in a permutation. St000652The maximal difference between successive positions of a permutation. St000655The length of the minimal rise of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. 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. St000690The size of the conjugacy class of a permutation. St000740The last entry of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000762The sum of the positions of the weak records of an integer composition. St000765The number of weak records in an integer composition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000795The mad of a permutation. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000843The decomposition number of a perfect matching. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000883The number of longest increasing subsequences of a permutation. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000983The length of the longest alternating subword. St000984The number of boxes below precisely one peak. St000990The first ascent of a permutation. St000991The number of right-to-left minima of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001048The number of leaves in the subtree containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001077The prefix exchange distance of a permutation. St001081The number of minimal length factorizations of a permutation into star transpositions. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001267The length of the Lyndon factorization of the binary word. St001285The number of primes in the column sums of the two line notation of a permutation. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001312Number of parabolic noncrossing partitions indexed by the composition. St001313The number of Dyck paths above the lattice path given by a binary word. St001375The pancake length of a permutation. St001377The major index minus the number of inversions of a permutation. St001388The number of non-attacking neighbors of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001412Number of minimal entries in the Bruhat order matrix of a permutation. St001415The length of the longest palindromic prefix of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001437The flex of a binary word. St001461The number of topologically connected components of the chord diagram of a permutation. St001462The number of factors of a standard tableaux under concatenation. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001481The minimal height of a peak of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001528The number of permutations such that the product with the permutation has the same number of fixed points. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001675The number of parts equal to the part in the reversed composition. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001721The degree of a binary word. St001733The number of weak left to right maxima of a Dyck path. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001806The upper middle entry of a permutation. St001807The lower middle entry of a permutation. St001808The box weight or horizontal decoration of a Dyck path. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001838The number of nonempty primitive factors of a binary word. St001850The number of Hecke atoms of a permutation. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001874Lusztig's a-function for the symmetric group. St001884The number of borders of a binary word. St001931The weak major index of an integer composition regarded as a word. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000038The product of the heights of the descending steps of a Dyck path. St000040The number of regions of the inversion arrangement of a permutation. St000109The number of elements less than or equal to the given element in Bruhat order. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000401The size of the symmetry class of a permutation. St000402Half the size of the symmetry class of a permutation. St000418The number of Dyck paths that are weakly below a Dyck path. St000439The position of the first down step of a Dyck path. St000495The number of inversions of distance at most 2 of a permutation. St000505The biggest entry in the block containing the 1. St000638The number of up-down runs of a permutation. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. 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. St000833The comajor index of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St000973The length of the boundary of an ordered tree. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001058The breadth of the ordered tree. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001439The number of even weak deficiencies and of odd weak exceedences. St001500The global dimension of magnitude 1 Nakayama algebras. St001531Number of partial orders contained in the poset determined by the Dyck path. St001735The number of permutations with the same set of runs. St001817The number of flag weak exceedances of a signed permutation. St001959The product of the heights of the peaks of a Dyck path. St001966Half the global dimension of the stable Auslander algebra of a sincere Nakayama algebra (with associated Dyck path). St000226The convexity of a permutation. St000458The number of permutations obtained by switching adjacencies or successions. St000738The first entry in the last row of a standard tableau. St000978The sum of the positions of double down-steps of a Dyck path. St000977MacMahon's equal index of a Dyck path. St000981The length of the longest zigzag subpath. St001814The number of partitions interlacing the given 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. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000674The number of hills of a Dyck path. 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. St000247The number of singleton blocks of a set partition. St000248The number of anti-singletons of a set partition. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000422The energy of a graph, if it is integral. St000471The sum of the ascent tops of a permutation. St000894The trace of an alternating sign matrix. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001811The Castelnuovo-Mumford regularity of a permutation. St001964The interval resolution global dimension of a poset. St000260The radius of a connected graph. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. 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$.
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!