Startseite Tensor decompositions and rank increment conjecture
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Tensor decompositions and rank increment conjecture

  • Eugene E. Tyrtyshnikov EMAIL logo
Veröffentlicht/Copyright: 13. August 2020

Abstract

Some properties of tensor ranks and the non-closeness issue of sets with given restrictions on the rank of tensors entering those sets are studied. It is proved that the rank of the d-dimensional Laplacian equals d. The following conjecture is formulated: for any tensor of non-maximal rank there exists a nonzero decomposable tensor (tensor of rank 1) such that the rank increases by one after adding this tensor. In the general case, it is proved that this property holds algebraically almost everywhere for complex tensors of fixed size whose rank is strictly less than the generic rank.

MSC 2010: 15A69

Acknowledgment

The author is grateful to Martin Mohlenkamp for discussion of the problem of the Laplacian and the proposed idea allowing us to obtain the proof.

  1. Funding: The work was supported by the Russian Science Foundation (project No. 19–11–00338).

References

[1] M. D. Atkinson and S. Lloyd, Bounds on the rank of 3-tensors. Linear Algebra Appl. 31 (1980), 19–31.10.1016/0024-3795(80)90202-5Suche in Google Scholar

[2] M. D. Atkinson and N. M. Stephens, On the maximal multiplicative complexity of a family of bilinear forms. Linear Algebra Appl. 27 (1979), 1–8.10.1016/0024-3795(79)90026-0Suche in Google Scholar

[3] D. Bini, G. Lotti, and F. Romani, Approximate solutions for the bilinear form computational problem. SIAM J. Comput. 9 (1980), 692–697.10.1137/0209053Suche in Google Scholar

[4] G. Bleckerman and Z. Teitler, On maximal, typical, and generic ranks. arXiv: 1402.2371v1 [math.AG] 11 February 2014.Suche in Google Scholar

[5] P. Comon, Tensor decompositions: State of the art and applications. In Mathematics in Signal Processing V (Coventry, UK, 2000), Inst. Math. Appl. Conf. Ser. 71, Oxford University Press, Oxford, UK, 2002, pp. 1–24.Suche in Google Scholar

[6] D. Cox, J. Little, and D. O’Shea, Ideals, Varieties, Algorithms. 3rd ed. Springer, 2007.10.1007/978-0-387-35651-8Suche in Google Scholar

[7] L. De Lathauwer, B. De Moor, and J. Vandewalle, A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl. 21 (2000), 1253–1278.10.1137/S0895479896305696Suche in Google Scholar

[8] V. De Silva and L.-H. Lim, Tensor rank and the ill-posedness of the best low-rank approximation problem. SIAM J. Matrix Anal. 30 (2008) No. 3, 1084–1127.10.1137/06066518XSuche in Google Scholar

[9] S. Friedland, On the generic and typical ranks of 3-tensors. Linear Algebra Appl. 436 (2012), No. 3, 478–497.10.1016/j.laa.2011.05.008Suche in Google Scholar

[10] F. L. Hitchcock, The expression of a tensor or a polyadic as a sum of products. J. Math. Phys. 6 (1927), 164–189.10.1002/sapm192761164Suche in Google Scholar

[11] T. Lickteig, Typical tensorial rank. Linear Algebra Appl. 69 (1985), 95–120.10.1016/0024-3795(85)90070-9Suche in Google Scholar

[12] V. Strassen, Rank and optimal computation of generic tensors. Linear Algebra Appl. 52-53 (1983), 645–685.10.1016/0024-3795(83)90041-1Suche in Google Scholar

[13] E. E. Tyrtyshnikov, Matrix Analysis and Linear Algebra. Fizmatlit, 2007 (in Russian).Suche in Google Scholar

[14] E. Tyrtyshnikov, Preservation of linear constraints in approximation of tensors. Numer. Math. Theor. Meth. Appl. 2 (2009), 421–426.10.4208/nmtma.2009.m9004sSuche in Google Scholar

[15] E. E. Tyrtyshnikov, Fundamentals of Algebra. Fizmatlit, 2017 (in Russian).Suche in Google Scholar

Received: 2020-03-17
Accepted: 2020-05-22
Published Online: 2020-08-13
Published in Print: 2020-08-26

© 2020 Walter de Gruyter GmbH, Berlin/Boston

Heruntergeladen am 9.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/rnam-2020-0020/html
Button zum nach oben scrollen