相关论文: Inversion of the Multiplicative Matrix Compound Op…
Let $K$ be an infinite integral domain and $M_{n}(K)$ be the algebra of all $n\times n$ matrices over $K$. This paper aims for the following goals: Find a basis for the graded identities for elementary grading in $M_{n}(K)$ when the neutral…
In this paper it is shown that a generalized circulant matrix underlies every weakly Coupled Map Lattice (CML), independently of the form of the coupling term. Therefore, this matrix will appear always perturbative methods are used to get…
In this paper natural necessary and sufficient conditions for quantifier elimination of matrix rings $M_n(K)$ in the language of rings expanded by two unary functions, naming the trace and transposition, are identified. This is used…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
The matrix inversion is an interesting topic in algebra mathematics. However, to determine an inverse matrix from a given matrix is required many computation tools and time resource if the size of matrix is huge. In this paper, we have…
In this paper, we use elementary method to give a classification of the multiplicative maps on matrix algebra $M_{n}(\mF)$ over a field $\mF$ of characteristic $0$. All the multiplicative maps are classified into three classes: the trivial…
The application of binary matrices are numerous. Representing a matrix as a mixture of a small collection of latent vectors via low-rank decomposition is often seen as an advantageous method to interpret and analyze data. In this work, we…
We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…
In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of optimality of such decompositions. For some classes of positive…
Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…
This paper presents new approaches for finding the determinant and inverse of a matrix. The choice of pivot selection is kept arbitrary and can be made according to the users need. So the ill conditioned matrices can be handled easily. The…
Under suitable hypotheses on the ground field and on the matrix $M$, we discuss existence, uniqueness and properties of some additive decompositions of $M$ and of its image through a convergent series.
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
A catalogue of all non-isomorphic simple connected regular matroids ${\cal M}$ of cardinality $n \leq 15$ is provided on the net. These matroids are given as binary matrix matroids and are sieved from the large pool of all non-isomorphic…
In this article we present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.
The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…
In this paper we analyse Cline's matrix equation, generalized Penrose's matrix system and a matrix system for k-commutative {1}-inverses. We determine reproductive and non-reproductive general solutions of analysed matrix equation and…
The purpose of this note is to give explicit criteria to determine whether a real generalized Cartan matrix is of finite type, affine type or of hyperbolic type by considering the principal minors and the inverse of the matrix. In…
There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…
We consider the set $\mathcal{M}_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain a new upper bound on the number of matrices from $\mathcal{M}_n(\mathbb Z; H)$ with a given characteristic…