arXiv Analytics

Sign in

arXiv:1507.01339 [math.CO]AbstractReferencesReviewsResources

On the greatest and least elements in the set of semistandard tableaux of given shape and weight

Akihiro Munemasa, Minwon Na

Published 2015-07-06Version 1

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.

Comments: 18 pages
Categories: math.CO
Subjects: 05A15, 05A17, 05A19, 05E10, 20C30
Related articles: Most relevant | Search more
arXiv:math/0410466 [math.CO] (Published 2004-10-21, updated 2005-05-20)
Hook-lengths and Pairs of Compositions
arXiv:1204.1037 [math.CO] (Published 2012-04-04)
An explicit bijection between semistandard tableaux and non-elliptic sl_3 webs
arXiv:1812.11010 [math.CO] (Published 2018-12-28)
Compositions with restricted parts

Links

Toolbox