searching the database
Your data matches 154 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: St000707
St000707: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> 2
[1,1]
=> 1
[3]
=> 6
[2,1]
=> 2
[1,1,1]
=> 1
[4]
=> 24
[3,1]
=> 6
[2,2]
=> 4
[2,1,1]
=> 2
[1,1,1,1]
=> 1
[5]
=> 120
[4,1]
=> 24
[3,2]
=> 12
[3,1,1]
=> 6
[2,2,1]
=> 4
[2,1,1,1]
=> 2
[1,1,1,1,1]
=> 1
[6]
=> 720
[5,1]
=> 120
[4,2]
=> 48
[4,1,1]
=> 24
[3,3]
=> 36
[3,2,1]
=> 12
[3,1,1,1]
=> 6
[2,2,2]
=> 8
[2,2,1,1]
=> 4
[2,1,1,1,1]
=> 2
[1,1,1,1,1,1]
=> 1
Description
The product of the factorials of the parts.
Matching statistic: St001346
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001346: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St001346: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [1,2] => 2
[1,1]
=> [[1],[2]]
=> [2,1] => 1
[3]
=> [[1,2,3]]
=> [1,2,3] => 6
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 24
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => 6
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => 2
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 120
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 24
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => 12
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => 4
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => 2
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => 720
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => 120
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => 48
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => 24
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => 36
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => 12
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => 6
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => 8
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => 4
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => 2
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => 1
Description
The number of parking functions that give the same permutation.
A '''parking function''' $(a_1,\dots,a_n)$ is a list of preferred parking spots of $n$ cars entering a one-way street. Once the cars have parked, the order of the cars gives a permutation of $\{1,\dots,n\}$. This statistic records the number of parking functions that yield the same permutation of cars.
Matching statistic: St000040
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000040: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000040: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [1,2] => [1,2] => 1
[1,1]
=> [[1],[2]]
=> [2,1] => [2,1] => 2
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,2,3] => 1
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => [1,3,2] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [3,2,1] => 6
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,2,3,4] => 1
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => [1,2,4,3] => 2
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [1,4,2,3] => 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => [1,4,3,2] => 6
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [4,3,2,1] => 24
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,2,3,4,5] => 1
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => [1,2,3,5,4] => 2
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => [1,2,5,3,4] => 4
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => [1,2,5,4,3] => 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => [1,5,2,4,3] => 12
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => [1,5,4,3,2] => 24
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 120
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => [1,2,3,4,6,5] => 2
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [1,2,3,6,4,5] => 4
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => [1,2,3,6,5,4] => 6
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [1,2,6,3,4,5] => 8
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => [1,2,6,3,5,4] => 12
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => [1,2,6,5,4,3] => 24
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [1,6,2,5,3,4] => 36
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => [1,6,2,5,4,3] => 48
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => [1,6,5,4,3,2] => 120
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [6,5,4,3,2,1] => 720
Description
The number of regions of the inversion arrangement of a permutation.
The inversion arrangement $\mathcal{A}_w$ consists of the hyperplanes $x_i-x_j=0$ such that $(i,j)$ is an inversion of $w$.
Postnikov [4] conjectured that the number of regions in $\mathcal{A}_w$ equals the number of permutations in the interval $[id,w]$ in the strong Bruhat order if and only if $w$ avoids $4231$, $35142$, $42513$, $351624$. This conjecture was proved by Hultman-Linusson-Shareshian-Sjöstrand [1].
Oh-Postnikov-Yoo [3] showed that the number of regions of $\mathcal{A}_w$ is $|\chi_{G_w}(-1)|$ where $\chi_{G_w}$ is the chromatic polynomial of the inversion graph $G_w$. This is the graph with vertices ${1,2,\ldots,n}$ and edges $(i,j)$ for $i\lneq j$ $w_i\gneq w_j$.
For a permutation $w=w_1\cdots w_n$, Lewis-Morales [2] and Hultman (see appendix in [2]) showed that this number equals the number of placements of $n$ non-attacking rooks on the south-west Rothe diagram of $w$.
Matching statistic: St000109
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000109: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00073: Permutations —major-index to inversion-number bijection⟶ Permutations
St000109: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [1,2] => [1,2] => 1
[1,1]
=> [[1],[2]]
=> [2,1] => [2,1] => 2
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,2,3] => 1
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => [1,3,2] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [3,2,1] => 6
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,2,3,4] => 1
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => [1,2,4,3] => 2
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [1,4,2,3] => 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => [1,4,3,2] => 6
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [4,3,2,1] => 24
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,2,3,4,5] => 1
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => [1,2,3,5,4] => 2
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => [1,2,5,3,4] => 4
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => [1,2,5,4,3] => 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => [1,5,2,4,3] => 12
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => [1,5,4,3,2] => 24
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [5,4,3,2,1] => 120
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => [1,2,3,4,6,5] => 2
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [1,2,3,6,4,5] => 4
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => [1,2,3,6,5,4] => 6
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [1,2,6,3,4,5] => 8
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => [1,2,6,3,5,4] => 12
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => [1,2,6,5,4,3] => 24
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [1,6,2,5,3,4] => 36
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => [1,6,2,5,4,3] => 48
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => [1,6,5,4,3,2] => 120
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [6,5,4,3,2,1] => 720
Description
The number of elements less than or equal to the given element in Bruhat order.
Matching statistic: St000110
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000110: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00069: Permutations —complement⟶ Permutations
St000110: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [1,2] => [2,1] => 2
[1,1]
=> [[1],[2]]
=> [2,1] => [1,2] => 1
[3]
=> [[1,2,3]]
=> [1,2,3] => [3,2,1] => 6
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => [1,3,2] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [1,2,3] => 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [4,3,2,1] => 24
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => [1,4,3,2] => 6
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [2,1,4,3] => 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => [1,2,4,3] => 2
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [1,2,3,4] => 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [5,4,3,2,1] => 120
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => [1,5,4,3,2] => 24
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => [2,1,5,4,3] => 12
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => [1,2,5,4,3] => 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => [1,3,2,5,4] => 4
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => [1,2,3,5,4] => 2
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [1,2,3,4,5] => 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [6,5,4,3,2,1] => 720
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => [1,6,5,4,3,2] => 120
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [2,1,6,5,4,3] => 48
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => [1,2,6,5,4,3] => 24
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [3,2,1,6,5,4] => 36
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => [1,3,2,6,5,4] => 12
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => [1,2,3,6,5,4] => 6
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [2,1,4,3,6,5] => 8
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => [1,2,4,3,6,5] => 4
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => [1,2,3,4,6,5] => 2
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [1,2,3,4,5,6] => 1
Description
The number of permutations less than or equal to a permutation in left weak order.
This is the same as the number of permutations less than or equal to the given permutation in right weak order.
Matching statistic: St000269
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000269: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000269: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [2] => ([],2)
=> 1
[1,1]
=> [[1],[2]]
=> [1,1] => ([(0,1)],2)
=> 2
[3]
=> [[1,2,3]]
=> [3] => ([],3)
=> 1
[2,1]
=> [[1,3],[2]]
=> [1,2] => ([(1,2)],3)
=> 2
[1,1,1]
=> [[1],[2],[3]]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 6
[4]
=> [[1,2,3,4]]
=> [4] => ([],4)
=> 1
[3,1]
=> [[1,3,4],[2]]
=> [1,3] => ([(2,3)],4)
=> 2
[2,2]
=> [[1,2],[3,4]]
=> [2,2] => ([(1,3),(2,3)],4)
=> 4
[2,1,1]
=> [[1,4],[2],[3]]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 6
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 24
[5]
=> [[1,2,3,4,5]]
=> [5] => ([],5)
=> 1
[4,1]
=> [[1,3,4,5],[2]]
=> [1,4] => ([(3,4)],5)
=> 2
[3,2]
=> [[1,2,5],[3,4]]
=> [2,3] => ([(2,4),(3,4)],5)
=> 4
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 6
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 12
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 24
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 120
[6]
=> [[1,2,3,4,5,6]]
=> [6] => ([],6)
=> 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [1,5] => ([(4,5)],6)
=> 2
[4,2]
=> [[1,2,5,6],[3,4]]
=> [2,4] => ([(3,5),(4,5)],6)
=> 4
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [1,1,4] => ([(3,4),(3,5),(4,5)],6)
=> 6
[3,3]
=> [[1,2,3],[4,5,6]]
=> [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 8
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [1,2,3] => ([(2,5),(3,4),(3,5),(4,5)],6)
=> 12
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [1,1,1,3] => ([(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 24
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 36
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [1,1,2,2] => ([(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 48
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [1,1,1,1,2] => ([(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 120
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 720
Description
The number of acyclic orientations of a graph.
Matching statistic: St001109
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001109: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00207: Standard tableaux —horizontal strip sizes⟶ Integer compositions
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St001109: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [2] => ([],2)
=> 1
[1,1]
=> [[1],[2]]
=> [1,1] => ([(0,1)],2)
=> 2
[3]
=> [[1,2,3]]
=> [3] => ([],3)
=> 1
[2,1]
=> [[1,2],[3]]
=> [2,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,1]
=> [[1],[2],[3]]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 6
[4]
=> [[1,2,3,4]]
=> [4] => ([],4)
=> 1
[3,1]
=> [[1,2,3],[4]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[2,2]
=> [[1,2],[3,4]]
=> [2,2] => ([(1,3),(2,3)],4)
=> 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 6
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 24
[5]
=> [[1,2,3,4,5]]
=> [5] => ([],5)
=> 1
[4,1]
=> [[1,2,3,4],[5]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[3,2]
=> [[1,2,3],[4,5]]
=> [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 4
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 12
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [2,1,1,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 24
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 120
[6]
=> [[1,2,3,4,5,6]]
=> [6] => ([],6)
=> 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 2
[4,2]
=> [[1,2,3,4],[5,6]]
=> [4,2] => ([(1,5),(2,5),(3,5),(4,5)],6)
=> 4
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [4,1,1] => ([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 6
[3,3]
=> [[1,2,3],[4,5,6]]
=> [3,3] => ([(2,5),(3,5),(4,5)],6)
=> 8
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 12
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [3,1,1,1] => ([(0,3),(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 24
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [2,2,2] => ([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 36
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [2,2,1,1] => ([(0,4),(0,5),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 48
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [2,1,1,1,1] => ([(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 120
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [1,1,1,1,1,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 720
Description
The number of proper colourings of a graph with as few colours as possible.
By definition, this is the evaluation of the chromatic polynomial at the first nonnegative integer which is not a zero of the polynomial.
Matching statistic: St001813
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001813: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00065: Permutations —permutation poset⟶ Posets
St001813: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[2]
=> [[1,2]]
=> [1,2] => ([(0,1)],2)
=> 2
[1,1]
=> [[1],[2]]
=> [2,1] => ([],2)
=> 1
[3]
=> [[1,2,3]]
=> [1,2,3] => ([(0,2),(2,1)],3)
=> 6
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => ([(1,2)],3)
=> 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => ([],3)
=> 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => ([(0,3),(2,1),(3,2)],4)
=> 24
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => ([(1,2),(2,3)],4)
=> 6
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => ([(0,3),(1,2)],4)
=> 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => ([(2,3)],4)
=> 2
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => ([],4)
=> 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => ([(0,4),(2,3),(3,1),(4,2)],5)
=> 120
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => ([(1,4),(3,2),(4,3)],5)
=> 24
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => ([(0,3),(1,4),(4,2)],5)
=> 12
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => ([(2,3),(3,4)],5)
=> 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => ([(1,4),(2,3)],5)
=> 4
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => ([(3,4)],5)
=> 2
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => ([],5)
=> 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 720
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => ([(1,5),(3,4),(4,2),(5,3)],6)
=> 120
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => ([(0,5),(1,3),(4,2),(5,4)],6)
=> 48
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => ([(2,3),(3,5),(5,4)],6)
=> 24
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => ([(0,5),(1,4),(4,2),(5,3)],6)
=> 36
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => ([(1,3),(2,4),(4,5)],6)
=> 12
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => ([(3,4),(4,5)],6)
=> 6
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => ([(0,5),(1,4),(2,3)],6)
=> 8
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => ([(2,5),(3,4)],6)
=> 4
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => ([(4,5)],6)
=> 2
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => ([],6)
=> 1
Description
The product of the sizes of the principal order filters in a poset.
Matching statistic: St000033
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000033: Permutations ⟶ ℤResult quality: 61% ●values known / values provided: 61%●distinct values known / distinct values provided: 64%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000033: Permutations ⟶ ℤResult quality: 61% ●values known / values provided: 61%●distinct values known / distinct values provided: 64%
Values
[2]
=> [[1,2]]
=> [1,2] => 2
[1,1]
=> [[1],[2]]
=> [2,1] => 1
[3]
=> [[1,2,3]]
=> [1,2,3] => 6
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => 2
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => 24
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => 6
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 4
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => 2
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => 120
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => 24
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => 12
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 6
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => 4
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => 2
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => ? ∊ {1,2,4,6,8,12,24,36,48,120,720}
Description
The number of permutations greater than or equal to the given permutation in (strong) Bruhat order.
Matching statistic: St001232
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 36% ●values known / values provided: 50%●distinct values known / distinct values provided: 36%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 36% ●values known / values provided: 50%●distinct values known / distinct values provided: 36%
Values
[2]
=> [[1,2]]
=> [1,2] => [1,0,1,0]
=> 1 = 2 - 1
[1,1]
=> [[1],[2]]
=> [2,1] => [1,1,0,0]
=> 0 = 1 - 1
[3]
=> [[1,2,3]]
=> [1,2,3] => [1,0,1,0,1,0]
=> ? = 6 - 1
[2,1]
=> [[1,3],[2]]
=> [2,1,3] => [1,1,0,0,1,0]
=> 1 = 2 - 1
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> ? ∊ {6,24} - 1
[3,1]
=> [[1,3,4],[2]]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> ? ∊ {6,24} - 1
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 3 = 4 - 1
[2,1,1]
=> [[1,4],[2],[3]]
=> [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> ? ∊ {6,12,24,120} - 1
[4,1]
=> [[1,3,4,5],[2]]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> ? ∊ {6,12,24,120} - 1
[3,2]
=> [[1,2,5],[3,4]]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> ? ∊ {6,12,24,120} - 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [3,2,1,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> ? ∊ {6,12,24,120} - 1
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [4,2,5,1,3] => [1,1,1,1,0,0,1,0,0,0]
=> 3 = 4 - 1
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [2,1,3,4,5,6] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[4,2]
=> [[1,2,5,6],[3,4]]
=> [3,4,1,2,5,6] => [1,1,1,0,1,0,0,0,1,0,1,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [3,2,1,4,5,6] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [1,1,1,1,0,1,0,1,0,0,0,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [4,2,5,1,3,6] => [1,1,1,1,0,0,1,0,0,0,1,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [4,3,2,1,5,6] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? ∊ {8,12,24,36,48,120,720} - 1
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5 = 6 - 1
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3 = 4 - 1
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1 = 2 - 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0 = 1 - 1
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
The following 144 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000706The product of the factorials of the multiplicities of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. 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. St001722The number of minimal chains with small intervals between a binary word and the top element. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000352The Elizalde-Pak rank of a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000007The number of saliances of the permutation. St000054The first entry of the permutation. St001083The number of boxed occurrences of 132 in a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000422The energy of a graph, if it is integral. St000456The monochromatic index of a connected graph. St001487The number of inner corners of a skew partition. St001545The second Elser number of a connected graph. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000023The number of inner peaks of a permutation. St000090The variation of a composition. St000091The descent variation of a composition. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000357The number of occurrences of the pattern 12-3. St000491The number of inversions of a set partition. St000492The rob statistic of a set partition. St000497The lcb statistic of a set partition. St000498The lcs statistic of a set partition. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000562The number of internal points of a set partition. St000565The major index of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000624The normalized sum of the minimal distances to a greater element. St000649The number of 3-excedences of a permutation. St000654The first descent of a permutation. St000681The Grundy value of Chomp on Ferrers diagrams. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000779The tier of a permutation. St000823The number of unsplittable factors of the set partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000990The first ascent of a permutation. St001050The number of terminal closers of a set partition. 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. St001151The number of blocks with odd minimum. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001469The holeyness of a permutation. St001520The number of strict 3-descents. St001549The number of restricted non-inversions between exceedances. St001565The number of arithmetic progressions of length 2 in a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001896The number of right descents of a signed permutations. St001904The length of the initial strictly increasing segment of a parking function. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St001960The number of descents of a permutation minus one if its first entry is not one. St000075The orbit size of a standard tableau under promotion. St000089The absolute variation of a composition. St000099The number of valleys of a permutation, including the boundary. St000166The depth minus 1 of an ordered tree. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000241The number of cyclical small excedances. St000308The height of the tree associated to a permutation. St000365The number of double ascents of a permutation. St000383The last part of an integer composition. St000461The rix statistic of a permutation. St000522The number of 1-protected nodes of a rooted tree. St000542The number of left-to-right-minima of a permutation. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000612The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, (2,3) are consecutive in a block. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000709The number of occurrences of 14-2-3 or 14-3-2. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of 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. St000839The largest opener of a set partition. St000873The aix statistic of a permutation. St001153The number of blocks with even minimum in a set partition. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001557The number of inversions of the second entry of a permutation. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St001727The number of invisible inversions of a permutation. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001948The number of augmented double ascents of a permutation. St000230Sum of the minimal elements of the blocks of a set partition. St000521The number of distinct subtrees of an ordered tree. St000595The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001516The number of cyclic bonds of a permutation. St000060The greater neighbor of the maximum. St000505The biggest entry in the block containing the 1. St000579The number of occurrences of the pattern {{1},{2}} such that 2 is a maximal element. St000599The number of occurrences of the pattern {{1},{2,3}} such that (2,3) are consecutive in a block. St000726The normalized sum of the leaf labels of the increasing binary tree associated to a permutation. St000740The last entry of a permutation. St000796The stat' of a permutation. St000863The length of the first row of the shifted shape of a permutation. St000971The smallest closer of a set partition. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001497The position of the largest weak excedence of a permutation. St001726The number of visible inversions of a permutation. St000235The number of indices that are not cyclical small weak excedances. St000238The number of indices that are not small weak excedances. St000240The number of indices that are not small excedances. St000242The number of indices that are not cyclical small weak excedances. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000735The last entry on the main diagonal of a standard tableau. St000226The convexity of a permutation. St000625The sum of the minimal distances to a greater element. St000424The number of occurrences of the pattern 132 or of the pattern 231 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. St000434The number of occurrences of the pattern 213 or of the pattern 312 in a permutation. 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)$. St001671Haglund's hag of a permutation. St000231Sum of the maximal elements of the blocks of a set partition. St000471The sum of the ascent tops of a permutation. St000472The sum of the ascent bottoms of a permutation. St001168The vector space dimension of the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$.
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!