𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sign Matrices and Realizability of Conductance Matrices

✍ Scribed by Biorci, G.

Book ID
119746555
Publisher
Institution of Electrical Engineers
Year
1961
Weight
468 KB
Volume
108
Category
Article
ISSN
0369-8904

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the realizability of fundamental circ
On the realizability of fundamental circuit matrices
✍ Yoji Kajitani πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 672 KB

This paper presents a necessary and sufltcient condition for the realizability of the fundamental circuit matrix without construction of the corresponding graph. The result affords an eficient algorithm of realizing the graphs with a given fundamental circuit matrix. The idea is mainly based upon th

Realization of Matrices and Directed Gra
Realization of Matrices and Directed Graphs
✍ Rajeev Motwani πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 182 KB

We consider the problem of constructing a matrix with prescribed row and Γ„ 4 column sums, subject to the condition that the off-diagonal entries are in 0, 1 and the diagonal entries are nonnegative integers. The pair of row and column sum vectors is called realizable if such a matrix exists. This is

Determinants and alternating sign matric
Determinants and alternating sign matrices
✍ David P Robbins; Howard Rumsey Jr. πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 666 KB

Let M be an n by n matrix. By a connected minor of M of size k we mean a minor formed from k consecutive rows and k consecutive columns. We give formulas for det M in terms of connected minors, one involving minors of two consecutive sizes and one involving minors of three consecutive sizes. The for

Alternating Sign Matrices and Tournament
Alternating Sign Matrices and Tournaments
✍ Robin Chapman πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 153 KB

We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments by giving an algorithmic construction of such a bijection.