Identifier
Values
[1] => [1,0] => [(1,2)] => [2,1] => 0
[2] => [1,0,1,0] => [(1,2),(3,4)] => [2,1,4,3] => 0
[1,1] => [1,1,0,0] => [(1,4),(2,3)] => [3,4,2,1] => 1
[3] => [1,0,1,0,1,0] => [(1,2),(3,4),(5,6)] => [2,1,4,3,6,5] => 0
[2,1] => [1,0,1,1,0,0] => [(1,2),(3,6),(4,5)] => [2,1,5,6,4,3] => 1
[1,1,1] => [1,1,0,1,0,0] => [(1,6),(2,3),(4,5)] => [3,5,2,6,4,1] => 2
[4] => [1,0,1,0,1,0,1,0] => [(1,2),(3,4),(5,6),(7,8)] => [2,1,4,3,6,5,8,7] => 0
[2,2] => [1,1,1,0,0,0] => [(1,6),(2,5),(3,4)] => [4,5,6,3,2,1] => 2
[5] => [1,0,1,0,1,0,1,0,1,0] => [(1,2),(3,4),(5,6),(7,8),(9,10)] => [2,1,4,3,6,5,8,7,10,9] => 0
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [(1,2),(3,4),(5,6),(7,8),(9,10),(11,12)] => [2,1,4,3,6,5,8,7,10,9,12,11] => 0
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
click to show known generating functions       
Description
The number of mid points of decreasing subsequences of length 3 in a permutation.
For a permutation $\pi$ of $\{1,\ldots,n\}$, this is the number of indices $j$ such that there exist indices $i,k$ with $i < j < k$ and $\pi(i) > \pi(j) > \pi(k)$. In other words, this is the number of indices that are neither left-to-right maxima nor right-to-left minima.
This statistic can also be expressed as the number of occurrences of the mesh pattern ([3,2,1], {(0,2),(0,3),(2,0),(3,0)}): the shading fixes the first and the last element of the decreasing subsequence.
See also St000119The number of occurrences of the pattern 321 in a permutation..
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
to tunnel matching
Description
Sends a Dyck path of semilength n to the noncrossing perfect matching given by matching an up-step with the corresponding down-step.
This is, for a Dyck path $D$ of semilength $n$, the perfect matching of $\{1,\dots,2n\}$ with $i < j$ being matched if $D_i$ is an up-step and $D_j$ is the down-step connected to $D_i$ by a tunnel.
Map
non-nesting-exceedence permutation
Description
The fixed-point-free permutation with deficiencies given by the perfect matching, no alignments and no inversions between exceedences.
Put differently, the exceedences form the unique non-nesting perfect matching whose openers coincide with those of the given perfect matching.