Download this article
 Download this article For screen
For printing
Recent Issues
Vol. 344: 1  2
Vol. 343: 1  2
Vol. 342: 1  2
Vol. 341: 1  2
Vol. 340: 1  2
Vol. 339: 1  2
Vol. 338: 1  2
Vol. 337: 1  2
Online Archive
Volume:
Issue:
     
The Journal
About the journal
Ethics and policies
Peer-review process
 
Submission guidelines
Submission form
Editorial board
Officers
 
Subscriptions
 
ISSN 1945-5844 (electronic)
ISSN 0030-8730 (print)
 
Special Issues
Author index
To appear
 
Other MSP journals
Several remarks on tensor rank computation

Yaroslav Shitov

Vol. 334 (2025), No. 1, 143–151
Abstract

The Waring rank of a homogeneous polynomial f is the smallest number wr ⁡ f for which f is the sum of wr ⁡ f powers of linear forms. We show

wr ⁡ (f ⋅ g) ≤ (wr ⁡ f) ⋅ (wr ⁡ g) ⋅ max ⁡ {deg ⁡ f,deg ⁡ g}if ⁡ wr ⁡ f > 1,wr ⁡ g > 1

and answer a question of Teitler. We also discuss further questions of Koiran and Schaefer regarding the algorithmic computation of tensor ranks.

Keywords
tensor rank, Waring decomposition, algorithms
Mathematical Subject Classification
Primary: 14N07, 15A27, 15A69
Milestones
Received: 3 October 2024
Revised: 5 January 2025
Accepted: 7 January 2025
Published: 23 January 2025
Authors
Yaroslav Shitov
Moscow
Russia

Open Access made possible by participating institutions via Subscribe to Open.