Given a skew diagram $γ/λ$, we determine a set of lower and upper bounds that a partition $μ$ must satisfy for Littlewood-Richards coefficients $c^γ_{λ,μ}>0$. Our algorithm depends on the characterization of $c^γ_{λ,μ}$ as the number of Littlewood-Richardson tableau of shape $γ/λ$ and content $μ$ and uses the (generalized) dominance order on partitions as the main ingredient.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。