Identifier
Mp00033: to two-row standard tableauStandard tableaux
Mp00235: Permutations descent views to invisible inversion bottomsPermutations
Mp00127: Permutations left-to-right-maxima to Dyck path
Images
=>
Cc0005;cc-rep-0Cc0007;cc-rep-1Cc0005;cc-rep-4
[1,0]=>[[1],[2]]=>[2,1]=>[2,1]=>[1,1,0,0] [1,0,1,0]=>[[1,3],[2,4]]=>[2,4,1,3]=>[4,2,1,3]=>[1,1,1,1,0,0,0,0] [1,1,0,0]=>[[1,2],[3,4]]=>[3,4,1,2]=>[4,1,3,2]=>[1,1,1,1,0,0,0,0] [1,0,1,0,1,0]=>[[1,3,5],[2,4,6]]=>[2,4,6,1,3,5]=>[6,2,1,4,3,5]=>[1,1,1,1,1,1,0,0,0,0,0,0] [1,0,1,1,0,0]=>[[1,3,4],[2,5,6]]=>[2,5,6,1,3,4]=>[6,2,1,3,5,4]=>[1,1,1,1,1,1,0,0,0,0,0,0] [1,1,0,0,1,0]=>[[1,2,5],[3,4,6]]=>[3,4,6,1,2,5]=>[6,1,3,4,2,5]=>[1,1,1,1,1,1,0,0,0,0,0,0] [1,1,0,1,0,0]=>[[1,2,4],[3,5,6]]=>[3,5,6,1,2,4]=>[6,1,3,2,5,4]=>[1,1,1,1,1,1,0,0,0,0,0,0] [1,1,1,0,0,0]=>[[1,2,3],[4,5,6]]=>[4,5,6,1,2,3]=>[6,1,2,4,5,3]=>[1,1,1,1,1,1,0,0,0,0,0,0] [1,0,1,0,1,0,1,0]=>[[1,3,5,7],[2,4,6,8]]=>[2,4,6,8,1,3,5,7]=>[8,2,1,4,3,6,5,7]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,0,1,0,1,1,0,0]=>[[1,3,5,6],[2,4,7,8]]=>[2,4,7,8,1,3,5,6]=>[8,2,1,4,3,5,7,6]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,0,0,1,0,1,0]=>[[1,2,5,7],[3,4,6,8]]=>[3,4,6,8,1,2,5,7]=>[8,1,3,4,2,6,5,7]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,0,1,0,0,1,0]=>[[1,2,4,7],[3,5,6,8]]=>[3,5,6,8,1,2,4,7]=>[8,1,3,2,5,6,4,7]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,0,1,0,1,0,0]=>[[1,2,4,6],[3,5,7,8]]=>[3,5,7,8,1,2,4,6]=>[8,1,3,2,5,4,7,6]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,0,1,1,0,0,0]=>[[1,2,4,5],[3,6,7,8]]=>[3,6,7,8,1,2,4,5]=>[8,1,3,2,4,6,7,5]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,1,0,0,0,1,0]=>[[1,2,3,7],[4,5,6,8]]=>[4,5,6,8,1,2,3,7]=>[8,1,2,4,5,6,3,7]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,1,0,0,1,0,0]=>[[1,2,3,6],[4,5,7,8]]=>[4,5,7,8,1,2,3,6]=>[8,1,2,4,5,3,7,6]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] [1,1,1,1,0,0,0,0]=>[[1,2,3,4],[5,6,7,8]]=>[5,6,7,8,1,2,3,4]=>[8,1,2,3,5,6,7,4]=>[1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
Map
to two-row standard tableau
Description
Return a standard tableau of shape $(n,n)$ where $n$ is the semilength of the Dyck path.
Given a Dyck path $D$, its image is given by recording the positions of the up-steps in the first row and the positions of the down-steps in the second row.
Map
Description
Return the permutation obtained by reading the entries of the tableau row by row, starting with the bottom-most row in English notation.
Map
descent views to invisible inversion bottoms
Description
Return a permutation whose multiset of invisible inversion bottoms is the multiset of descent views of the given permutation.
An invisible inversion of a permutation $\sigma$ is a pair $i < j$ such that $i < \sigma(j) < \sigma(i)$. The element $\sigma(j)$ is then an invisible inversion bottom.
A descent view in a permutation $\pi$ is an element $\pi(j)$ such that $\pi(i+1) < \pi(j) < \pi(i)$, and additionally the smallest element in the decreasing run containing $\pi(i)$ is smaller than the smallest element in the decreasing run containing $\pi(j)$.
This map is a bijection $\chi:\mathfrak S_n \to \mathfrak S_n$, such that
• the multiset of descent views in $\pi$ is the multiset of invisible inversion bottoms in $\chi(\pi)$,
• the set of left-to-right maximima of $\pi$ is the set of maximal elements in the cycles of $\chi(\pi)$,
• the set of global ascent of $\pi$ is the set of global ascent of $\chi(\pi)$,
• the set of maximal elements in the decreasing runs of $\pi$ is the set of deficiency positions of $\chi(\pi)$, and
• the set of minimal elements in the decreasing runs of $\pi$ is the set of deficiency values of $\chi(\pi)$.
Map
left-to-right-maxima to Dyck path
Description
The left-to-right maxima of a permutation as a Dyck path.
Restricted to 321-avoiding permutations, this is the inverse of Mp00119to 321-avoiding permutation (Krattenthaler), restricted to 312-avoiding permutations, this is the inverse of Mp00031to 312-avoiding permutation.