Deciding Positivity of Littlewood-Richardson Coefficients

Details Deciding Positivity of Littlewood-Richardson Coefficients Deciding Positivity of Littlewood-Richardson Coefficients

2012-04-11

arxiv.org/abs/1204.2484v1

Mathematics

Representation Theory

42 pages

Scientific paper

Starting with Knutson and Tao's hive model (in J. Amer. Math. Soc., 1999) we characterize the Littlewood-Richardson coefficient $c_{\lambda,\mu}^\nu$ of given partitions $\lambda,\mu,\nu\in N^n$ as the number of capacity achieving hive flows on the honeycomb graph. Based on this, we design a polynomial time algorithm for deciding $c_{\lambda,\mu}^\nu >0$. This algorithm is easy to state and takes $O(n^3 \log \nu_1)$ arithmetic operations and comparisons. We further show that the capacity achieving hive flows can be seen as the vertices of a connected graph, which leads to new structural insights into Littlewood-Richardson coefficients.

Affiliated with

Also associated with

No associations

Rating

Deciding Positivity of Littlewood-Richardson Coefficients does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Deciding Positivity of Littlewood-Richardson Coefficients, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Deciding Positivity of Littlewood-Richardson Coefficients will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-717137