Tensor rank: matching polynomials and Schur rings
DOI10.1007/s10208-014-9190-3zbMath1305.15060OpenAlexW2052520425MaRDI QIDQ404298
Mikhail E. Muzychuk, Dima Yu. Grigoriev, Ilya Nikolaevich Ponomarenko
Publication date: 4 September 2014
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-014-9190-3
Analysis of algorithms and problem complexity (68Q25) Actions of groups on commutative rings; invariant theory (13A50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Multilinear algebra, tensor calculus (15A69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equations for secant varieties of Veronese and other varieties
- Nonvanishing of Kronecker coefficients for rectangular shapes.
- A note on border rank
- On the ranks and border ranks of symmetric tensors
- Rank and optimal computation of generic tensors
- Lower bounds in algebraic computational complexity
- On the ideals of secant varieties of Segre varieties
- Upper bound on the characters of the symmetric groups
- Ranks of tensors and a generalization of secant varieties
- New lower bounds for the border rank of matrix multiplication
- Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
- Geometry and the complexity of matrix multiplication
- Relative bilinear complexity and matrix multiplication.
- Geometric complexity theory and tensor rank
- Generalizations of Strassen's Equations for Secant Varieties of Segre Varieties
- Explicit lower bounds via geometric complexity theory
This page was built for publication: Tensor rank: matching polynomials and Schur rings
