1 research outputs found
Lower and Upper Bounds for Nonzero Littlewood-Richardson Coefficients
Given a skew diagram , we determine a set of lower and upper
bounds that a partition must satisfy for Littlewood-Richards coefficients
. Our algorithm depends on the characterization of
as the number of Littlewood-Richardson tableau of
shape and content and uses the (generalized) dominance
order on partitions as the main ingredient