Regular, pseudo-regular, and almost regular matrices

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2007-03-07
dc.date.accessioned2026-07-07T07:50:51Z
dc.date.available2026-07-07T07:50:51Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/0703207
dc.identifierhttp://arxiv.org/abs/math/0703207
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125307
dc.subjectFunctional Analysis
dc.subjectCombinatorics
dc.subject15A42
dc.titleRegular, pseudo-regular, and almost regular matrices
dc.typetext

Files

Collections

arXiv