On the greatest and least elements in the set of semistandard tableaux of given shape and weight
classification
🧮 math.CO
keywords
semistandardweightgivenshapetableauxalgorithmselementelements
read the original abstract
We give three algorithms to construct a semistandard tableau of given shape and weight, where the weight is a composition which is not necessarily a partition. With respect to a natural partial order on the set of semistandard tableaux, we show that the set of semistandard tableaux of given shape and weight has a unique greatest element and a unique least element. Two of our algorithms give each of these elements.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.