Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4656302 | Journal of Combinatorial Theory, Series A | 2009 | 20 Pages |
Abstract
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 on 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics