A polynomiality property for Littlewood–Richardson coefficients

详细信息	查看全文 | 推荐本文 |

• 作者：Rassart ; Etienne
• 刊名：Journal of Combinatorial Theory ; Series A
• 出版年：2004
• 期刊代码：72_00973165
• 类别：mt
• 出版时间：August, 2004
• 卷：107
• 期：2
• 页码：161-179
• 文件大小：323 K

摘要

We present a polynomiality property of the Littlewood–Richardson coefficients c_λμ^ν. The coefficients are shown to be given by polynomials in λ, μ and ν on the cones of the chamber complex of a vector partition function. We give bounds on the degree of the polynomials depending on the maximum allowed number of parts of the partitions λ, μ and ν. We first express the Littlewood–Richardson coefficients as a vector partition function. We then define a hyperplane arrangement from Steinberg's formula, over whose regions the Littlewood–Richardson coefficients are given by polynomials, and relate this arrangement to the chamber complex of the partition function. As an easy consequence, we get a new proof of the fact that c_NλNμ^Nν is given by a polynomial in N, which partially establishes the conjecture of King et al. (CRM Proceedings and Lecture Notes, Vol. 34, 2003) that c_NλNμ^Nν is a polynomial in N with nonnegative rational coefficients.