Regular, pseudo-regular, and almost regular matrices
classification
🧮 math.FA
math.CO
keywords
matricesregularalmostboundsintroducepseudo-regulararbitraryasymptotically
read the original abstract
We give lower bounds on the largest singular value of arbitrary matrices, some of which are asymptotically tight for almost all matrices. To study when these bounds are exact, we introduce several combinatorial concepts. In particular, we introduce regular, pseudo-regular, and almost regular matrices. Nonnegative, symmetric, almost regular matrices were studied earlier by Hoffman, Wolfe, and Hoffmeister.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.