AbstractWe consider a bimatroid (linking system) which has a natural one-to-one corre-spondence between the row set and the column set. Such bimatroid can be regarded as a combinatorial counterpart of a matrix which is subject to similarity transformations. For such a bimatroid we can consider the power product, introduce the notion of an “eigenset,” which is a combinatorial analogue of an eigenvector, and define the “Jordan type;” in particular, the maximum size of an eigenset is characterized by the rank of the power products
In principal component analysis and related techniques, we approximate (in the least squares sense) ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
Motivated by the study of chained permutations and alternating sign matrices, we investigate partial...
AbstractWe consider a bimatroid (linking system) which has a natural one-to-one corre-spondence betw...
AbstractKönig's theorem asserts that the minimal number of lines (i.e., rows or columns) which conta...
AbstractA bimatroid B between the sets S and T incorporates the combinatorial exchange properties of...
Matrix theory has been one of the most utilised concepts in fuzzy models and neutrosophic models. Fr...
AbstractA combinatorial analogue of the dynamical system theory is developed in a matroid-theoretic ...
AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
AbstractA biclique in a graph Γ is a complete bipartite subgraph of Γ. We give bounds for the maximu...
AbstractWe develop a Tutte decomposition theory for matrices and their combinatorial abstractions, b...
In this paper, we use the product $\bigotimes_h$ in order to study super edge-magic labelings, bi-ma...
To study dynamical systems, graphs are often used to capture the interactions among their components...
AbstractIt is shown that the matrix obtained by applying a matrix bilinear transformation to a compa...
In principal component analysis and related techniques, we approximate (in the least squares sense) ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
Motivated by the study of chained permutations and alternating sign matrices, we investigate partial...
AbstractWe consider a bimatroid (linking system) which has a natural one-to-one corre-spondence betw...
AbstractKönig's theorem asserts that the minimal number of lines (i.e., rows or columns) which conta...
AbstractA bimatroid B between the sets S and T incorporates the combinatorial exchange properties of...
Matrix theory has been one of the most utilised concepts in fuzzy models and neutrosophic models. Fr...
AbstractA combinatorial analogue of the dynamical system theory is developed in a matroid-theoretic ...
AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
AbstractA biclique in a graph Γ is a complete bipartite subgraph of Γ. We give bounds for the maximu...
AbstractWe develop a Tutte decomposition theory for matrices and their combinatorial abstractions, b...
In this paper, we use the product $\bigotimes_h$ in order to study super edge-magic labelings, bi-ma...
To study dynamical systems, graphs are often used to capture the interactions among their components...
AbstractIt is shown that the matrix obtained by applying a matrix bilinear transformation to a compa...
In principal component analysis and related techniques, we approximate (in the least squares sense) ...
A theorem by M. Cohn and A. Lempel, relating the product of certain permutations to the rank of an a...
Motivated by the study of chained permutations and alternating sign matrices, we investigate partial...