Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient

Details Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient

2007-04-02

arxiv.org/abs/0704.0213v1

Computer Science

Computational Complexity

5 pages

Scientific paper

In this note it is observed that nonvanishing of a generalized
Littlewood-Richardson coefficient of any type can be decided in polynomial time
assuming the conjecture in De Loera and McAllister that the coefficients of the
associated stretching quasi-polynomial are nonnegative.

Affiliated with

Also associated with

No associations

Rating

Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient 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 Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492402