R-S correspondence for the Hyper-octahedral group of type Bn - A different approach

Abstract

In this paper we develop a Robinson Schensted algorithm for the hyperoctahedral group of type Bn on partitions of ( 1 2 r(r + 1) + 2n) whose 2−core is δr, r ≥ 0 where δr is the partition with parts (r, r−1, . . . , 0). We derive some combinatorial properties associated with this correspondence.