Abstract
It is shown that the maximal rank of $m\times n\times(mn-k)$ tensors with $k \leqq \min \{ {{(m-1)^2}/2},{{(n-1)^2} / 2} \}$ is greater than $mn - 4\sqrt {2k} + O(1)$.MSC codes68G2515A57Keywordscomputation complexitybilinear formstensor rank
Keywords
Rank (graph theory)CombinatoricsMathematicsPhysics
Affiliated Institutions
Related Publications
Efficient MATLAB Computations with Sparse and Factored Tensors
In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. ...
Empirical graph Laplacian approximation of Laplace–Beltrami operators: Large sample results
Let ${M}$ be a compact Riemannian submanifold of ${{\\bf R}^m}$ of dimension\n$\\scriptstyle{d}$ and let ${X_1,...,X_n}$ be a sample of i.i.d. points in ${M}$\nwith uniform dist...
Waves a heavy, viscous, incompressible, electrically conducting fluid of variable density, in the presence of a magnetic field
The equilibrium of a horizontal layer of a heavy incompressible fluid of variable density p 0 in the vertical direction is stable or unstable according as d p o /dz (z being the...
Publication Info
- Year
- 1990
- Type
- article
- Volume
- 19
- Issue
- 3
- Pages
- 467-471
- Citations
- 6
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
6
OpenAlex
Cite This
Nader H. Bshouty
(1990).
Maximal Rank of $m\times n\times(mn-k)$ Tensors.
SIAM Journal on Computing
, 19
(3)
, 467-471.
https://doi.org/10.1137/0219031
Identifiers
- DOI
- 10.1137/0219031