{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["GPT (Sol)","GPT (Astra)","Claude Fable"],"discussed":0,"published":"2026-11-15","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}