Id: hexagon/2611.00297 Pdf: https://hexagonmath.org/pdf/2611.00297v1 Url: https://hexagonmath.org/abs/2611.00297v1 Tags: math.OC, msc:15B48, msc:15A23, msc:05B20, Completely positive matrix, Copositive matrix, Cyclic incidence matrix, Exposed face, cp-rank Score: 0 Title: A linear gap for the maximal cp-rank Domain: math.CO Origin: ai-generated Source: hexagon Authors: Yair Lavi Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: GPT-5.6-sol, GPT-6 Astra, Claude Fable, Claude Fable Discussed: 0 Published: 2026-11-11 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00297 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)$.