searching the database
Your data matches 184 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: St000035
(load all 45 compositions to match this statistic)
(load all 45 compositions to match this statistic)
St000035: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 0
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 1
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 1
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 1
[2,3,4,1] => 1
[2,4,1,3] => 1
[2,4,3,1] => 1
[3,1,2,4] => 1
[3,1,4,2] => 2
[3,2,1,4] => 1
[3,2,4,1] => 2
[3,4,1,2] => 1
[3,4,2,1] => 1
[4,1,2,3] => 1
[4,1,3,2] => 2
[4,2,1,3] => 1
[4,2,3,1] => 2
[4,3,1,2] => 1
[4,3,2,1] => 1
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 1
[1,2,5,3,4] => 1
[1,2,5,4,3] => 1
[1,3,2,4,5] => 1
[1,3,2,5,4] => 2
[1,3,4,2,5] => 1
[1,3,4,5,2] => 1
[1,3,5,2,4] => 1
[1,3,5,4,2] => 1
[1,4,2,3,5] => 1
[1,4,2,5,3] => 2
[1,4,3,2,5] => 1
[1,4,3,5,2] => 2
[1,4,5,2,3] => 1
Description
The number of left outer peaks of a permutation.
A left outer peak in a permutation $w = [w_1,..., w_n]$ is either a position $i$ such that $w_{i-1} < w_i > w_{i+1}$ or $1$ if $w_1 > w_2$.
In other words, it is a peak in the word $[0,w_1,..., w_n]$.
This appears in [1, def.3.1]. The joint distribution with [[St000366]] is studied in [3], where left outer peaks are called ''exterior peaks''.
Matching statistic: St000834
(load all 31 compositions to match this statistic)
(load all 31 compositions to match this statistic)
St000834: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 0
[1,2] => 1
[2,1] => 0
[1,2,3] => 1
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 0
[1,2,3,4] => 1
[1,2,4,3] => 1
[1,3,2,4] => 2
[1,3,4,2] => 1
[1,4,2,3] => 2
[1,4,3,2] => 1
[2,1,3,4] => 1
[2,1,4,3] => 1
[2,3,1,4] => 2
[2,3,4,1] => 1
[2,4,1,3] => 2
[2,4,3,1] => 1
[3,1,2,4] => 1
[3,1,4,2] => 1
[3,2,1,4] => 1
[3,2,4,1] => 1
[3,4,1,2] => 2
[3,4,2,1] => 1
[4,1,2,3] => 1
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 1
[4,3,2,1] => 0
[1,2,3,4,5] => 1
[1,2,3,5,4] => 1
[1,2,4,3,5] => 2
[1,2,4,5,3] => 1
[1,2,5,3,4] => 2
[1,2,5,4,3] => 1
[1,3,2,4,5] => 2
[1,3,2,5,4] => 2
[1,3,4,2,5] => 2
[1,3,4,5,2] => 1
[1,3,5,2,4] => 2
[1,3,5,4,2] => 1
[1,4,2,3,5] => 2
[1,4,2,5,3] => 2
[1,4,3,2,5] => 2
[1,4,3,5,2] => 2
[1,4,5,2,3] => 2
Description
The number of right outer peaks of a permutation.
A right outer peak in a permutation $w = [w_1,..., w_n]$ is either a position $i$ such that $w_{i-1} < w_i > w_{i+1}$ or $n$ if $w_n > w_{n-1}$.
In other words, it is a peak in the word $[w_1,..., w_n,0]$.
Matching statistic: St000994
(load all 29 compositions to match this statistic)
(load all 29 compositions to match this statistic)
St000994: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 0
[1,2] => 0
[2,1] => 1
[1,2,3] => 0
[1,3,2] => 1
[2,1,3] => 1
[2,3,1] => 1
[3,1,2] => 1
[3,2,1] => 1
[1,2,3,4] => 0
[1,2,4,3] => 1
[1,3,2,4] => 1
[1,3,4,2] => 1
[1,4,2,3] => 1
[1,4,3,2] => 1
[2,1,3,4] => 1
[2,1,4,3] => 2
[2,3,1,4] => 1
[2,3,4,1] => 1
[2,4,1,3] => 1
[2,4,3,1] => 1
[3,1,2,4] => 1
[3,1,4,2] => 1
[3,2,1,4] => 1
[3,2,4,1] => 1
[3,4,1,2] => 2
[3,4,2,1] => 2
[4,1,2,3] => 1
[4,1,3,2] => 1
[4,2,1,3] => 1
[4,2,3,1] => 1
[4,3,1,2] => 2
[4,3,2,1] => 2
[1,2,3,4,5] => 0
[1,2,3,5,4] => 1
[1,2,4,3,5] => 1
[1,2,4,5,3] => 1
[1,2,5,3,4] => 1
[1,2,5,4,3] => 1
[1,3,2,4,5] => 1
[1,3,2,5,4] => 2
[1,3,4,2,5] => 1
[1,3,4,5,2] => 1
[1,3,5,2,4] => 1
[1,3,5,4,2] => 1
[1,4,2,3,5] => 1
[1,4,2,5,3] => 1
[1,4,3,2,5] => 1
[1,4,3,5,2] => 1
[1,4,5,2,3] => 2
Description
The number of cycle peaks and the number of cycle valleys of a permutation.
A '''cycle peak''' of a permutation $\pi$ is an index $i$ such that $\pi^{-1}(i) < i > \pi(i)$. Analogously, a '''cycle valley''' is an index $i$ such that $\pi^{-1}(i) > i < \pi(i)$.
Clearly, every cycle of $\pi$ contains as many peaks as valleys.
Matching statistic: St000162
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00080: Set partitions —to permutation⟶ Permutations
St000162: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00080: Set partitions —to permutation⟶ Permutations
St000162: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => {{1}}
=> [1] => 0
[1,2] => {{1},{2}}
=> [1,2] => 0
[2,1] => {{1,2}}
=> [2,1] => 1
[1,2,3] => {{1},{2},{3}}
=> [1,2,3] => 0
[1,3,2] => {{1},{2,3}}
=> [1,3,2] => 1
[2,1,3] => {{1,2},{3}}
=> [2,1,3] => 1
[2,3,1] => {{1,2,3}}
=> [2,3,1] => 1
[3,1,2] => {{1,3},{2}}
=> [3,2,1] => 1
[3,2,1] => {{1,3},{2}}
=> [3,2,1] => 1
[1,2,3,4] => {{1},{2},{3},{4}}
=> [1,2,3,4] => 0
[1,2,4,3] => {{1},{2},{3,4}}
=> [1,2,4,3] => 1
[1,3,2,4] => {{1},{2,3},{4}}
=> [1,3,2,4] => 1
[1,3,4,2] => {{1},{2,3,4}}
=> [1,3,4,2] => 1
[1,4,2,3] => {{1},{2,4},{3}}
=> [1,4,3,2] => 1
[1,4,3,2] => {{1},{2,4},{3}}
=> [1,4,3,2] => 1
[2,1,3,4] => {{1,2},{3},{4}}
=> [2,1,3,4] => 1
[2,1,4,3] => {{1,2},{3,4}}
=> [2,1,4,3] => 2
[2,3,1,4] => {{1,2,3},{4}}
=> [2,3,1,4] => 1
[2,3,4,1] => {{1,2,3,4}}
=> [2,3,4,1] => 1
[2,4,1,3] => {{1,2,4},{3}}
=> [2,4,3,1] => 1
[2,4,3,1] => {{1,2,4},{3}}
=> [2,4,3,1] => 1
[3,1,2,4] => {{1,3},{2},{4}}
=> [3,2,1,4] => 1
[3,1,4,2] => {{1,3,4},{2}}
=> [3,2,4,1] => 1
[3,2,1,4] => {{1,3},{2},{4}}
=> [3,2,1,4] => 1
[3,2,4,1] => {{1,3,4},{2}}
=> [3,2,4,1] => 1
[3,4,1,2] => {{1,3},{2,4}}
=> [3,4,1,2] => 2
[3,4,2,1] => {{1,3},{2,4}}
=> [3,4,1,2] => 2
[4,1,2,3] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,1,3,2] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,2,1,3] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,2,3,1] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,3,1,2] => {{1,4},{2,3}}
=> [4,3,2,1] => 2
[4,3,2,1] => {{1,4},{2,3}}
=> [4,3,2,1] => 2
[1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> [1,2,3,4,5] => 0
[1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> [1,2,3,5,4] => 1
[1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> [1,2,4,3,5] => 1
[1,2,4,5,3] => {{1},{2},{3,4,5}}
=> [1,2,4,5,3] => 1
[1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> [1,2,5,4,3] => 1
[1,2,5,4,3] => {{1},{2},{3,5},{4}}
=> [1,2,5,4,3] => 1
[1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> [1,3,2,4,5] => 1
[1,3,2,5,4] => {{1},{2,3},{4,5}}
=> [1,3,2,5,4] => 2
[1,3,4,2,5] => {{1},{2,3,4},{5}}
=> [1,3,4,2,5] => 1
[1,3,4,5,2] => {{1},{2,3,4,5}}
=> [1,3,4,5,2] => 1
[1,3,5,2,4] => {{1},{2,3,5},{4}}
=> [1,3,5,4,2] => 1
[1,3,5,4,2] => {{1},{2,3,5},{4}}
=> [1,3,5,4,2] => 1
[1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => 1
[1,4,2,5,3] => {{1},{2,4,5},{3}}
=> [1,4,3,5,2] => 1
[1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => 1
[1,4,3,5,2] => {{1},{2,4,5},{3}}
=> [1,4,3,5,2] => 1
[1,4,5,2,3] => {{1},{2,4},{3,5}}
=> [1,4,5,2,3] => 2
Description
The number of nontrivial cycles in the cycle decomposition of a permutation.
This statistic is equal to the difference of the number of cycles of $\pi$ (see [[St000031]]) and the number of fixed points of $\pi$ (see [[St000022]]).
Matching statistic: St000291
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => 1 => 0
[1,2] => [2] => 10 => 1
[2,1] => [1,1] => 11 => 0
[1,2,3] => [3] => 100 => 1
[1,3,2] => [2,1] => 101 => 1
[2,1,3] => [1,2] => 110 => 1
[2,3,1] => [2,1] => 101 => 1
[3,1,2] => [1,2] => 110 => 1
[3,2,1] => [1,1,1] => 111 => 0
[1,2,3,4] => [4] => 1000 => 1
[1,2,4,3] => [3,1] => 1001 => 1
[1,3,2,4] => [2,2] => 1010 => 2
[1,3,4,2] => [3,1] => 1001 => 1
[1,4,2,3] => [2,2] => 1010 => 2
[1,4,3,2] => [2,1,1] => 1011 => 1
[2,1,3,4] => [1,3] => 1100 => 1
[2,1,4,3] => [1,2,1] => 1101 => 1
[2,3,1,4] => [2,2] => 1010 => 2
[2,3,4,1] => [3,1] => 1001 => 1
[2,4,1,3] => [2,2] => 1010 => 2
[2,4,3,1] => [2,1,1] => 1011 => 1
[3,1,2,4] => [1,3] => 1100 => 1
[3,1,4,2] => [1,2,1] => 1101 => 1
[3,2,1,4] => [1,1,2] => 1110 => 1
[3,2,4,1] => [1,2,1] => 1101 => 1
[3,4,1,2] => [2,2] => 1010 => 2
[3,4,2,1] => [2,1,1] => 1011 => 1
[4,1,2,3] => [1,3] => 1100 => 1
[4,1,3,2] => [1,2,1] => 1101 => 1
[4,2,1,3] => [1,1,2] => 1110 => 1
[4,2,3,1] => [1,2,1] => 1101 => 1
[4,3,1,2] => [1,1,2] => 1110 => 1
[4,3,2,1] => [1,1,1,1] => 1111 => 0
[1,2,3,4,5] => [5] => 10000 => 1
[1,2,3,5,4] => [4,1] => 10001 => 1
[1,2,4,3,5] => [3,2] => 10010 => 2
[1,2,4,5,3] => [4,1] => 10001 => 1
[1,2,5,3,4] => [3,2] => 10010 => 2
[1,2,5,4,3] => [3,1,1] => 10011 => 1
[1,3,2,4,5] => [2,3] => 10100 => 2
[1,3,2,5,4] => [2,2,1] => 10101 => 2
[1,3,4,2,5] => [3,2] => 10010 => 2
[1,3,4,5,2] => [4,1] => 10001 => 1
[1,3,5,2,4] => [3,2] => 10010 => 2
[1,3,5,4,2] => [3,1,1] => 10011 => 1
[1,4,2,3,5] => [2,3] => 10100 => 2
[1,4,2,5,3] => [2,2,1] => 10101 => 2
[1,4,3,2,5] => [2,1,2] => 10110 => 2
[1,4,3,5,2] => [2,2,1] => 10101 => 2
[1,4,5,2,3] => [3,2] => 10010 => 2
Description
The number of descents of a binary word.
Matching statistic: St000337
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
St000337: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00017: Binary trees —to 312-avoiding permutation⟶ Permutations
St000337: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [.,.]
=> [1] => 0
[1,2] => [.,[.,.]]
=> [2,1] => 1
[2,1] => [[.,.],.]
=> [1,2] => 0
[1,2,3] => [.,[.,[.,.]]]
=> [3,2,1] => 1
[1,3,2] => [.,[[.,.],.]]
=> [2,3,1] => 1
[2,1,3] => [[.,.],[.,.]]
=> [1,3,2] => 1
[2,3,1] => [[.,[.,.]],.]
=> [2,1,3] => 1
[3,1,2] => [[.,.],[.,.]]
=> [1,3,2] => 1
[3,2,1] => [[[.,.],.],.]
=> [1,2,3] => 0
[1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [4,3,2,1] => 2
[1,2,4,3] => [.,[.,[[.,.],.]]]
=> [3,4,2,1] => 1
[1,3,2,4] => [.,[[.,.],[.,.]]]
=> [2,4,3,1] => 1
[1,3,4,2] => [.,[[.,[.,.]],.]]
=> [3,2,4,1] => 2
[1,4,2,3] => [.,[[.,.],[.,.]]]
=> [2,4,3,1] => 1
[1,4,3,2] => [.,[[[.,.],.],.]]
=> [2,3,4,1] => 1
[2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,4,3,2] => 1
[2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,3,4,2] => 1
[2,3,1,4] => [[.,[.,.]],[.,.]]
=> [2,1,4,3] => 2
[2,3,4,1] => [[.,[.,[.,.]]],.]
=> [3,2,1,4] => 1
[2,4,1,3] => [[.,[.,.]],[.,.]]
=> [2,1,4,3] => 2
[2,4,3,1] => [[.,[[.,.],.]],.]
=> [2,3,1,4] => 1
[3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,4,3,2] => 1
[3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,3,4,2] => 1
[3,2,1,4] => [[[.,.],.],[.,.]]
=> [1,2,4,3] => 1
[3,2,4,1] => [[[.,.],[.,.]],.]
=> [1,3,2,4] => 1
[3,4,1,2] => [[.,[.,.]],[.,.]]
=> [2,1,4,3] => 2
[3,4,2,1] => [[[.,[.,.]],.],.]
=> [2,1,3,4] => 1
[4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,4,3,2] => 1
[4,1,3,2] => [[.,.],[[.,.],.]]
=> [1,3,4,2] => 1
[4,2,1,3] => [[[.,.],.],[.,.]]
=> [1,2,4,3] => 1
[4,2,3,1] => [[[.,.],[.,.]],.]
=> [1,3,2,4] => 1
[4,3,1,2] => [[[.,.],.],[.,.]]
=> [1,2,4,3] => 1
[4,3,2,1] => [[[[.,.],.],.],.]
=> [1,2,3,4] => 0
[1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [5,4,3,2,1] => 2
[1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [4,5,3,2,1] => 2
[1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => 2
[1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [4,3,5,2,1] => 2
[1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [3,5,4,2,1] => 2
[1,2,5,4,3] => [.,[.,[[[.,.],.],.]]]
=> [3,4,5,2,1] => 1
[1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => 2
[1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => 1
[1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => 2
[1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [4,3,2,5,1] => 2
[1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => 2
[1,3,5,4,2] => [.,[[.,[[.,.],.]],.]]
=> [3,4,2,5,1] => 2
[1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [2,5,4,3,1] => 2
[1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [2,4,5,3,1] => 1
[1,4,3,2,5] => [.,[[[.,.],.],[.,.]]]
=> [2,3,5,4,1] => 1
[1,4,3,5,2] => [.,[[[.,.],[.,.]],.]]
=> [2,4,3,5,1] => 2
[1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [3,2,5,4,1] => 2
Description
The lec statistic, the sum of the inversion numbers of the hook factors of a permutation.
For a permutation $\sigma = p \tau_{1} \tau_{2} \cdots \tau_{k}$ in its hook factorization, [1] defines $$ \textrm{lec} \, \sigma = \sum_{1 \leq i \leq k} \textrm{inv} \, \tau_{i} \, ,$$ where $\textrm{inv} \, \tau_{i}$ is the number of inversions of $\tau_{i}$.
Matching statistic: St000703
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00240: Permutations —weak exceedance partition⟶ Set partitions
Mp00080: Set partitions —to permutation⟶ Permutations
St000703: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00080: Set partitions —to permutation⟶ Permutations
St000703: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => {{1}}
=> [1] => 0
[1,2] => {{1},{2}}
=> [1,2] => 0
[2,1] => {{1,2}}
=> [2,1] => 1
[1,2,3] => {{1},{2},{3}}
=> [1,2,3] => 0
[1,3,2] => {{1},{2,3}}
=> [1,3,2] => 1
[2,1,3] => {{1,2},{3}}
=> [2,1,3] => 1
[2,3,1] => {{1,2,3}}
=> [2,3,1] => 1
[3,1,2] => {{1,3},{2}}
=> [3,2,1] => 1
[3,2,1] => {{1,3},{2}}
=> [3,2,1] => 1
[1,2,3,4] => {{1},{2},{3},{4}}
=> [1,2,3,4] => 0
[1,2,4,3] => {{1},{2},{3,4}}
=> [1,2,4,3] => 1
[1,3,2,4] => {{1},{2,3},{4}}
=> [1,3,2,4] => 1
[1,3,4,2] => {{1},{2,3,4}}
=> [1,3,4,2] => 1
[1,4,2,3] => {{1},{2,4},{3}}
=> [1,4,3,2] => 1
[1,4,3,2] => {{1},{2,4},{3}}
=> [1,4,3,2] => 1
[2,1,3,4] => {{1,2},{3},{4}}
=> [2,1,3,4] => 1
[2,1,4,3] => {{1,2},{3,4}}
=> [2,1,4,3] => 2
[2,3,1,4] => {{1,2,3},{4}}
=> [2,3,1,4] => 1
[2,3,4,1] => {{1,2,3,4}}
=> [2,3,4,1] => 1
[2,4,1,3] => {{1,2,4},{3}}
=> [2,4,3,1] => 1
[2,4,3,1] => {{1,2,4},{3}}
=> [2,4,3,1] => 1
[3,1,2,4] => {{1,3},{2},{4}}
=> [3,2,1,4] => 1
[3,1,4,2] => {{1,3,4},{2}}
=> [3,2,4,1] => 1
[3,2,1,4] => {{1,3},{2},{4}}
=> [3,2,1,4] => 1
[3,2,4,1] => {{1,3,4},{2}}
=> [3,2,4,1] => 1
[3,4,1,2] => {{1,3},{2,4}}
=> [3,4,1,2] => 2
[3,4,2,1] => {{1,3},{2,4}}
=> [3,4,1,2] => 2
[4,1,2,3] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,1,3,2] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,2,1,3] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,2,3,1] => {{1,4},{2},{3}}
=> [4,2,3,1] => 1
[4,3,1,2] => {{1,4},{2,3}}
=> [4,3,2,1] => 2
[4,3,2,1] => {{1,4},{2,3}}
=> [4,3,2,1] => 2
[1,2,3,4,5] => {{1},{2},{3},{4},{5}}
=> [1,2,3,4,5] => 0
[1,2,3,5,4] => {{1},{2},{3},{4,5}}
=> [1,2,3,5,4] => 1
[1,2,4,3,5] => {{1},{2},{3,4},{5}}
=> [1,2,4,3,5] => 1
[1,2,4,5,3] => {{1},{2},{3,4,5}}
=> [1,2,4,5,3] => 1
[1,2,5,3,4] => {{1},{2},{3,5},{4}}
=> [1,2,5,4,3] => 1
[1,2,5,4,3] => {{1},{2},{3,5},{4}}
=> [1,2,5,4,3] => 1
[1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> [1,3,2,4,5] => 1
[1,3,2,5,4] => {{1},{2,3},{4,5}}
=> [1,3,2,5,4] => 2
[1,3,4,2,5] => {{1},{2,3,4},{5}}
=> [1,3,4,2,5] => 1
[1,3,4,5,2] => {{1},{2,3,4,5}}
=> [1,3,4,5,2] => 1
[1,3,5,2,4] => {{1},{2,3,5},{4}}
=> [1,3,5,4,2] => 1
[1,3,5,4,2] => {{1},{2,3,5},{4}}
=> [1,3,5,4,2] => 1
[1,4,2,3,5] => {{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => 1
[1,4,2,5,3] => {{1},{2,4,5},{3}}
=> [1,4,3,5,2] => 1
[1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> [1,4,3,2,5] => 1
[1,4,3,5,2] => {{1},{2,4,5},{3}}
=> [1,4,3,5,2] => 1
[1,4,5,2,3] => {{1},{2,4},{3,5}}
=> [1,4,5,2,3] => 2
Description
The number of deficiencies of a permutation.
This is defined as
$$\operatorname{dec}(\sigma)=\#\{i:\sigma(i) < i\}.$$
The number of exceedances is [[St000155]].
Matching statistic: St000985
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000985: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000985: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => ([],1)
=> 0
[1,2] => [2] => ([],2)
=> 0
[2,1] => [1,1] => ([(0,1)],2)
=> 1
[1,2,3] => [3] => ([],3)
=> 0
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> 1
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> 1
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,2,3,4] => [4] => ([],4)
=> 0
[1,2,4,3] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,3,2,4] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[1,3,4,2] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,4,2,3] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[1,4,3,2] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[2,1,3,4] => [1,3] => ([(2,3)],4)
=> 1
[2,1,4,3] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[2,3,1,4] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[2,3,4,1] => [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[2,4,1,3] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[2,4,3,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[3,1,2,4] => [1,3] => ([(2,3)],4)
=> 1
[3,1,4,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[3,2,1,4] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[3,2,4,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[3,4,1,2] => [2,2] => ([(1,3),(2,3)],4)
=> 1
[3,4,2,1] => [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[4,1,2,3] => [1,3] => ([(2,3)],4)
=> 1
[4,1,3,2] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[4,2,1,3] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[4,2,3,1] => [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[4,3,1,2] => [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,2,3,4,5] => [5] => ([],5)
=> 0
[1,2,3,5,4] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,2,4,3,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,2,4,5,3] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,2,5,3,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,2,5,4,3] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,3,2,4,5] => [2,3] => ([(2,4),(3,4)],5)
=> 1
[1,3,2,5,4] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,3,4,2,5] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,3,4,5,2] => [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,3,5,2,4] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,3,5,4,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,2,3,5] => [2,3] => ([(2,4),(3,4)],5)
=> 1
[1,4,2,5,3] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,4,3,2,5] => [2,1,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,4,3,5,2] => [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
Description
The number of positive eigenvalues of the adjacency matrix of the graph.
Matching statistic: St001011
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 0
[1,2] => [2] => [1,1,0,0]
=> 0
[2,1] => [1,1] => [1,0,1,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 0
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
Description
Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001188
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001188: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001188: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1,0]
=> 0
[1,2] => [2] => [1,1,0,0]
=> 0
[2,1] => [1,1] => [1,0,1,0]
=> 1
[1,2,3] => [3] => [1,1,1,0,0,0]
=> 0
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
Description
The 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.
Also the number of simple modules that are isolated vertices in the sense of 4.5. (4) in the reference.
The following 174 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001280The number of parts of an integer partition that are at least two. St001354The number of series nodes in the modular decomposition of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001928The number of non-overlapping descents in a permutation. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000024The number of double up and double down steps of a Dyck path. St000053The number of valleys of the Dyck path. St000147The largest part of an integer partition. St000155The number of exceedances (also excedences) of a permutation. St000238The number of indices that are not small weak excedances. St000292The number of ascents of a binary word. St000306The bounce count of a Dyck path. St000316The number of non-left-to-right-maxima of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000353The number of inner valleys of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000390The number of runs of ones in a binary word. St000628The balance of a binary word. St000665The number of rafts of a permutation. St000670The reversal length of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000779The tier of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000884The number of isolated descents of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. 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$. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001489The maximum of the number of descents and the number of inverse descents. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001512The minimum rank of a graph. St001665The number of pure excedances of a permutation. St001726The number of visible inversions of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001874Lusztig's a-function for the symmetric group. St000010The length of the partition. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000299The number of nonisomorphic vertex-induced subtrees. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001093The detour number of a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001203We associate to 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 Dyck path as follows:
St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001471The magnitude of a Dyck path. St001674The number of vertices of the largest induced star graph in the graph. St001792The arboricity of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000251The number of nonsingleton blocks of a set partition. St000659The number of rises of length at least 2 of a Dyck path. St000354The number of recoils of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000829The Ulam distance of a permutation to the identity permutation. St000919The number of maximal left branches of a binary tree. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000444The length of the maximal rise of a Dyck path. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001389The number of partitions of the same length below the given integer partition. St000668The least common multiple of the parts of the partition. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000686The finitistic dominant dimension of a Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001432The order dimension of the partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001955The number of natural descents for set-valued two row standard Young tableaux. St000939The number of characters of the symmetric group whose value on the partition is positive. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001568The smallest positive integer that does not appear twice in the partition. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000260The radius of a connected graph. St000259The diameter of a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000256The number of parts from which one can substract 2 and still get an integer partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001128The exponens consonantiae of a partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000937The number of positive values of the symmetric group character corresponding to the partition. St000456The monochromatic index of a connected graph. St000706The product of the factorials of the multiplicities of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St000454The largest eigenvalue of a graph if it is integral. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St001330The hat guessing number of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000667The greatest common divisor of the parts of the partition. St000781The number of proper colouring schemes of a Ferrers diagram. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001571The Cartan determinant of the integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000284The Plancherel distribution on integer partitions. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000618The number of self-evacuating tableaux of given shape. St000681The Grundy value of Chomp on Ferrers diagrams. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001720The minimal length of a chain of small intervals in a lattice. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001877Number of indecomposable injective modules with projective dimension 2. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000929The constant term of the character polynomial of an integer partition. 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. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001890The maximum magnitude of the Möbius function of a poset. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St000862The number of parts of the shifted shape of a permutation. St001597The Frobenius rank of a skew partition. St001624The breadth of a lattice. St000632The jump number of the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000396The register function (or Horton-Strahler number) of a binary tree.
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!