L-free directed bipartite graphs and echelon-type canonical forms (Q2010504): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Harm Bart / rank | |||
Property / author | |||
Property / author: Bernd Silbermann / rank | |||
Property / author | |||
Property / author: Harm Bart / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Bernd Silbermann / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-030-04269-1_3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2907407462 / rank | |||
Normal rank |
Latest revision as of 18:44, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | L-free directed bipartite graphs and echelon-type canonical forms |
scientific article |
Statements
L-free directed bipartite graphs and echelon-type canonical forms (English)
0 references
27 November 2019
0 references
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].
0 references
echelon canonical form
0 references
zero pattern matrices
0 references
directed bipartite graphs
0 references
partial order
0 references
equivalence classes of matrices
0 references