12 citations · 17 across the 3 of their papers we have counts for
3 papers
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 ν…
cs.CC2010★ 12 cited
Geometric Complexity Theory and Tensor Rank
Peter Buergisser, Christian Ikenmeyer
Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by met…