Identifier
Mp00058: to permutationPermutations
Mp00087: Permutations inverse first fundamental transformationPermutations
Mp00066: Permutations inversePermutations
Mp00159: Permutations Demazure product with inversePermutations
Images
=>
Cc0012;cc-rep-0
[(1,2)]=>[2,1]=>[2,1]=>[2,1]=>[2,1] [(1,2),(3,4)]=>[2,1,4,3]=>[2,1,4,3]=>[2,1,4,3]=>[2,1,4,3] [(1,3),(2,4)]=>[3,4,1,2]=>[3,1,4,2]=>[2,4,1,3]=>[3,4,1,2] [(1,4),(2,3)]=>[4,3,2,1]=>[3,2,4,1]=>[4,2,1,3]=>[4,3,2,1] [(1,2),(3,4),(5,6)]=>[2,1,4,3,6,5]=>[2,1,4,3,6,5]=>[2,1,4,3,6,5]=>[2,1,4,3,6,5] [(1,3),(2,4),(5,6)]=>[3,4,1,2,6,5]=>[3,1,4,2,6,5]=>[2,4,1,3,6,5]=>[3,4,1,2,6,5] [(1,4),(2,3),(5,6)]=>[4,3,2,1,6,5]=>[3,2,4,1,6,5]=>[4,2,1,3,6,5]=>[4,3,2,1,6,5] [(1,5),(2,3),(4,6)]=>[5,3,2,6,1,4]=>[3,2,5,1,6,4]=>[4,2,1,6,3,5]=>[5,3,2,6,1,4] [(1,6),(2,3),(4,5)]=>[6,3,2,5,4,1]=>[3,2,5,4,6,1]=>[6,2,1,4,3,5]=>[6,3,2,5,4,1] [(1,6),(2,4),(3,5)]=>[6,4,5,2,3,1]=>[4,2,5,3,6,1]=>[6,2,4,1,3,5]=>[6,4,5,2,3,1] [(1,5),(2,4),(3,6)]=>[5,4,6,2,1,3]=>[4,2,5,1,6,3]=>[4,2,6,1,3,5]=>[5,4,6,2,1,3] [(1,4),(2,5),(3,6)]=>[4,5,6,1,2,3]=>[4,1,5,2,6,3]=>[2,4,6,1,3,5]=>[4,5,6,1,2,3] [(1,3),(2,5),(4,6)]=>[3,5,1,6,2,4]=>[3,1,5,2,6,4]=>[2,4,1,6,3,5]=>[3,5,1,6,2,4] [(1,2),(3,5),(4,6)]=>[2,1,5,6,3,4]=>[2,1,5,3,6,4]=>[2,1,4,6,3,5]=>[2,1,5,6,3,4] [(1,2),(3,6),(4,5)]=>[2,1,6,5,4,3]=>[2,1,5,4,6,3]=>[2,1,6,4,3,5]=>[2,1,6,5,4,3] [(1,3),(2,6),(4,5)]=>[3,6,1,5,4,2]=>[3,1,5,4,6,2]=>[2,6,1,4,3,5]=>[3,6,1,5,4,2] [(1,4),(2,6),(3,5)]=>[4,6,5,1,3,2]=>[4,1,5,3,6,2]=>[2,6,4,1,3,5]=>[4,6,5,1,3,2] [(1,5),(2,6),(3,4)]=>[5,6,4,3,1,2]=>[4,3,5,1,6,2]=>[4,6,2,1,3,5]=>[5,6,4,3,1,2] [(1,6),(2,5),(3,4)]=>[6,5,4,3,2,1]=>[4,3,5,2,6,1]=>[6,4,2,1,3,5]=>[6,5,4,3,2,1] [(1,2),(3,4),(5,6),(7,8)]=>[2,1,4,3,6,5,8,7]=>[2,1,4,3,6,5,8,7]=>[2,1,4,3,6,5,8,7]=>[2,1,4,3,6,5,8,7]
Map
to permutation
Description
Returns the fixed point free involution whose transpositions are the pairs in the perfect matching.
Map
inverse first fundamental transformation
Description
Let $\sigma = (i_{11}\cdots i_{1k_1})\cdots(i_{\ell 1}\cdots i_{\ell k_\ell})$ 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 $\sigma$ to the permutation $[i_{11},\ldots,i_{1k_1},\ldots,i_{\ell 1},\ldots,i_{\ell k_\ell}]$ 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
inverse
Description
Sends a permutation to its inverse.
Map
Demazure product with inverse
Description
This map sends a permutation $\pi$ to $\pi^{-1} \star \pi$ where $\star$ denotes the Demazure product on permutations.
This map is a surjection onto the set of involutions, i.e., the set of permutations $\pi$ for which $\pi = \pi^{-1}$.