Identifier
Mp00045: Integer partitions reading tableauStandard tableaux
Mp00081: Standard tableaux reading word permutationPermutations
Mp00072: Permutations binary search tree: left to right Binary trees
Images
=>
Cc0002;cc-rep-0Cc0007;cc-rep-1Cc0010;cc-rep-3
[1]=>[[1]]=>[1]=>[.,.] [2]=>[[1,2]]=>[1,2]=>[.,[.,.]] [1,1]=>[[1],[2]]=>[2,1]=>[[.,.],.] [3]=>[[1,2,3]]=>[1,2,3]=>[.,[.,[.,.]]] [2,1]=>[[1,3],[2]]=>[2,1,3]=>[[.,.],[.,.]] [1,1,1]=>[[1],[2],[3]]=>[3,2,1]=>[[[.,.],.],.] [4]=>[[1,2,3,4]]=>[1,2,3,4]=>[.,[.,[.,[.,.]]]] [3,1]=>[[1,3,4],[2]]=>[2,1,3,4]=>[[.,.],[.,[.,.]]] [2,2]=>[[1,2],[3,4]]=>[3,4,1,2]=>[[.,[.,.]],[.,.]] [2,1,1]=>[[1,4],[2],[3]]=>[3,2,1,4]=>[[[.,.],.],[.,.]] [1,1,1,1]=>[[1],[2],[3],[4]]=>[4,3,2,1]=>[[[[.,.],.],.],.] [5]=>[[1,2,3,4,5]]=>[1,2,3,4,5]=>[.,[.,[.,[.,[.,.]]]]] [4,1]=>[[1,3,4,5],[2]]=>[2,1,3,4,5]=>[[.,.],[.,[.,[.,.]]]] [3,2]=>[[1,2,5],[3,4]]=>[3,4,1,2,5]=>[[.,[.,.]],[.,[.,.]]] [3,1,1]=>[[1,4,5],[2],[3]]=>[3,2,1,4,5]=>[[[.,.],.],[.,[.,.]]] [2,2,1]=>[[1,3],[2,5],[4]]=>[4,2,5,1,3]=>[[[.,.],[.,.]],[.,.]] [2,1,1,1]=>[[1,5],[2],[3],[4]]=>[4,3,2,1,5]=>[[[[.,.],.],.],[.,.]] [1,1,1,1,1]=>[[1],[2],[3],[4],[5]]=>[5,4,3,2,1]=>[[[[[.,.],.],.],.],.] [6]=>[[1,2,3,4,5,6]]=>[1,2,3,4,5,6]=>[.,[.,[.,[.,[.,[.,.]]]]]] [5,1]=>[[1,3,4,5,6],[2]]=>[2,1,3,4,5,6]=>[[.,.],[.,[.,[.,[.,.]]]]] [4,2]=>[[1,2,5,6],[3,4]]=>[3,4,1,2,5,6]=>[[.,[.,.]],[.,[.,[.,.]]]] [4,1,1]=>[[1,4,5,6],[2],[3]]=>[3,2,1,4,5,6]=>[[[.,.],.],[.,[.,[.,.]]]] [3,3]=>[[1,2,3],[4,5,6]]=>[4,5,6,1,2,3]=>[[.,[.,[.,.]]],[.,[.,.]]] [3,2,1]=>[[1,3,6],[2,5],[4]]=>[4,2,5,1,3,6]=>[[[.,.],[.,.]],[.,[.,.]]] [3,1,1,1]=>[[1,5,6],[2],[3],[4]]=>[4,3,2,1,5,6]=>[[[[.,.],.],.],[.,[.,.]]] [2,2,2]=>[[1,2],[3,4],[5,6]]=>[5,6,3,4,1,2]=>[[[.,[.,.]],[.,.]],[.,.]] [2,2,1,1]=>[[1,4],[2,6],[3],[5]]=>[5,3,2,6,1,4]=>[[[[.,.],.],[.,.]],[.,.]] [2,1,1,1,1]=>[[1,6],[2],[3],[4],[5]]=>[5,4,3,2,1,6]=>[[[[[.,.],.],.],.],[.,.]] [1,1,1,1,1,1]=>[[1],[2],[3],[4],[5],[6]]=>[6,5,4,3,2,1]=>[[[[[[.,.],.],.],.],.],.] [7]=>[[1,2,3,4,5,6,7]]=>[1,2,3,4,5,6,7]=>[.,[.,[.,[.,[.,[.,[.,.]]]]]]] [6,1]=>[[1,3,4,5,6,7],[2]]=>[2,1,3,4,5,6,7]=>[[.,.],[.,[.,[.,[.,[.,.]]]]]] [5,2]=>[[1,2,5,6,7],[3,4]]=>[3,4,1,2,5,6,7]=>[[.,[.,.]],[.,[.,[.,[.,.]]]]] [5,1,1]=>[[1,4,5,6,7],[2],[3]]=>[3,2,1,4,5,6,7]=>[[[.,.],.],[.,[.,[.,[.,.]]]]] [4,3]=>[[1,2,3,7],[4,5,6]]=>[4,5,6,1,2,3,7]=>[[.,[.,[.,.]]],[.,[.,[.,.]]]] [4,2,1]=>[[1,3,6,7],[2,5],[4]]=>[4,2,5,1,3,6,7]=>[[[.,.],[.,.]],[.,[.,[.,.]]]] [4,1,1,1]=>[[1,5,6,7],[2],[3],[4]]=>[4,3,2,1,5,6,7]=>[[[[.,.],.],.],[.,[.,[.,.]]]] [3,3,1]=>[[1,3,4],[2,6,7],[5]]=>[5,2,6,7,1,3,4]=>[[[.,.],[.,[.,.]]],[.,[.,.]]] [3,2,2]=>[[1,2,7],[3,4],[5,6]]=>[5,6,3,4,1,2,7]=>[[[.,[.,.]],[.,.]],[.,[.,.]]] [3,2,1,1]=>[[1,4,7],[2,6],[3],[5]]=>[5,3,2,6,1,4,7]=>[[[[.,.],.],[.,.]],[.,[.,.]]] [3,1,1,1,1]=>[[1,6,7],[2],[3],[4],[5]]=>[5,4,3,2,1,6,7]=>[[[[[.,.],.],.],.],[.,[.,.]]] [2,2,2,1]=>[[1,3],[2,5],[4,7],[6]]=>[6,4,7,2,5,1,3]=>[[[[.,.],[.,.]],[.,.]],[.,.]] [2,2,1,1,1]=>[[1,5],[2,7],[3],[4],[6]]=>[6,4,3,2,7,1,5]=>[[[[[.,.],.],.],[.,.]],[.,.]] [2,1,1,1,1,1]=>[[1,7],[2],[3],[4],[5],[6]]=>[6,5,4,3,2,1,7]=>[[[[[[.,.],.],.],.],.],[.,.]] [1,1,1,1,1,1,1]=>[[1],[2],[3],[4],[5],[6],[7]]=>[7,6,5,4,3,2,1]=>[[[[[[[.,.],.],.],.],.],.],.] [8]=>[[1,2,3,4,5,6,7,8]]=>[1,2,3,4,5,6,7,8]=>[.,[.,[.,[.,[.,[.,[.,[.,.]]]]]]]] [4,4]=>[[1,2,3,4],[5,6,7,8]]=>[5,6,7,8,1,2,3,4]=>[[.,[.,[.,[.,.]]]],[.,[.,[.,.]]]] [3,3,1,1]=>[[1,4,5],[2,7,8],[3],[6]]=>[6,3,2,7,8,1,4,5]=>[[[[.,.],.],[.,[.,.]]],[.,[.,.]]] [2,2,2,2]=>[[1,2],[3,4],[5,6],[7,8]]=>[7,8,5,6,3,4,1,2]=>[[[[.,[.,.]],[.,.]],[.,.]],[.,.]] [2,2,1,1,1,1]=>[[1,6],[2,8],[3],[4],[5],[7]]=>[7,5,4,3,2,8,1,6]=>[[[[[[.,.],.],.],.],[.,.]],[.,.]] [1,1,1,1,1,1,1,1]=>[[1],[2],[3],[4],[5],[6],[7],[8]]=>[8,7,6,5,4,3,2,1]=>[[[[[[[[.,.],.],.],.],.],.],.],.]
Map
reading tableau
Description
Return the RSK recording tableau of the reading word of the (standard) tableau $T$ labeled down (in English convention) each column to the shape of a partition.
Map
reading word permutation
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
binary search tree: left to right
Description
Return the shape of the binary search tree of the permutation as a non labelled binary tree.