2000 character limit reached
On Sundaram's full bijection
Published 19 Dec 2017 in math.CO and math.RT | (1712.07011v2)
Abstract: We highlight refinement of a bijection given by Sheila Sundaram in her PhD thesis. The framework allows for comparison to a late conjecture of Naito-Sagaki. We give an injection of the set of dominant paths for this model into the corresponding set of Littlewood-Richardson Sundaram tableaux, which is not surjective. We relate this to the refinement of the aforementioned bijection.
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.