A linear gap for the maximal cp-rank

Yair Lavi

Source record

Source: arXiv

Published: Oct 1, 2026

arXiv: 2610.02289

Open original source ↗

Source abstract

We prove that the maximal cp-rank $p_n$ satisfies $p_n\ge n(n-3)/2$ for odd $n\ge5$ and $p_n\ge n(n-3)/2-1$ for even $n\ge6$ . Together with the known upper bound $p_n\le\binom{n+1}{2}-4$ , this gives $p_n=n^2/2+O(n)$ .

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.