A max-flow algorithm for positivity of Littlewood-Richardson coefficients

Littlewood-Richardson coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group $\mathrm{GL}(n,\mathbb{C})$. They have a wide variety of interpretations in combinatorics, representation theory and geometry. Mulmuley and Soh...

وصف كامل

التفاصيل البيبلوغرافية

المؤلفون الرئيسيون:	Peter Bürgisser, Christian Ikenmeyer
التنسيق:	Artigo
اللغة:	Inglês
منشور في:	Discrete Mathematics & Theoretical Computer Science 2009-01-01
سلاسل:	Discrete Mathematics & Theoretical Computer Science
الموضوعات:	littlewood-richardson coefficients saturation conjecture flows in network polynomial time [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
الوصول للمادة أونلاين:	https://dmtcs.episciences.org/2749/pdf
الوسوم:	إضافة وسم لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!