Complexity and geometry of bilinear maps
Geometric invariant theory (14L24) Multilinear algebra, tensor calculus (15A69) Momentum maps; symplectic reduction (53D20) Complexity and performance of numerical algorithms (65Y20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Symbolic computation and algebraic computation (68W30)
This is the written exposition of a talk for a general mathematical audience, held by the author at the DMV-meeting. Complexity and degeneration of bilinear maps may be described by a single data structure: the asymptotic spectrum. The paper gives an introduction to this theory. As a red thread it uses \(\omega\), the exponent of matrix multiplication. The paper has been supplemented by footnotes containing more details and by an appendix, which is an invitation to application-oriented algebraists and geometers to be become acquainted with the topic. It contains short new proofs for some results in the main text, conjectures, and relations to other topics.
- Geometry of normed bilinear maps and the 16-square problem
- Growth of bilinear maps
- Towards a geometric approach to Strassen's asymptotic rank conjecture
- Tensor surgery and tensor rank
- Complexity of linear circuits and geometry
- scientific article; zbMATH DE number 48553 (Why is no real title available?)
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Universal points in the asymptotic spectrum of tensors
- Asymptotic spectrum and matrix multiplication
- Structure vs. randomness for bilinear maps
- Asymptotic spectra: theory, applications, and extensions
This page was built for publication: Complexity and geometry of bilinear maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781226)
