searching the database
Your data matches 57 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: St000990
(load all 18 compositions to match this statistic)
(load all 18 compositions to match this statistic)
St000990: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 1
[2,1] => 2
[1,2,3] => 1
[1,3,2] => 1
[2,1,3] => 2
[2,3,1] => 1
[3,1,2] => 2
[3,2,1] => 3
[1,2,3,4] => 1
[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] => 2
[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] => 2
[3,1,4,2] => 2
[3,2,1,4] => 3
[3,2,4,1] => 2
[3,4,1,2] => 1
[3,4,2,1] => 1
[4,1,2,3] => 2
[4,1,3,2] => 2
[4,2,1,3] => 3
[4,2,3,1] => 2
[4,3,1,2] => 3
[4,3,2,1] => 4
[1,2,3,4,5] => 1
[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] => 1
[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] => 1
[1,4,5,3,2] => 1
Description
The first ascent of a permutation.
For a permutation $\pi$, this is the smallest index such that $\pi(i) < \pi(i+1)$.
For the first descent, see [[St000654]].
Matching statistic: St000745
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00070: Permutations —Robinson-Schensted recording tableau⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [[1,2]]
=> 1
[2,1] => [[1],[2]]
=> 2
[1,2,3] => [[1,2,3]]
=> 1
[1,3,2] => [[1,2],[3]]
=> 1
[2,1,3] => [[1,3],[2]]
=> 2
[2,3,1] => [[1,2],[3]]
=> 1
[3,1,2] => [[1,3],[2]]
=> 2
[3,2,1] => [[1],[2],[3]]
=> 3
[1,2,3,4] => [[1,2,3,4]]
=> 1
[1,2,4,3] => [[1,2,3],[4]]
=> 1
[1,3,2,4] => [[1,2,4],[3]]
=> 1
[1,3,4,2] => [[1,2,3],[4]]
=> 1
[1,4,2,3] => [[1,2,4],[3]]
=> 1
[1,4,3,2] => [[1,2],[3],[4]]
=> 1
[2,1,3,4] => [[1,3,4],[2]]
=> 2
[2,1,4,3] => [[1,3],[2,4]]
=> 2
[2,3,1,4] => [[1,2,4],[3]]
=> 1
[2,3,4,1] => [[1,2,3],[4]]
=> 1
[2,4,1,3] => [[1,2],[3,4]]
=> 1
[2,4,3,1] => [[1,2],[3],[4]]
=> 1
[3,1,2,4] => [[1,3,4],[2]]
=> 2
[3,1,4,2] => [[1,3],[2,4]]
=> 2
[3,2,1,4] => [[1,4],[2],[3]]
=> 3
[3,2,4,1] => [[1,3],[2],[4]]
=> 2
[3,4,1,2] => [[1,2],[3,4]]
=> 1
[3,4,2,1] => [[1,2],[3],[4]]
=> 1
[4,1,2,3] => [[1,3,4],[2]]
=> 2
[4,1,3,2] => [[1,3],[2],[4]]
=> 2
[4,2,1,3] => [[1,4],[2],[3]]
=> 3
[4,2,3,1] => [[1,3],[2],[4]]
=> 2
[4,3,1,2] => [[1,4],[2],[3]]
=> 3
[4,3,2,1] => [[1],[2],[3],[4]]
=> 4
[1,2,3,4,5] => [[1,2,3,4,5]]
=> 1
[1,2,3,5,4] => [[1,2,3,4],[5]]
=> 1
[1,2,4,3,5] => [[1,2,3,5],[4]]
=> 1
[1,2,4,5,3] => [[1,2,3,4],[5]]
=> 1
[1,2,5,3,4] => [[1,2,3,5],[4]]
=> 1
[1,2,5,4,3] => [[1,2,3],[4],[5]]
=> 1
[1,3,2,4,5] => [[1,2,4,5],[3]]
=> 1
[1,3,2,5,4] => [[1,2,4],[3,5]]
=> 1
[1,3,4,2,5] => [[1,2,3,5],[4]]
=> 1
[1,3,4,5,2] => [[1,2,3,4],[5]]
=> 1
[1,3,5,2,4] => [[1,2,3],[4,5]]
=> 1
[1,3,5,4,2] => [[1,2,3],[4],[5]]
=> 1
[1,4,2,3,5] => [[1,2,4,5],[3]]
=> 1
[1,4,2,5,3] => [[1,2,4],[3,5]]
=> 1
[1,4,3,2,5] => [[1,2,5],[3],[4]]
=> 1
[1,4,3,5,2] => [[1,2,4],[3],[5]]
=> 1
[1,4,5,2,3] => [[1,2,3],[4,5]]
=> 1
[1,4,5,3,2] => [[1,2,3],[4],[5]]
=> 1
Description
The index of the last row whose first entry is the row number in a standard Young tableau.
Matching statistic: St000297
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00109: Permutations —descent word⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => 0 => 0 = 1 - 1
[2,1] => 1 => 1 = 2 - 1
[1,2,3] => 00 => 0 = 1 - 1
[1,3,2] => 01 => 0 = 1 - 1
[2,1,3] => 10 => 1 = 2 - 1
[2,3,1] => 01 => 0 = 1 - 1
[3,1,2] => 10 => 1 = 2 - 1
[3,2,1] => 11 => 2 = 3 - 1
[1,2,3,4] => 000 => 0 = 1 - 1
[1,2,4,3] => 001 => 0 = 1 - 1
[1,3,2,4] => 010 => 0 = 1 - 1
[1,3,4,2] => 001 => 0 = 1 - 1
[1,4,2,3] => 010 => 0 = 1 - 1
[1,4,3,2] => 011 => 0 = 1 - 1
[2,1,3,4] => 100 => 1 = 2 - 1
[2,1,4,3] => 101 => 1 = 2 - 1
[2,3,1,4] => 010 => 0 = 1 - 1
[2,3,4,1] => 001 => 0 = 1 - 1
[2,4,1,3] => 010 => 0 = 1 - 1
[2,4,3,1] => 011 => 0 = 1 - 1
[3,1,2,4] => 100 => 1 = 2 - 1
[3,1,4,2] => 101 => 1 = 2 - 1
[3,2,1,4] => 110 => 2 = 3 - 1
[3,2,4,1] => 101 => 1 = 2 - 1
[3,4,1,2] => 010 => 0 = 1 - 1
[3,4,2,1] => 011 => 0 = 1 - 1
[4,1,2,3] => 100 => 1 = 2 - 1
[4,1,3,2] => 101 => 1 = 2 - 1
[4,2,1,3] => 110 => 2 = 3 - 1
[4,2,3,1] => 101 => 1 = 2 - 1
[4,3,1,2] => 110 => 2 = 3 - 1
[4,3,2,1] => 111 => 3 = 4 - 1
[1,2,3,4,5] => 0000 => 0 = 1 - 1
[1,2,3,5,4] => 0001 => 0 = 1 - 1
[1,2,4,3,5] => 0010 => 0 = 1 - 1
[1,2,4,5,3] => 0001 => 0 = 1 - 1
[1,2,5,3,4] => 0010 => 0 = 1 - 1
[1,2,5,4,3] => 0011 => 0 = 1 - 1
[1,3,2,4,5] => 0100 => 0 = 1 - 1
[1,3,2,5,4] => 0101 => 0 = 1 - 1
[1,3,4,2,5] => 0010 => 0 = 1 - 1
[1,3,4,5,2] => 0001 => 0 = 1 - 1
[1,3,5,2,4] => 0010 => 0 = 1 - 1
[1,3,5,4,2] => 0011 => 0 = 1 - 1
[1,4,2,3,5] => 0100 => 0 = 1 - 1
[1,4,2,5,3] => 0101 => 0 = 1 - 1
[1,4,3,2,5] => 0110 => 0 = 1 - 1
[1,4,3,5,2] => 0101 => 0 = 1 - 1
[1,4,5,2,3] => 0010 => 0 = 1 - 1
[1,4,5,3,2] => 0011 => 0 = 1 - 1
Description
The number of leading ones in a binary word.
Matching statistic: St000326
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00109: Permutations —descent word⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00109: Permutations —descent word⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => 1 => 1
[2,1] => [1,2] => 0 => 2
[1,2,3] => [3,2,1] => 11 => 1
[1,3,2] => [3,1,2] => 10 => 1
[2,1,3] => [2,3,1] => 01 => 2
[2,3,1] => [2,1,3] => 10 => 1
[3,1,2] => [1,3,2] => 01 => 2
[3,2,1] => [1,2,3] => 00 => 3
[1,2,3,4] => [4,3,2,1] => 111 => 1
[1,2,4,3] => [4,3,1,2] => 110 => 1
[1,3,2,4] => [4,2,3,1] => 101 => 1
[1,3,4,2] => [4,2,1,3] => 110 => 1
[1,4,2,3] => [4,1,3,2] => 101 => 1
[1,4,3,2] => [4,1,2,3] => 100 => 1
[2,1,3,4] => [3,4,2,1] => 011 => 2
[2,1,4,3] => [3,4,1,2] => 010 => 2
[2,3,1,4] => [3,2,4,1] => 101 => 1
[2,3,4,1] => [3,2,1,4] => 110 => 1
[2,4,1,3] => [3,1,4,2] => 101 => 1
[2,4,3,1] => [3,1,2,4] => 100 => 1
[3,1,2,4] => [2,4,3,1] => 011 => 2
[3,1,4,2] => [2,4,1,3] => 010 => 2
[3,2,1,4] => [2,3,4,1] => 001 => 3
[3,2,4,1] => [2,3,1,4] => 010 => 2
[3,4,1,2] => [2,1,4,3] => 101 => 1
[3,4,2,1] => [2,1,3,4] => 100 => 1
[4,1,2,3] => [1,4,3,2] => 011 => 2
[4,1,3,2] => [1,4,2,3] => 010 => 2
[4,2,1,3] => [1,3,4,2] => 001 => 3
[4,2,3,1] => [1,3,2,4] => 010 => 2
[4,3,1,2] => [1,2,4,3] => 001 => 3
[4,3,2,1] => [1,2,3,4] => 000 => 4
[1,2,3,4,5] => [5,4,3,2,1] => 1111 => 1
[1,2,3,5,4] => [5,4,3,1,2] => 1110 => 1
[1,2,4,3,5] => [5,4,2,3,1] => 1101 => 1
[1,2,4,5,3] => [5,4,2,1,3] => 1110 => 1
[1,2,5,3,4] => [5,4,1,3,2] => 1101 => 1
[1,2,5,4,3] => [5,4,1,2,3] => 1100 => 1
[1,3,2,4,5] => [5,3,4,2,1] => 1011 => 1
[1,3,2,5,4] => [5,3,4,1,2] => 1010 => 1
[1,3,4,2,5] => [5,3,2,4,1] => 1101 => 1
[1,3,4,5,2] => [5,3,2,1,4] => 1110 => 1
[1,3,5,2,4] => [5,3,1,4,2] => 1101 => 1
[1,3,5,4,2] => [5,3,1,2,4] => 1100 => 1
[1,4,2,3,5] => [5,2,4,3,1] => 1011 => 1
[1,4,2,5,3] => [5,2,4,1,3] => 1010 => 1
[1,4,3,2,5] => [5,2,3,4,1] => 1001 => 1
[1,4,3,5,2] => [5,2,3,1,4] => 1010 => 1
[1,4,5,2,3] => [5,2,1,4,3] => 1101 => 1
[1,4,5,3,2] => [5,2,1,3,4] => 1100 => 1
Description
The position of the first one in a binary word after appending a 1 at the end.
Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.
Matching statistic: St000363
(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
St000363: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00184: Integer compositions —to threshold graph⟶ Graphs
St000363: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => ([],2)
=> 1
[2,1] => [1,1] => ([(0,1)],2)
=> 2
[1,2,3] => [3] => ([],3)
=> 1
[1,3,2] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[2,1,3] => [1,2] => ([(1,2)],3)
=> 2
[2,3,1] => [2,1] => ([(0,2),(1,2)],3)
=> 1
[3,1,2] => [1,2] => ([(1,2)],3)
=> 2
[3,2,1] => [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,2,3,4] => [4] => ([],4)
=> 1
[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)
=> 2
[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)
=> 2
[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)
=> 3
[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)
=> 2
[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)
=> 3
[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)
=> 3
[4,3,2,1] => [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,2,3,4,5] => [5] => ([],5)
=> 1
[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)
=> 1
[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)
=> 1
[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)
=> 1
[1,4,5,2,3] => [3,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,4,5,3,2] => [3,1,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
Description
The number of minimal vertex covers of a graph.
A '''vertex cover''' of a graph $G$ is a subset $S$ of the vertices of $G$ such that each edge of $G$ contains at least one vertex of $S$. A vertex cover is minimal if it contains the least possible number of vertices.
This is also the leading coefficient of the clique polynomial of the complement of $G$.
This is also the number of independent sets of maximal cardinality of $G$.
Matching statistic: St000382
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,1] => 1
[2,1] => [1,2] => [2] => 2
[1,2,3] => [3,2,1] => [1,1,1] => 1
[1,3,2] => [3,1,2] => [1,2] => 1
[2,1,3] => [2,3,1] => [2,1] => 2
[2,3,1] => [2,1,3] => [1,2] => 1
[3,1,2] => [1,3,2] => [2,1] => 2
[3,2,1] => [1,2,3] => [3] => 3
[1,2,3,4] => [4,3,2,1] => [1,1,1,1] => 1
[1,2,4,3] => [4,3,1,2] => [1,1,2] => 1
[1,3,2,4] => [4,2,3,1] => [1,2,1] => 1
[1,3,4,2] => [4,2,1,3] => [1,1,2] => 1
[1,4,2,3] => [4,1,3,2] => [1,2,1] => 1
[1,4,3,2] => [4,1,2,3] => [1,3] => 1
[2,1,3,4] => [3,4,2,1] => [2,1,1] => 2
[2,1,4,3] => [3,4,1,2] => [2,2] => 2
[2,3,1,4] => [3,2,4,1] => [1,2,1] => 1
[2,3,4,1] => [3,2,1,4] => [1,1,2] => 1
[2,4,1,3] => [3,1,4,2] => [1,2,1] => 1
[2,4,3,1] => [3,1,2,4] => [1,3] => 1
[3,1,2,4] => [2,4,3,1] => [2,1,1] => 2
[3,1,4,2] => [2,4,1,3] => [2,2] => 2
[3,2,1,4] => [2,3,4,1] => [3,1] => 3
[3,2,4,1] => [2,3,1,4] => [2,2] => 2
[3,4,1,2] => [2,1,4,3] => [1,2,1] => 1
[3,4,2,1] => [2,1,3,4] => [1,3] => 1
[4,1,2,3] => [1,4,3,2] => [2,1,1] => 2
[4,1,3,2] => [1,4,2,3] => [2,2] => 2
[4,2,1,3] => [1,3,4,2] => [3,1] => 3
[4,2,3,1] => [1,3,2,4] => [2,2] => 2
[4,3,1,2] => [1,2,4,3] => [3,1] => 3
[4,3,2,1] => [1,2,3,4] => [4] => 4
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1] => 1
[1,2,3,5,4] => [5,4,3,1,2] => [1,1,1,2] => 1
[1,2,4,3,5] => [5,4,2,3,1] => [1,1,2,1] => 1
[1,2,4,5,3] => [5,4,2,1,3] => [1,1,1,2] => 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,1,2,1] => 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,1,3] => 1
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,1,1] => 1
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,2] => 1
[1,3,4,2,5] => [5,3,2,4,1] => [1,1,2,1] => 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,1,1,2] => 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,1,2,1] => 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,1,3] => 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,1,1] => 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,2,2] => 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,3,1] => 1
[1,4,3,5,2] => [5,2,3,1,4] => [1,2,2] => 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,1,2,1] => 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,1,3] => 1
Description
The first part of an integer composition.
Matching statistic: St000383
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00064: Permutations —reverse⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,1] => 1
[2,1] => [1,2] => [2] => 2
[1,2,3] => [3,2,1] => [1,1,1] => 1
[1,3,2] => [2,3,1] => [2,1] => 1
[2,1,3] => [3,1,2] => [1,2] => 2
[2,3,1] => [1,3,2] => [2,1] => 1
[3,1,2] => [2,1,3] => [1,2] => 2
[3,2,1] => [1,2,3] => [3] => 3
[1,2,3,4] => [4,3,2,1] => [1,1,1,1] => 1
[1,2,4,3] => [3,4,2,1] => [2,1,1] => 1
[1,3,2,4] => [4,2,3,1] => [1,2,1] => 1
[1,3,4,2] => [2,4,3,1] => [2,1,1] => 1
[1,4,2,3] => [3,2,4,1] => [1,2,1] => 1
[1,4,3,2] => [2,3,4,1] => [3,1] => 1
[2,1,3,4] => [4,3,1,2] => [1,1,2] => 2
[2,1,4,3] => [3,4,1,2] => [2,2] => 2
[2,3,1,4] => [4,1,3,2] => [1,2,1] => 1
[2,3,4,1] => [1,4,3,2] => [2,1,1] => 1
[2,4,1,3] => [3,1,4,2] => [1,2,1] => 1
[2,4,3,1] => [1,3,4,2] => [3,1] => 1
[3,1,2,4] => [4,2,1,3] => [1,1,2] => 2
[3,1,4,2] => [2,4,1,3] => [2,2] => 2
[3,2,1,4] => [4,1,2,3] => [1,3] => 3
[3,2,4,1] => [1,4,2,3] => [2,2] => 2
[3,4,1,2] => [2,1,4,3] => [1,2,1] => 1
[3,4,2,1] => [1,2,4,3] => [3,1] => 1
[4,1,2,3] => [3,2,1,4] => [1,1,2] => 2
[4,1,3,2] => [2,3,1,4] => [2,2] => 2
[4,2,1,3] => [3,1,2,4] => [1,3] => 3
[4,2,3,1] => [1,3,2,4] => [2,2] => 2
[4,3,1,2] => [2,1,3,4] => [1,3] => 3
[4,3,2,1] => [1,2,3,4] => [4] => 4
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1] => 1
[1,2,3,5,4] => [4,5,3,2,1] => [2,1,1,1] => 1
[1,2,4,3,5] => [5,3,4,2,1] => [1,2,1,1] => 1
[1,2,4,5,3] => [3,5,4,2,1] => [2,1,1,1] => 1
[1,2,5,3,4] => [4,3,5,2,1] => [1,2,1,1] => 1
[1,2,5,4,3] => [3,4,5,2,1] => [3,1,1] => 1
[1,3,2,4,5] => [5,4,2,3,1] => [1,1,2,1] => 1
[1,3,2,5,4] => [4,5,2,3,1] => [2,2,1] => 1
[1,3,4,2,5] => [5,2,4,3,1] => [1,2,1,1] => 1
[1,3,4,5,2] => [2,5,4,3,1] => [2,1,1,1] => 1
[1,3,5,2,4] => [4,2,5,3,1] => [1,2,1,1] => 1
[1,3,5,4,2] => [2,4,5,3,1] => [3,1,1] => 1
[1,4,2,3,5] => [5,3,2,4,1] => [1,1,2,1] => 1
[1,4,2,5,3] => [3,5,2,4,1] => [2,2,1] => 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,3,1] => 1
[1,4,3,5,2] => [2,5,3,4,1] => [2,2,1] => 1
[1,4,5,2,3] => [3,2,5,4,1] => [1,2,1,1] => 1
[1,4,5,3,2] => [2,3,5,4,1] => [3,1,1] => 1
Description
The last part of an integer composition.
Matching statistic: St000025
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[2,1] => [1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 2
[1,2,3] => [3,2,1] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[1,3,2] => [3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 1
[2,1,3] => [2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 2
[2,3,1] => [2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
[3,1,2] => [1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,2,3,4] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,2,4,3] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,3,2,4] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,3,4,2] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,4,2,3] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,4,3,2] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 1
[2,1,3,4] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[2,1,4,3] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[2,3,1,4] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,3,4,1] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[2,4,3,1] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[3,1,2,4] => [2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,1,4,2] => [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2
[3,2,1,4] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[3,2,4,1] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[3,4,1,2] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[3,4,2,1] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[4,1,2,3] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[4,1,3,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[4,2,1,3] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[4,2,3,1] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
[4,3,1,2] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 3
[4,3,2,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,3,5,4] => [5,4,3,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,4,3,5] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,4,5,3] => [5,4,2,1,3] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,3,2,4,5] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,3,2,5,4] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,3,4,2,5] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,4,3,5,2] => [5,2,3,1,4] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1
Description
The number of initial rises of a Dyck path.
In other words, this is the height of the first peak of $D$.
Matching statistic: St000026
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00069: Permutations —complement⟶ Permutations
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2,1] => [1,1] => [1,0,1,0]
=> 1
[2,1] => [1,2] => [2] => [1,1,0,0]
=> 2
[1,2,3] => [3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,3,2] => [3,1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[2,1,3] => [2,3,1] => [2,1] => [1,1,0,0,1,0]
=> 2
[2,3,1] => [2,1,3] => [1,2] => [1,0,1,1,0,0]
=> 1
[3,1,2] => [1,3,2] => [2,1] => [1,1,0,0,1,0]
=> 2
[3,2,1] => [1,2,3] => [3] => [1,1,1,0,0,0]
=> 3
[1,2,3,4] => [4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,4,3] => [4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,3,2,4] => [4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,3,4,2] => [4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,4,2,3] => [4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,4,3,2] => [4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,3,4] => [3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,4,3] => [3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[2,3,4,1] => [3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[2,4,1,3] => [3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[2,4,3,1] => [3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[3,1,2,4] => [2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[3,1,4,2] => [2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,2,1,4] => [2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[3,2,4,1] => [2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[3,4,1,2] => [2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[3,4,2,1] => [2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[4,1,2,3] => [1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[4,1,3,2] => [1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[4,2,1,3] => [1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[4,2,3,1] => [1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[4,3,1,2] => [1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[4,3,2,1] => [1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> 4
[1,2,3,4,5] => [5,4,3,2,1] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,3,5,4] => [5,4,3,1,2] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,2,4,3,5] => [5,4,2,3,1] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,2,4,5,3] => [5,4,2,1,3] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,2,5,3,4] => [5,4,1,3,2] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,2,5,4,3] => [5,4,1,2,3] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,3,2,4,5] => [5,3,4,2,1] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,3,2,5,4] => [5,3,4,1,2] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2,5] => [5,3,2,4,1] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,3,4,5,2] => [5,3,2,1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,3,5,2,4] => [5,3,1,4,2] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,3,5,4,2] => [5,3,1,2,4] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,4,2,3,5] => [5,2,4,3,1] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,4,2,5,3] => [5,2,4,1,3] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,4,3,2,5] => [5,2,3,4,1] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,4,3,5,2] => [5,2,3,1,4] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,4,5,2,3] => [5,2,1,4,3] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,4,5,3,2] => [5,2,1,3,4] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
Description
The position of the first return of a Dyck path.
Matching statistic: St000501
Mp00071: Permutations —descent composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000501: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000501: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,2] => [2] => [1,1,0,0]
=> [1,2] => 1
[2,1] => [1,1] => [1,0,1,0]
=> [2,1] => 2
[1,2,3] => [3] => [1,1,1,0,0,0]
=> [1,2,3] => 1
[1,3,2] => [2,1] => [1,1,0,0,1,0]
=> [1,3,2] => 1
[2,1,3] => [1,2] => [1,0,1,1,0,0]
=> [2,1,3] => 2
[2,3,1] => [2,1] => [1,1,0,0,1,0]
=> [1,3,2] => 1
[3,1,2] => [1,2] => [1,0,1,1,0,0]
=> [2,1,3] => 2
[3,2,1] => [1,1,1] => [1,0,1,0,1,0]
=> [2,3,1] => 3
[1,2,3,4] => [4] => [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 1
[1,2,4,3] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1
[1,3,2,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
[1,3,4,2] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1
[1,4,2,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
[1,4,3,2] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1
[2,1,3,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 2
[2,1,4,3] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
[2,3,1,4] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
[2,3,4,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1
[2,4,1,3] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
[2,4,3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1
[3,1,2,4] => [1,3] => [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 2
[3,1,4,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
[3,2,1,4] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 3
[3,2,4,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
[3,4,1,2] => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
[3,4,2,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1
[4,1,2,3] => [1,3] => [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 2
[4,1,3,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
[4,2,1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 3
[4,2,3,1] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
[4,3,1,2] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 3
[4,3,2,1] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 4
[1,2,3,4,5] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 1
[1,2,3,5,4] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => 1
[1,2,4,3,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
[1,2,4,5,3] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => 1
[1,2,5,3,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
[1,2,5,4,3] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 1
[1,3,2,4,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => 1
[1,3,2,5,4] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => 1
[1,3,4,2,5] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
[1,3,4,5,2] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => 1
[1,3,5,2,4] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
[1,3,5,4,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 1
[1,4,2,3,5] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => 1
[1,4,2,5,3] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => 1
[1,4,3,2,5] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => 1
[1,4,3,5,2] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => 1
[1,4,5,2,3] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
[1,4,5,3,2] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 1
Description
The size of the first part in the decomposition of a permutation.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is defined to be the smallest $k > 0$ such that $\{\pi(1),\ldots,\pi(k)\} = \{1,\ldots,k\}$. This statistic is undefined for the empty permutation.
For the number of parts in the decomposition see [[St000056]].
The following 47 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000542The number of left-to-right-minima of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St000759The smallest missing part in an integer partition. St001050The number of terminal closers of a set partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001316The domatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St000439The position of the first down step of a Dyck path. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000989The number of final rises of a permutation. St000273The domination number of a graph. St000544The cop number of a graph. St000916The packing number of a graph. St001829The common independence number of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St000617The number of global maxima of a Dyck path. St000234The number of global ascents of a permutation. St000667The greatest common divisor of the parts of the partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001571The Cartan determinant of the integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000668The least common multiple of the parts of the partition. St000770The major index of an integer partition when read from bottom to top. St000546The number of global descents of a permutation. St000054The first entry of the permutation. St000654The first descent of a permutation. St000056The decomposition (or block) number of a permutation. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001481The minimal height of a peak of a Dyck path. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. 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. St000260The radius of a connected graph. St000259The diameter of a connected graph. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St000454The largest eigenvalue of a graph if it is integral.
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!