OpenAlex ·

Upper Bounds on the Comon Rank Gap of Real Symmetric Third-Order Tensors

Jianze Li

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.14002
Original
Read it at the publisher
Topics
Computational ComplexityCombinatoricsNumerical Analysis

Abstract

Let $T$ be a nonzero real symmetric third-order tensor. Denote by $r(T)$ its CP rank, by $s(T)$ its symmetric rank, by $d(T)$ its essential dimension, and put $e(T)=r(T)-d(T)$. We establish two complementary upper bounds for the Comon rank gap $$Δ(T):= s(T)-r(T)\leq\min\{C_{ec}(e(T)),\ C_{dc}(d(T))\}.$$ The excess-controlled function $C_{ec}(e)$ is zero for $0\leq e\leq3$ and equals $9e-3$ for $e\geq4$. In particular, the equality $C_{ec}(e(T))=0$ for $0\leq e\leq3$ extends Friedland's flattening-rank criterion for real symmetric third-order tensors by two additional rank layers. The dimension-controlled function $C_{dc}(d)$ is zero for $d=0$, equals $(d^2-4d+10)/3$ for $1\leq d\leq18$, and equals $d^2/4+d/4+3/2$ for $d\geq19$. The excess estimate follows from the alternating equations and decomposable-bivector support geometry; a low-wedge descent gives the vanishing range $e\leq3$. The dimension estimate combines a transverse polar-completion bound with a shifted estimate for the maximum real Waring rank. Thus the two bounds measure different features of the same tensor and remain effective in complementary regimes.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics