UVM Theses and Dissertations
Format:
Print
Author:
Godbout, Jonathan
Dept./Program:
Mathematics
Year:
2013
Degree:
MS
Abstract:
The Robinson-Schensted-Knuth (RSK) algorithm gives a bijection from permutations on n numbers to pairs of tableaux (r, q) of the same shape. The Mirabolic RSK algorithm given by Roman Travkin gives a bijection from a set of colored permutations Bn to triples of tableaux (r, q, t@). Alternatively we can have the Mirabolic RSK algorithm give a bijection from Bn to pairs tableaux (P, Q) of the same shape. We give a combinatorial bijection between tableaux produced by the Mirabolic RSK algorithm and rook placements.