Finding the permutations corresponding to a given Young tableau

MaRDI QIDQ1001688zbMATH OpenFDO

Authors Jyrki Nummenmaa, Erkki Mäkinen

Publication date 24 February 2009

Published in Missouri Journal of Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

recursive algorithmYoung tableaufinding permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics in computer science (68R05) Combinatorial aspects of representation theory (05E10)

Recommendations

• Permutations, matrices, and generalized Young tableaux
• Alternating permutations with restrictions and standard Young tableaux
• Combinatorics of Young tableaux and configurations
• scientific article; zbMATH DE number 192825
• Young classes of permutations
• Pattern avoidance for alternating permutations and Young tableaux
• scientific article; zbMATH DE number 2148704
• Beyond alternating permutations: pattern avoidance in Young diagrams and tableaux
• scientific article; zbMATH DE number 638672
• scientific article; zbMATH DE number 1919518

Cited in

(9)

• A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
• Method to rank and unrank semi-standard Young tableau for a partition ofn
• A combinatorial approach to the double cosets of the symmetric group with respect to Young subgroups
• Defragmentation of permutation tables with four columns
• An application of Young tableaux to cryptography
• Algorithms for constructing \((0,1)\)-matrices with prescribed row and column sum vectors
• scientific article; zbMATH DE number 2148704 (Why is no real title available?)
• The computer-aided discovery of a theorem about Young tableaux
• scientific article; zbMATH DE number 6473264 (Why is no real title available?)

This page was built for publication: Finding the permutations corresponding to a given Young tableau

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1001688)