MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

If $V_\lambda$, $V_\mu$ and $V_\nu$ are irreducible representations of $GL_n$, the Littlewood-Richardson coefficient $c_{\lambda\mu}^\nu$ denotes the multiplicity of $V_\nu$ in the direct sum decomposition of the tensor product of $V_\lambda$ and $V_\nu$. Knutson and Tao proposed a ``Hive model" for Littlewood-Richardson coefficients in

Is there an analogous model for such tensor product multiplicities for Lie groups of types B, C or D?

share|cite|improve this question

The recent work of Goncharov-Shen gives a good generalization of the hive model for any reductive group $ G$. They show that $n$-fold tensor product multiplicities for $ G $ are counted by positive tropical integral points of the space $ G^\vee \setminus ( G^\vee / N)^n $. When $ G = GL_m$ and $n = 3$, this gives the Hive model. When $ G = GL_m $ and $ n = 4 $, this gives the octahedron recurrence.

Unfortunately, outside of type $ A$, it is hard to give a simple description of their set of positive tropical points. To do so requires some choices, and once one makes these choices, you end up with one of the Berenstein-Zelevinsky models which Allen mentioned.

share|cite|improve this answer

There are conjectural ones in the Berenstein-Zelevinsky paper referenced in that one. They have another paper with a general theorem, Tensor product multiplicities, canonical bases and totally positive varieties, that gives (many) polyhedral models for any Lie type.

share|cite|improve this answer
Hi Allen, Thank you very much. I think I heard that there may be a model for type B, where 3 hives are pasted together to form a Moebius strip, but otherwise the model is similar to the hive model for type A. I'd be very grateful if you could clarify if this is the case. – Hari Jul 30 '10 at 22:49

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.