62 citations · 222 across the 34 of their papers we have counts for
Showing 2012Show all
3 papers · 1 filter
cs.CC2012★ 4 cited
Explicit Lower Bounds via Geometric Complexity Theory
Peter Bürgisser, Christian Ikenmeyer
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the s…
math.RT2012★ 1 cited
Small Littlewood-Richardson coefficients
Christian Ikenmeyer
We develop structural insights into the Littlewood-Richardson graph, whose number of vertices equals the Littlewood-Richardson coefficient c(λ,μ,ν) for given partitions λ, μ, and ν…
math.RT2012★ 1 cited
Deciding Positivity of Littlewood-Richardson Coefficients
Peter Bürgisser, Christian Ikenmeyer
Starting with Knutson and Tao's hive model (in J. Amer. Math. Soc., 1999) we characterize the Littlewood-Richardson coefficient of given partitions as th…