searching the database
Your data matches 25 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: St000501
(load all 1230 compositions to match this statistic)
(load all 1230 compositions to match this statistic)
St000501: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => 1
[1,2] => 1
[2,1] => 2
[1,2,3] => 1
[1,3,2] => 1
[2,1,3] => 2
[2,3,1] => 3
[3,1,2] => 3
[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] => 3
[2,3,4,1] => 4
[2,4,1,3] => 4
[2,4,3,1] => 4
[3,1,2,4] => 3
[3,1,4,2] => 4
[3,2,1,4] => 3
[3,2,4,1] => 4
[3,4,1,2] => 4
[3,4,2,1] => 4
[4,1,2,3] => 4
[4,1,3,2] => 4
[4,2,1,3] => 4
[4,2,3,1] => 4
[4,3,1,2] => 4
[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
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]].
Matching statistic: St000026
(load all 109 compositions to match this statistic)
(load all 109 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000026: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> 1
[1,2] => [1,0,1,0]
=> 1
[2,1] => [1,1,0,0]
=> 2
[1,2,3] => [1,0,1,0,1,0]
=> 1
[1,3,2] => [1,0,1,1,0,0]
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> 2
[2,3,1] => [1,1,0,1,0,0]
=> 3
[3,1,2] => [1,1,1,0,0,0]
=> 3
[3,2,1] => [1,1,1,0,0,0]
=> 3
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 1
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 3
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 4
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 4
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> 4
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 3
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 4
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 3
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 4
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 4
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 4
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 4
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 4
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 4
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 4
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 4
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 4
[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 1
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> 1
Description
The position of the first return of a Dyck path.
Matching statistic: St000382
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1] => 1
[1,2] => [1,0,1,0]
=> [1,1] => 1
[2,1] => [1,1,0,0]
=> [2] => 2
[1,2,3] => [1,0,1,0,1,0]
=> [1,1,1] => 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,2] => 1
[2,1,3] => [1,1,0,0,1,0]
=> [2,1] => 2
[2,3,1] => [1,1,0,1,0,0]
=> [3] => 3
[3,1,2] => [1,1,1,0,0,0]
=> [3] => 3
[3,2,1] => [1,1,1,0,0,0]
=> [3] => 3
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,2] => 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,3] => 1
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,3] => 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,3] => 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [2,1,1] => 2
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,2] => 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [3,1] => 3
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [4] => 4
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [4] => 4
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [4] => 4
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3,1] => 3
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [4] => 4
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [3,1] => 3
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [4] => 4
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [4] => 4
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [4] => 4
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [4] => 4
[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => 1
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 1
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,4] => 1
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 1
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 1
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 1
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 1
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,4] => 1
Description
The first part of an integer composition.
Matching statistic: St000505
(load all 13 compositions to match this statistic)
(load all 13 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> {{1}}
=> 1
[1,2] => [1,0,1,0]
=> {{1},{2}}
=> 1
[2,1] => [1,1,0,0]
=> {{1,2}}
=> 2
[1,2,3] => [1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 1
[1,3,2] => [1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1
[2,1,3] => [1,1,0,0,1,0]
=> {{1,2},{3}}
=> 2
[2,3,1] => [1,1,0,1,0,0]
=> {{1,3},{2}}
=> 3
[3,1,2] => [1,1,1,0,0,0]
=> {{1,2,3}}
=> 3
[3,2,1] => [1,1,1,0,0,0]
=> {{1,2,3}}
=> 3
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 2
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 3
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 4
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 4
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 4
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 3
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 4
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 3
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 4
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 4
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 4
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 1
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 1
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
Description
The biggest entry in the block containing the 1.
Matching statistic: St000025
Mp00114: Permutations —connectivity set⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => => [1] => [1,0]
=> 1
[1,2] => 1 => [1,1] => [1,0,1,0]
=> 1
[2,1] => 0 => [2] => [1,1,0,0]
=> 2
[1,2,3] => 11 => [1,1,1] => [1,0,1,0,1,0]
=> 1
[1,3,2] => 10 => [1,2] => [1,0,1,1,0,0]
=> 1
[2,1,3] => 01 => [2,1] => [1,1,0,0,1,0]
=> 2
[2,3,1] => 00 => [3] => [1,1,1,0,0,0]
=> 3
[3,1,2] => 00 => [3] => [1,1,1,0,0,0]
=> 3
[3,2,1] => 00 => [3] => [1,1,1,0,0,0]
=> 3
[1,2,3,4] => 111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 1
[1,2,4,3] => 110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 1
[1,3,2,4] => 101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,3,4,2] => 100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,4,2,3] => 100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,4,3,2] => 100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[2,1,3,4] => 011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 2
[2,1,4,3] => 010 => [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[2,3,1,4] => 001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[2,3,4,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[2,4,1,3] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[2,4,3,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[3,1,2,4] => 001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[3,1,4,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[3,2,1,4] => 001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 3
[3,2,4,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[3,4,1,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[3,4,2,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[4,1,2,3] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[4,1,3,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[4,2,1,3] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[4,2,3,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[4,3,1,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[4,3,2,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 4
[1,2,3,4,5] => 1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,2,3,5,4] => 1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,2,4,3,5] => 1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,2,4,5,3] => 1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,2,5,3,4] => 1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,2,5,4,3] => 1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,3,2,4,5] => 1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,3,2,5,4] => 1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,3,4,2,5] => 1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,3,4,5,2] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,3,5,2,4] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,3,5,4,2] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,4,2,3,5] => 1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,4,2,5,3] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,4,3,2,5] => 1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,4,3,5,2] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,4,5,2,3] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,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: St000383
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
Mp00028: Dyck paths —reverse⟶ Dyck paths
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00028: Dyck paths —reverse⟶ Dyck paths
Mp00100: Dyck paths —touch composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => [1,0]
=> [1,0]
=> [1] => 1
[1,2] => [1,0,1,0]
=> [1,0,1,0]
=> [1,1] => 1
[2,1] => [1,1,0,0]
=> [1,1,0,0]
=> [2] => 2
[1,2,3] => [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => 1
[1,3,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => 1
[2,1,3] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,2] => 2
[2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [3] => 3
[3,1,2] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => 3
[3,2,1] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => 3
[1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => 1
[1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1
[1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1] => 1
[1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 1
[1,4,3,2] => [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 1
[2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => 2
[2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 2
[2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3] => 3
[2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [4] => 4
[2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [4] => 4
[2,4,3,1] => [1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [4] => 4
[3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 3
[3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4] => 4
[3,2,1,4] => [1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 3
[3,2,4,1] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4] => 4
[3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4] => 4
[3,4,2,1] => [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4] => 4
[4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,1,3,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,2,1,3] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,2,3,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,3,1,2] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[4,3,2,1] => [1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1
[1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1
[1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => 1
[1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 1
[1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 1
[1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1
[1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 1
[1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 1
[1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,1] => 1
[1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,1] => 1
[1,3,5,4,2] => [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,1] => 1
[1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,4,2,5,3] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 1
[1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,4,3,5,2] => [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 1
[1,4,5,2,3] => [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1] => 1
Description
The last part of an integer composition.
Matching statistic: St000439
Mp00114: Permutations —connectivity set⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => => [1] => [1,0]
=> 2 = 1 + 1
[1,2] => 1 => [1,1] => [1,0,1,0]
=> 2 = 1 + 1
[2,1] => 0 => [2] => [1,1,0,0]
=> 3 = 2 + 1
[1,2,3] => 11 => [1,1,1] => [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,3,2] => 10 => [1,2] => [1,0,1,1,0,0]
=> 2 = 1 + 1
[2,1,3] => 01 => [2,1] => [1,1,0,0,1,0]
=> 3 = 2 + 1
[2,3,1] => 00 => [3] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[3,1,2] => 00 => [3] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[3,2,1] => 00 => [3] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,2,3,4] => 111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,4,3] => 110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,3,2,4] => 101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,2] => 100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,2,3] => 100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,4,3,2] => 100 => [1,3] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[2,1,3,4] => 011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[2,1,4,3] => 010 => [2,2] => [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[2,3,1,4] => 001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[2,3,4,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[2,4,1,3] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[2,4,3,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[3,1,2,4] => 001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[3,1,4,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[3,2,1,4] => 001 => [3,1] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[3,2,4,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[3,4,1,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[3,4,2,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[4,1,2,3] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[4,1,3,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[4,2,1,3] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[4,2,3,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[4,3,1,2] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[4,3,2,1] => 000 => [4] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,2,3,4,5] => 1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,2,3,5,4] => 1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,2,4,3,5] => 1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,2,4,5,3] => 1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,2,5,3,4] => 1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,2,5,4,3] => 1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,3,2,4,5] => 1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,3,2,5,4] => 1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,3,4,2,5] => 1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,3,4,5,2] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,3,5,2,4] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,3,5,4,2] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,4,2,3,5] => 1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,4,2,5,3] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,4,3,2,5] => 1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,4,3,5,2] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,4,5,2,3] => 1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
Description
The position of the first down step of a Dyck path.
Matching statistic: St000326
Mp00114: Permutations —connectivity set⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => => ? = 1
[1,2] => 1 => 1
[2,1] => 0 => 2
[1,2,3] => 11 => 1
[1,3,2] => 10 => 1
[2,1,3] => 01 => 2
[2,3,1] => 00 => 3
[3,1,2] => 00 => 3
[3,2,1] => 00 => 3
[1,2,3,4] => 111 => 1
[1,2,4,3] => 110 => 1
[1,3,2,4] => 101 => 1
[1,3,4,2] => 100 => 1
[1,4,2,3] => 100 => 1
[1,4,3,2] => 100 => 1
[2,1,3,4] => 011 => 2
[2,1,4,3] => 010 => 2
[2,3,1,4] => 001 => 3
[2,3,4,1] => 000 => 4
[2,4,1,3] => 000 => 4
[2,4,3,1] => 000 => 4
[3,1,2,4] => 001 => 3
[3,1,4,2] => 000 => 4
[3,2,1,4] => 001 => 3
[3,2,4,1] => 000 => 4
[3,4,1,2] => 000 => 4
[3,4,2,1] => 000 => 4
[4,1,2,3] => 000 => 4
[4,1,3,2] => 000 => 4
[4,2,1,3] => 000 => 4
[4,2,3,1] => 000 => 4
[4,3,1,2] => 000 => 4
[4,3,2,1] => 000 => 4
[1,2,3,4,5] => 1111 => 1
[1,2,3,5,4] => 1110 => 1
[1,2,4,3,5] => 1101 => 1
[1,2,4,5,3] => 1100 => 1
[1,2,5,3,4] => 1100 => 1
[1,2,5,4,3] => 1100 => 1
[1,3,2,4,5] => 1011 => 1
[1,3,2,5,4] => 1010 => 1
[1,3,4,2,5] => 1001 => 1
[1,3,4,5,2] => 1000 => 1
[1,3,5,2,4] => 1000 => 1
[1,3,5,4,2] => 1000 => 1
[1,4,2,3,5] => 1001 => 1
[1,4,2,5,3] => 1000 => 1
[1,4,3,2,5] => 1001 => 1
[1,4,3,5,2] => 1000 => 1
[1,4,5,2,3] => 1000 => 1
[1,4,5,3,2] => 1000 => 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: St000297
Mp00114: Permutations —connectivity set⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00105: Binary words —complement⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1] => => => ? = 1 - 1
[1,2] => 1 => 0 => 0 = 1 - 1
[2,1] => 0 => 1 => 1 = 2 - 1
[1,2,3] => 11 => 00 => 0 = 1 - 1
[1,3,2] => 10 => 01 => 0 = 1 - 1
[2,1,3] => 01 => 10 => 1 = 2 - 1
[2,3,1] => 00 => 11 => 2 = 3 - 1
[3,1,2] => 00 => 11 => 2 = 3 - 1
[3,2,1] => 00 => 11 => 2 = 3 - 1
[1,2,3,4] => 111 => 000 => 0 = 1 - 1
[1,2,4,3] => 110 => 001 => 0 = 1 - 1
[1,3,2,4] => 101 => 010 => 0 = 1 - 1
[1,3,4,2] => 100 => 011 => 0 = 1 - 1
[1,4,2,3] => 100 => 011 => 0 = 1 - 1
[1,4,3,2] => 100 => 011 => 0 = 1 - 1
[2,1,3,4] => 011 => 100 => 1 = 2 - 1
[2,1,4,3] => 010 => 101 => 1 = 2 - 1
[2,3,1,4] => 001 => 110 => 2 = 3 - 1
[2,3,4,1] => 000 => 111 => 3 = 4 - 1
[2,4,1,3] => 000 => 111 => 3 = 4 - 1
[2,4,3,1] => 000 => 111 => 3 = 4 - 1
[3,1,2,4] => 001 => 110 => 2 = 3 - 1
[3,1,4,2] => 000 => 111 => 3 = 4 - 1
[3,2,1,4] => 001 => 110 => 2 = 3 - 1
[3,2,4,1] => 000 => 111 => 3 = 4 - 1
[3,4,1,2] => 000 => 111 => 3 = 4 - 1
[3,4,2,1] => 000 => 111 => 3 = 4 - 1
[4,1,2,3] => 000 => 111 => 3 = 4 - 1
[4,1,3,2] => 000 => 111 => 3 = 4 - 1
[4,2,1,3] => 000 => 111 => 3 = 4 - 1
[4,2,3,1] => 000 => 111 => 3 = 4 - 1
[4,3,1,2] => 000 => 111 => 3 = 4 - 1
[4,3,2,1] => 000 => 111 => 3 = 4 - 1
[1,2,3,4,5] => 1111 => 0000 => 0 = 1 - 1
[1,2,3,5,4] => 1110 => 0001 => 0 = 1 - 1
[1,2,4,3,5] => 1101 => 0010 => 0 = 1 - 1
[1,2,4,5,3] => 1100 => 0011 => 0 = 1 - 1
[1,2,5,3,4] => 1100 => 0011 => 0 = 1 - 1
[1,2,5,4,3] => 1100 => 0011 => 0 = 1 - 1
[1,3,2,4,5] => 1011 => 0100 => 0 = 1 - 1
[1,3,2,5,4] => 1010 => 0101 => 0 = 1 - 1
[1,3,4,2,5] => 1001 => 0110 => 0 = 1 - 1
[1,3,4,5,2] => 1000 => 0111 => 0 = 1 - 1
[1,3,5,2,4] => 1000 => 0111 => 0 = 1 - 1
[1,3,5,4,2] => 1000 => 0111 => 0 = 1 - 1
[1,4,2,3,5] => 1001 => 0110 => 0 = 1 - 1
[1,4,2,5,3] => 1000 => 0111 => 0 = 1 - 1
[1,4,3,2,5] => 1001 => 0110 => 0 = 1 - 1
[1,4,3,5,2] => 1000 => 0111 => 0 = 1 - 1
[1,4,5,2,3] => 1000 => 0111 => 0 = 1 - 1
[1,4,5,3,2] => 1000 => 0111 => 0 = 1 - 1
Description
The number of leading ones in a binary word.
Matching statistic: St000542
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
St000542: Permutations ⟶ ℤResult quality: 86% ●values known / values provided: 86%●distinct values known / distinct values provided: 100%
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
St000542: Permutations ⟶ ℤResult quality: 86% ●values known / values provided: 86%●distinct values known / distinct values provided: 100%
Values
[1] => [1] => [1] => [1] => 1
[1,2] => [1,2] => [1,2] => [1,2] => 1
[2,1] => [2,1] => [2,1] => [2,1] => 2
[1,2,3] => [1,2,3] => [1,2,3] => [1,2,3] => 1
[1,3,2] => [1,3,2] => [1,3,2] => [1,3,2] => 1
[2,1,3] => [2,1,3] => [2,1,3] => [2,1,3] => 2
[2,3,1] => [3,2,1] => [3,2,1] => [3,2,1] => 3
[3,1,2] => [3,2,1] => [3,2,1] => [3,2,1] => 3
[3,2,1] => [3,2,1] => [3,2,1] => [3,2,1] => 3
[1,2,3,4] => [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 1
[1,2,4,3] => [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,3,2,4] => [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,3,4,2] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 1
[1,4,2,3] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 1
[1,4,3,2] => [1,4,3,2] => [1,4,3,2] => [1,4,3,2] => 1
[2,1,3,4] => [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 2
[2,1,4,3] => [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[2,3,1,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 3
[2,3,4,1] => [4,2,3,1] => [4,3,2,1] => [4,3,2,1] => 4
[2,4,1,3] => [3,4,1,2] => [4,3,2,1] => [4,3,2,1] => 4
[2,4,3,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[3,1,2,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 3
[3,1,4,2] => [4,2,3,1] => [4,3,2,1] => [4,3,2,1] => 4
[3,2,1,4] => [3,2,1,4] => [3,2,1,4] => [3,2,1,4] => 3
[3,2,4,1] => [4,2,3,1] => [4,3,2,1] => [4,3,2,1] => 4
[3,4,1,2] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[3,4,2,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[4,1,2,3] => [4,2,3,1] => [4,3,2,1] => [4,3,2,1] => 4
[4,1,3,2] => [4,2,3,1] => [4,3,2,1] => [4,3,2,1] => 4
[4,2,1,3] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[4,2,3,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[4,3,1,2] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[4,3,2,1] => [4,3,2,1] => [4,3,2,1] => [4,3,2,1] => 4
[1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 1
[1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => [1,2,3,5,4] => 1
[1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => [1,2,4,3,5] => 1
[1,2,4,5,3] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,2,5,3,4] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => [1,2,5,4,3] => 1
[1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 1
[1,3,4,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,3,4,5,2] => [1,5,3,4,2] => [1,5,4,3,2] => [1,5,4,3,2] => 1
[1,3,5,2,4] => [1,4,5,2,3] => [1,5,4,3,2] => [1,5,4,3,2] => 1
[1,3,5,4,2] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 1
[1,4,2,3,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,4,2,5,3] => [1,5,3,4,2] => [1,5,4,3,2] => [1,5,4,3,2] => 1
[1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 1
[1,4,3,5,2] => [1,5,3,4,2] => [1,5,4,3,2] => [1,5,4,3,2] => 1
[1,4,5,2,3] => [1,5,4,3,2] => [1,5,4,3,2] => [1,5,4,3,2] => 1
[1,3,4,5,2,6,7] => [1,5,3,4,2,6,7] => [1,5,4,3,2,6,7] => [1,5,4,3,2,6,7] => ? = 1
[1,3,4,5,2,7,6] => [1,5,3,4,2,7,6] => [1,5,4,3,2,7,6] => [1,5,4,3,2,7,6] => ? = 1
[1,3,4,5,6,2,7] => [1,6,3,4,5,2,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,4,5,6,7,2] => [1,7,3,4,5,6,2] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,5,7,2,6] => [1,6,3,4,7,2,5] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,5,7,6,2] => [1,7,3,4,6,5,2] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,6,2,5,7] => [1,5,3,6,2,4,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,4,6,2,7,5] => [1,5,3,7,2,6,4] => [1,7,5,6,3,4,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,6,5,2,7] => [1,6,3,5,4,2,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,4,6,5,7,2] => [1,7,3,5,4,6,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,6,7,2,5] => [1,6,3,7,5,2,4] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,6,7,5,2] => [1,7,3,6,5,4,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,7,2,5,6] => [1,5,3,7,2,6,4] => [1,7,5,6,3,4,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,7,2,6,5] => [1,5,3,7,2,6,4] => [1,7,5,6,3,4,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,7,5,2,6] => [1,6,3,7,5,2,4] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,7,5,6,2] => [1,7,3,6,5,4,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,7,6,2,5] => [1,6,3,7,5,2,4] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,4,7,6,5,2] => [1,7,3,6,5,4,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,2,4,6,7] => [1,4,5,2,3,6,7] => [1,5,4,3,2,6,7] => [1,5,4,3,2,6,7] => ? = 1
[1,3,5,2,4,7,6] => [1,4,5,2,3,7,6] => [1,5,4,3,2,7,6] => [1,5,4,3,2,7,6] => ? = 1
[1,3,5,2,6,4,7] => [1,4,6,2,5,3,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,5,2,6,7,4] => [1,4,7,2,5,6,3] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,2,7,4,6] => [1,4,6,2,7,3,5] => [1,6,7,4,5,2,3] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,2,7,6,4] => [1,4,7,2,6,5,3] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,4,2,6,7] => [1,5,4,3,2,6,7] => [1,5,4,3,2,6,7] => [1,5,4,3,2,6,7] => ? = 1
[1,3,5,4,2,7,6] => [1,5,4,3,2,7,6] => [1,5,4,3,2,7,6] => [1,5,4,3,2,7,6] => ? = 1
[1,3,5,4,6,2,7] => [1,6,4,3,5,2,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,5,4,6,7,2] => [1,7,4,3,5,6,2] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,4,7,2,6] => [1,6,4,3,7,2,5] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,4,7,6,2] => [1,7,4,3,6,5,2] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,6,2,4,7] => [1,5,6,4,2,3,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,5,6,2,7,4] => [1,5,7,4,2,6,3] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,6,4,2,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,5,6,4,7,2] => [1,7,5,4,3,6,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,6,7,2,4] => [1,6,7,4,5,2,3] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,6,7,4,2] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,7,2,4,6] => [1,5,6,7,2,3,4] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,7,2,6,4] => [1,5,7,6,2,4,3] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,7,4,2,6] => [1,6,5,7,3,2,4] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,7,4,6,2] => [1,7,5,6,3,4,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,7,6,2,4] => [1,6,7,5,4,2,3] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,5,7,6,4,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,6,2,4,5,7] => [1,4,6,2,5,3,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,6,2,4,7,5] => [1,4,7,2,5,6,3] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,6,2,5,4,7] => [1,4,6,2,5,3,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,6,2,5,7,4] => [1,4,7,2,5,6,3] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,6,2,7,4,5] => [1,4,7,2,6,5,3] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,6,2,7,5,4] => [1,4,7,2,6,5,3] => [1,7,6,4,5,3,2] => [1,7,6,5,4,3,2] => ? = 1
[1,3,6,4,2,5,7] => [1,5,6,4,2,3,7] => [1,6,5,4,3,2,7] => [1,6,5,4,3,2,7] => ? = 1
[1,3,6,4,2,7,5] => [1,5,7,4,2,6,3] => [1,7,6,5,4,3,2] => [1,7,6,5,4,3,2] => ? = 1
Description
The number of left-to-right-minima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a left-to-right-minimum if there does not exist a j < i such that $\sigma_j < \sigma_i$.
The following 15 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000990The first ascent of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000054The first entry of the permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000740The last entry of a permutation. St000051The size of the left subtree of a binary tree. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001645The pebbling number of a connected graph. St001330The hat guessing number of a graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000060The greater neighbor of the maximum. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice.
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!