Lower and Upper Bounds for Nonzero Littlewood-Richardson Coefficients

Abstract: Given a skew diagram

g a m m a / l a m b d a

, we determine a set of lower and upper bounds that a partition

m u

must satisfy for Littlewood-Richards coefficients

c_{l a m b d a, m u}^{g a m m a} > 0

. Our algorithm depends on the characterization of

c_{l a m b d a, m u}^{g a m m a}

as the number of Littlewood-Richardson tableau of shape

g a m m a / l a m b d a

and content

m u

and uses the (generalized) dominance order on partitions as the main ingredient.

This page was built for publication: Lower and Upper Bounds for Nonzero Littlewood-Richardson Coefficients