Insertion Algorithms for Gelfand $$S_n$$-Graphs
Insertion Algorithms for Gelfand $$S_n$$-Graphs
Abstract The two tableaux assigned by the Robinson–Schensted correspondence are equal if and only if the input permutation is an involution, so the RS algorithm restricts to a bijection between involutions in the symmetric group and standard tableaux. Beissinger found a concise way of formulating this restricted map, which involves …