Vector Packing and Sharp Bounds for Matrices of Bounded Rank

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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24221694
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Vector Packing and Sharp Bounds for Matrices of Bounded Rank

Yair Lavi
Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
preprint

Vector Packing and Sharp Bounds for Matrices of Bounded Rank

Yair Lavi
preprint en

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.

Zenodo (CERN European Organization for Nuclear Research)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon