首页> 外文期刊>Journal of Combinatorial Theory, Series A >Factorisation of Littlewood-Richardson coefficients
【24h】

Factorisation of Littlewood-Richardson coefficients

机译:Littlewood-Richardson系数的因式分解

获取原文
获取原文并翻译 | 示例
           

摘要

The hive model is used to show that the Saturation of any essential Horn inequality leads to the factorisation of Littlewood-Richardson coefficients. The proof is based oil the use of combinatorial objects known as puzzles. These are shown not only to account for the origin of Horn inequalities, but also to determine the constraints on hives that lead to factorisation. Defining a primitive Littlewood-Richardson coefficient to be one for which all essential Horn inequalities are strict, it is shown that every Littlewood-Richardson coefficient can be expressed as a product of primitive coefficients. Precisely the same result is shown to apply to the polynomials defined by stretched Littlewood-Richardson coefficients. (C) 2008 Published by Elsevier Inc.
机译:蜂巢模型用于表明,任何基本的Horn不等式的饱和都会导致Littlewood-Richardson系数分解。证明是基于被称为拼图的组合对象的使用。这些结果不仅说明了霍恩不等式的起源,而且还确定了导致分解的蜂巢的约束。将原始Littlewood-Richardson系数定义为所有基本Horn不等式都严格的系数,这表明每个Littlewood-Richardson系数都可以表示为原始系数的乘积。精确地表明,相同的结果适用于由扩展的Littlewood-Richardson系数定义的多项式。 (C)2008由Elsevier Inc.出版

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号