Related papers: Determinant and inverse of join matrices on two se…
Let $B$ and $C$ be square complex matrices. The differential equation \begin{equation*} x''(t)+Bx'(t)+Cx(t)=f(t) \end{equation*} is considered. A solvent is a matrix solution $X$ of the equation $X^2+BX+C=\mathbf0$. A pair of solvents $X$…
We study the problem of determining a matrix whose $k$th multiplicative compound is a prescribed matrix~$M$. The cardinality of the set of matrices whose $k$th multiplicative compound equals~$M$ is characterized in terms of $\rank(M)$. On…
This work presents closed formulas for determinant, permanent, inverse, and Drazin inverse of circulant matrices with two non-zero coefficients.
Suppose a map $\phi$ on the set of positive definite matrices satisfies $\det(A+B)=\det(\phi(A)+\phi(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(\phi(A){\phi(B)}^{-1}).$$ Through this viewpoint, we show that $\phi$ is of the form…
A description of the endomorphisms of semidirect products of two groups as a group of $2\times 2$ matrices of maps is already known. Using this description, we have studied the concept of determinant for the endomorphisms of semidirect…
Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…
A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…
This note provides formula for determinant and inverse of r-circulant matrices with general sequences of third order. In other words, the study combines many papers in the literature.
The determinant for complex matrices cannot be extended to quaternionic matrices. Instead, the Study determinant and the closely related $q$-determinant are widely used. We show that the Study determinant can be characterized as the unique…
We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…
In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
A formula expressing the fermionic determinant (a large order polynomial) as an infinite product of smaller determinants is derived and discussed. These smaller determinants are of a fixed size, independent of the size of the lattice and…
This article examines matrices whose entries are determined by recursive relations of the form $A_{i, j} = x A_{i, j-1} + y A_{i-1, j-1} + z A_{i-1, j}$, where $x, y, z$ are constants, and the initial conditions are defined along the first…
The partial automorphism monoid of an inverse semigroup is an inverse monoid consisting of all isomorphisms between its inverse subsemigroups. We prove that a tightly connected fundamental inverse semigroup $S$ with no isolated nontrivial…
We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…
A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…
We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…