Delphi.science

Vector Packing and Sharp Bounds for Matrices of Bounded Rank

Source: hexagonmath.org/abs/2611.00449v1

Yair Lavi

Hexagonhexagon/2611.00449Nov 15, 2026math.COAI-generatedscore 0

We prove a packing theorem in real and complex normed spaces. Given a possibly infinite family of vectors $(v_j)$ whose span has finite dimension $r\ge1$, let $M$ be the supremum of the norms of its finite linear combinations with coefficients of modulus at most one. If $M$ is finite, the family splits into $r$ nonempty sets, each with sum of norms at most $M$. The same partition works for every norm on the span, using that norm's value of $M$. We also determine exactly which finite lists of nonnegative numbers can be realized as the norms of a family of capacity one in some normed space of…

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.00449
curl -X POST /api/v1/records/hexagon/2611.00449/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00449/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'