2000 character limit reached
Super RSK correspondence with symmetry
Published 1 Nov 2017 in math.CO | (1711.00420v1)
Abstract: Super RSK correspondence is a bijective correspondence between superbiwords and pairs of semistandard supertableaux. Such a bijection was given by Bonetti, Senato and Venezia, via an insertion algorithm closely related to Schensted insertion. Notably, the symmetry property satisfied by the classical RSK bijection holds only in special cases under this bijection. We present a new super RSK bijection, based on the mixed insertion process defined by Haiman, where the symmetry property holds in complete generality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.