Identifier
-
Mp00229:
Dyck paths
—Delest-Viennot⟶
Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00087: Permutations —inverse first fundamental transformation⟶ Permutations
St000358: Permutations ⟶ ℤ
Values
[1,0] => [1,0] => [1] => [1] => 0
[1,0,1,0] => [1,1,0,0] => [2,1] => [2,1] => 0
[1,1,0,0] => [1,0,1,0] => [1,2] => [1,2] => 0
[1,0,1,0,1,0] => [1,1,0,1,0,0] => [2,3,1] => [3,1,2] => 1
[1,0,1,1,0,0] => [1,1,0,0,1,0] => [2,1,3] => [2,1,3] => 0
[1,1,0,0,1,0] => [1,0,1,1,0,0] => [1,3,2] => [1,3,2] => 0
[1,1,0,1,0,0] => [1,1,1,0,0,0] => [3,2,1] => [2,3,1] => 0
[1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => [4,1,2,3] => 2
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => [3,1,2,4] => 1
[1,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [2,1,4,3] => 0
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [2,4,3,1] => [3,4,1,2] => 1
[1,0,1,1,1,0,0,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,0,1,0] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => [1,4,2,3] => 1
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => [1,3,2,4] => 0
[1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,2,4,1] => [2,4,1,3] => 1
[1,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => [3,2,4,1] => 0
[1,1,0,1,1,0,0,0] => [1,1,1,0,0,0,1,0] => [3,2,1,4] => [2,3,1,4] => 0
[1,1,1,0,0,0,1,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => [1,2,4,3] => 0
[1,1,1,0,0,1,0,0] => [1,0,1,1,1,0,0,0] => [1,4,3,2] => [1,3,4,2] => 0
[1,1,1,0,1,0,0,0] => [1,1,1,0,1,0,0,0] => [4,2,3,1] => [2,3,4,1] => 0
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [5,1,2,3,4] => 3
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [4,1,2,3,5] => 2
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [3,1,2,5,4] => 1
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [4,5,1,2,3] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [3,1,2,4,5] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [2,1,5,3,4] => 1
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [3,5,1,2,4] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [4,3,5,1,2] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [3,4,1,2,5] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [2,1,4,5,3] => 0
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => [3,4,5,1,2] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [2,1,3,4,5] => 0
[1,1,0,0,1,0,1,0,1,0] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [1,5,2,3,4] => 2
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [1,4,2,3,5] => 1
[1,1,0,0,1,1,0,0,1,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,1,0,0,1,1,0,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [1,4,5,2,3] => 1
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [2,5,1,3,4] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [2,4,1,3,5] => 1
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [3,2,5,1,4] => 1
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => [4,2,3,5,1] => 1
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [3,2,4,1,5] => 0
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [2,3,1,5,4] => 0
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [2,4,5,1,3] => 1
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => [3,2,4,5,1] => 0
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [2,3,1,4,5] => 0
[1,1,1,0,0,0,1,0,1,0] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [1,2,5,3,4] => 1
[1,1,1,0,0,0,1,1,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,1,1,0,0,1,0,0,1,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [1,3,5,2,4] => 1
[1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [1,4,3,5,2] => 0
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [1,3,4,2,5] => 0
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [4,2,3,5,1] => [2,3,5,1,4] => 1
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [5,2,4,3,1] => [2,4,3,5,1] => 0
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [3,4,2,5,1] => 0
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,0,1,0,0,0,1,0] => [4,2,3,1,5] => [2,3,4,1,5] => 0
[1,1,1,1,0,0,0,0,1,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [1,2,3,5,4] => 0
[1,1,1,1,0,0,0,1,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [1,2,4,5,3] => 0
[1,1,1,1,0,0,1,0,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,5,3,4,2] => [1,3,4,5,2] => 0
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => [2,3,4,5,1] => 0
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => [6,1,2,3,4,5] => 4
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,0,1,0] => [2,3,4,5,1,6] => [5,1,2,3,4,6] => 3
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,0,1,1,0,0] => [2,3,4,1,6,5] => [4,1,2,3,6,5] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,5,1] => [5,6,1,2,3,4] => 3
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0,1,0,1,0] => [2,3,4,1,5,6] => [4,1,2,3,5,6] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,0,1,1,0,1,0,0] => [2,3,1,5,6,4] => [3,1,2,6,4,5] => 2
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,0,1,1,0,0,1,0] => [2,3,1,5,4,6] => [3,1,2,5,4,6] => 1
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => [2,3,5,4,6,1] => [4,6,1,2,3,5] => 3
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,5,4,1] => [5,4,6,1,2,3] => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0,1,0] => [2,3,5,4,1,6] => [4,5,1,2,3,6] => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,0,1,0,1,1,0,0] => [2,3,1,4,6,5] => [3,1,2,4,6,5] => 1
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [2,3,1,6,5,4] => [3,1,2,5,6,4] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [2,3,6,4,5,1] => [4,5,6,1,2,3] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,0,1,0,1,0,1,0] => [2,3,1,4,5,6] => [3,1,2,4,5,6] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,0,1,1,0,1,0,1,0,0] => [2,1,4,5,6,3] => [2,1,6,3,4,5] => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,0,1,1,0,1,0,0,1,0] => [2,1,4,5,3,6] => [2,1,5,3,4,6] => 1
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => [2,1,4,3,6,5] => 0
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [2,1,4,6,5,3] => [2,1,5,6,3,4] => 1
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => [2,1,4,3,5,6] => 0
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => [2,4,3,5,6,1] => [3,6,1,2,4,5] => 3
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,0,1,0] => [2,4,3,5,1,6] => [3,5,1,2,4,6] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [2,5,4,3,6,1] => [4,3,6,1,2,5] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [2,6,4,5,3,1] => [5,3,4,6,1,2] => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [2,5,4,3,1,6] => [4,3,5,1,2,6] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,0,1,1,0,0] => [2,4,3,1,6,5] => [3,4,1,2,6,5] => 1
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => [2,4,3,6,5,1] => [3,5,6,1,2,4] => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [2,6,4,3,5,1] => [4,3,5,6,1,2] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,0,0,1,0,1,0] => [2,4,3,1,5,6] => [3,4,1,2,5,6] => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,0,1,0,1,1,0,1,0,0] => [2,1,3,5,6,4] => [2,1,3,6,4,5] => 1
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => [2,1,3,5,4,6] => 0
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,0,1,1,1,0,0,1,0,0] => [2,1,5,4,6,3] => [2,1,4,6,3,5] => 1
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,5,4,3] => [2,1,5,4,6,3] => 0
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,4,3,6] => [2,1,4,5,3,6] => 0
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => [2,5,3,4,6,1] => [3,4,6,1,2,5] => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [2,6,3,5,4,1] => [3,5,4,6,1,2] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,6,5,4,3,1] => [4,5,3,6,1,2] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,0,1,0,0,0,1,0] => [2,5,3,4,1,6] => [3,4,5,1,2,6] => 1
>>> Load all 305 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of occurrences of the pattern 31-2.
See Permutations/#Pattern-avoiding_permutations for the definition of the pattern 31−2.
See Permutations/#Pattern-avoiding_permutations for the definition of the pattern 31−2.
Map
inverse first fundamental transformation
Description
Let σ=(i11⋯i1k1)⋯(iℓ1⋯iℓkℓ) be a permutation given by cycle notation such that every cycle starts with its maximal entry, and all cycles are ordered increasingly by these maximal entries.
Maps σ to the permutation [i11,…,i1k1,…,iℓ1,…,iℓkℓ] in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
Maps σ to the permutation [i11,…,i1k1,…,iℓ1,…,iℓkℓ] in one-line notation.
In other words, this map sends the maximal entries of the cycles to the left-to-right maxima, and the sequences between two left-to-right maxima are given by the cycles.
Map
to non-crossing permutation
Description
Sends a Dyck path D with valley at positions {(i1,j1),…,(ik,jk)} to the unique non-crossing permutation π having descents {i1,…,ik} and whose inverse has descents {j1,…,jk}.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to n(n−1) minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to n(n−1) minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index of a permutation..
Map
Delest-Viennot
Description
Return the Dyck path corresponding to the parallelogram polyomino obtained by applying Delest-Viennot's bijection.
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1…d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (γ(−1)∘β)(D).
Let D be a Dyck path of semilength n. The parallelogram polyomino γ(D) is defined as follows: let ˜D=d0d1…d2n+1 be the Dyck path obtained by prepending an up step and appending a down step to D. Then, the upper path of γ(D) corresponds to the sequence of steps of ˜D with even indices, and the lower path of γ(D) corresponds to the sequence of steps of ˜D with odd indices.
The Delest-Viennot bijection β returns the parallelogram polyomino, whose column heights are the heights of the peaks of the Dyck path, and the intersection heights between columns are the heights of the valleys of the Dyck path.
This map returns the Dyck path (γ(−1)∘β)(D).
searching the database
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!