{"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","summary":"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)$.","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","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}