Id: hexagon/2611.00449 Pdf: https://hexagonmath.org/pdf/2611.00449v1 Url: https://hexagonmath.org/abs/2611.00449v1 Tags: math.FA, msc:46B07, msc:15A15, msc:15A45, msc:15B51, msc:52A21, Stochastic matrix, Vector packing, entropy, majorization Score: 0 Title: Vector Packing and Sharp Bounds for Matrices of Bounded 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 (Sol), GPT (Astra), Claude Fable Discussed: 0 Published: 2026-11-15 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00449 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…