L-free directed bipartite graphs and echelon-type canonical forms
The authors continue the investigations started on their previuos work [Oper. Theory: Adv. Appl. 259, 79--124 (2017; Zbl 1365.15014)]. Here they introduce several new echelon-like canonical forms of matrices in \(\mathbb{C}^{m\times n}\) and give an algorithm for constructing a typical instance of such canonical forms. They are further interested in studying linear subspaces of matrices in \(\mathbb{C}^{m\times n}\) determined by a pattern of zeros and consider the problem of understanding when the new canonical forms of matrices from these subspaces belong to the same subspace. The main result, Theorem 4.1, provides the affirmative answer to this problem when the pattern of zeros, represented as a directed graph, represents the so-called L-free directed bipartite graph. They also discuss relations with the previous paper [loc. cit.] and apply the new results to count equivalence classes of matrices in \(\mathbb{C}^{m\times n}\). It is worth mentioning that all introduced concepts and the algorithm are well illustrated by examples. For the entire collection see [Zbl 1411.47002].
- Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
- Echelon type canonical forms in upper triangular matrix algebras
- Generic canonical form of pairs of matrices with zeros.
- On the cardinality of a factor set of binary matrices
- The generic canonical form of a regular structured matrix pencil
- Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs
- Realization theory for poset-causal systems: controllability, observability and duality
- Echelon type canonical forms in upper triangular matrix algebras
- Additive decomposition of matrices under rank conditions and zero pattern constraints
This page was built for publication: L-free directed bipartite graphs and echelon-type canonical forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010504)
