Can the Genericity Assumption Decrease the Rank of a Matrix?

Authors

  • András Recski
    Affiliation
    Department of Computer Science and Information Theory, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, H-1521 Budapest, P. O. B. 91, Hungary
  • Áron Vékássy
    Affiliation
    Department of Computer Science and Information Theory, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, H-1521 Budapest, P. O. B. 91, Hungary
https://doi.org/10.3311/PPee.16647

Abstract

The genericity assumption, supposing that the nonzero parameters of a system are algebraically independent transcendentals over the field of the rationals, often helps for the mathematical modelling of linear systems. Without this condition nonzero expansion members of a determinant can cancel out each other, decreasing the rank of a matrix. In this note we show that under some circumstances an increase is also possible. This counterintuitive phenomenon is explained using some tools from matroid theory, and is illustrated by a classical network of Carlin and Youla.

Keywords:

circuit analysis, linear multiports, genericity

Citation data from Crossref and Scopus

Published Online

2021-02-02

How to Cite

Recski, A., Vékássy, Áron “Can the Genericity Assumption Decrease the Rank of a Matrix?”, Periodica Polytechnica Electrical Engineering and Computer Science, 65(1), pp. 11–14, 2021. https://doi.org/10.3311/PPee.16647

Issue

Section

Articles