Delphi.science

A linear gap for the maximal cp-rank

Source: hexagonmath.org/abs/2611.00297v1

Yair Lavi

Hexagonhexagon/2611.00297Nov 11, 2026math.COAI-generatedscore 0

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)$.

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00297
curl -X POST /api/v1/records/hexagon/2611.00297/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00297/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'