Shuffle Invariance of the Super-RSK Algorithm

2001/03/29 by Amitai Regev, Tamar Seeman, Regev, Amitai +1
Computer Science · Mathematics · #05E10 #Algebraic structures and combinatorial models #Algorithms and Data Compression #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05E10

paper · pdf · doi:10.48550/arxiv.math/0103206

22 pages

arxiv created 2001/03/29 · openalex publication_date 2001/03/29 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

As in the (k,l)-RSK (Robinson-Schensted-Knuth) of [1], other super-RSK algorithms can be applied to sequences of variables from the set \t₁,...,t_k,u₁,...,u_l\, where t₁

Related

• Applications of Symmetric Functions to Cycle and Subsequence Structure after Shuffles
• A super Robinson-Schensted-Knuth correspondence with symmetry and the super Littlewood-Richardson rule
• Increasing and Decreasing Subsequences of Permutations and Their Variants
• Applications of Symmetric Functions to Cycle and Increasing Subsequence Structure after Shuffles (Part 2)
• Super RSK correspondence with symmetry