𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity measures of sign matrices

✍ Scribed by Nati Linial; Shahar Mendelson; Gideon Schechtman; Adi Shraibman

Publisher
Springer-Verlag
Year
2007
Tongue
English
Weight
293 KB
Volume
27
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sign patterns of inverse-positive matric
Sign patterns of inverse-positive matrices
✍ Charles R. Johnson; Frank Thomson Leighton; Herbert A. Robinson πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 411 KB
Sign patterns of nonnegative normal matr
Sign patterns of nonnegative normal matrices
✍ Zhongshan Li; Frank Hall; Fuzhen Zhang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 891 KB

By a nonnegative sign pattern we mean a matrix whose entries are from the set { +, 0). A nonnegative sign pattern A is said to allow normality if there is a normal matrix B whose entries have signs indicated by A. In this paper the combinatorial structure of nonnegative normal matrices, in particula

On the sign pattern of network matrices
On the sign pattern of network matrices
✍ David P. Brown; Myril B. Reed πŸ“‚ Article πŸ“… 1962 πŸ› Elsevier Science 🌐 English βš– 426 KB

Any synthesis process based on a node-pair or mesh matrix must take cognizance of the sign pattern of the matrix. It is proved in general terms in this paper that: (1) the only subgraph of a connected graph G wbich need be of concern in studying the sign pattern of the node-pair (mesh) matrix is th