Regular, pseudo-regular, and almost regular matrices
Functional Analysis
2007-05-23 v1 Combinatorics
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.
Cite
@article{arxiv.math/0703207,
title = {Regular, pseudo-regular, and almost regular matrices},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:math/0703207},
year = {2007}
}