On non-commutative rank and tensor rank

@article{Derksen2016OnNR,
  title={On non-commutative rank and tensor rank},
  author={H. Derksen and V. Makam},
  journal={Linear and Multilinear Algebra},
  year={2016},
  volume={66},
  pages={1069 - 1084}
}
  • H. Derksen, V. Makam
  • Published 2016
  • Mathematics
  • Linear and Multilinear Algebra
  • Abstract We study the relationship between the commutative and the non-commutative rank of a linear matrix. We give examples that show that the ratio of the two ranks comes arbitrarily close to 2. Such examples can be used for giving lower bounds for the border rank of a given tensor. Landsberg used such techniques to give non-trivial equations for the tensors of border rank at most in if m is even. He also gave such equations for tensors of border rank at most in if m is odd. Using concavity… CONTINUE READING
    Invariant Theory, Tensors and Computational Complexity
    More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer
    • 2
    • Open Access
    Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces
    • 6
    • Open Access
    Kronecker powers of tensors and Strassen's laser method
    • 11
    • Open Access
    On the tensor rank of $3\times 3$ permanent and determinant
    • 1
    • Open Access
    The regularity lemma is false over small fields
    Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
    • 22
    • Highly Influenced
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES
    COMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK
    • 27
    • Highly Influential
    • Open Access
    Nontriviality of equations and explicit tensors in Cm⊗Cm⊗Cm of border rank at least 2m−2
    • 10
    • Highly Influential
    Vector spaces of matrices of low rank
    • 65
    • Open Access
    New Lower Bounds for the Rank of Matrix Multiplication
    • 40
    • Open Access
    Constructive noncommutative rank computation in deterministic polynomial time over fields of arbitrary characteristics
    • 23
    • Open Access
    Non-commutative Edmonds’ problem and matrix semi-invariants
    • 44
    • Highly Influential
    • Open Access
    PRIME RINGS SATISFYING A POLYNOMIAL IDENTITY
    • 90
    • Open Access
    Tensors: Geometry and Applications
    • 505
    • Open Access
    A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing
    • 70
    • Open Access
    Polynomial degree bounds for matrix semi-invariants
    • 53
    • Open Access