Work

Vector Packing and Sharp Bounds for Matrices of Bounded Rank

Year: 2026
Type: preprint
Abstract: We prove a packing theorem in real and complex normed spaces. Given a possibly infinite family of vectors (vj) whose span has finite dimension r ≥ 1, 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 dimension at most k. We also obtain sharp rank-dependent bounds for products of the moduli of the entries on generalized diagonals and the permanent of the entrywise modulus, extending the known nonnegative-matrix bounds to real and complex matrices. The packing theorem also gives sharp support and entropy bounds for doubly stochastic matrices of bounded rank.
Author: Lavi, Yair
Language: English
Open Access status: green
OpenAlex ID: W7231040901
Cites:
Cited by:
Related to: 10