We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients modulo 2 represented by {0,1}. The determinant of the above matrix is then closely related to the Thue-Morse sequence counting digits modulo 2 of binary integers.
Using recurrence matrices, defined and described with some details, we study a few determinants related to evaluations of binomial coefficients on Dirichlet characters modulo 2, 4 and 8.
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland Bacher [J. Théorie Nombres Bordeaux 13 (2001), to appear; see http://arxiv.org/abs/math.CO/0109013].
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the determinant of binary Toeplitz matrices for the enumeration of even and odd permutations of different types are given.
Due to their rich algebraic structures and various applications, circulant matrices have been of interest and continuously studied. In this paper, the notions of Binomial-related matrices have been introduced. Such matrices are circulant matrices whose the first row is the coefficients of $(x+zy)^n$, where $z$ is a complex number of norm $1$ and $n$ is a positive integer. In the case where $z\in \{1,-1,i,-i\}$, the explicit formula for the determinant of such matrices are completely determined. Known results on the determinants of binomial circulant matrices can be viewed as special cases. Fin…
This paper treats two topics: matrices with sign patterns and Jacobians of certain mappings. The main topic is counting the number of plus and minus coefficients in the determinant expansion of sign patterns and of these Jacobians. The paper is motivated by an approach to chemical networks initiated by Craciun and Feinberg. We also give a graph-theoretic test for determining when the Jacobian of a chemical reaction dynamics has a sign pattern.
We prove two inequalities regarding the ratio $\det(A+D)/\det A$ of the determinant of a positive-definite matrix $A$ and the determinant of its perturbation $A+D$. In the first problem, we study the perturbations that happen when positive matrices are added to diagonal blocks of the original matrix. In the second problem, the perturbations are added to the inverses of the matrices.
Circulant matrices over finite fields and over commutative finite chain rings have been of interest due to their nice algebraic structures and wide applications. In many cases, such matrices over rings have a closed connection with diagonal matrices over their extension rings. In this paper, the determinants of diagonal and circulant matrices over commutative finite chain rings $R$ with residue field $\mathbb{F}_q$ are studied. The number of $n\times n$ diagonal matrices over ${R}$ of determinant $a$ is determined for all elements $a$ in $ {R}$ and for all positive integers $n$. Subsequently, …
In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a fixed determinant $a$ is determined for all $a\in {R}$ and positive integers $n$. Using the fact that every commutative finite principal ideal ring is a product of commutative finite chain rings, the number of $n\times n$ matrices of a fixed determinant over a commutative finite principal ideal ring is shown to be multiplicative, and hence, it can be determine…
We study algebraic properties of matrices whose rows are mutual neighbours, and are also neigbours of 0 ("neighbour" in the sense of a certain nilpotency condition). The intended application is in synthetic differential geometry. For a square matrix of this kind, the product of the diagonal entries equals the determinant, modulo a factor n!
We investigate the least common multiple of all subdeterminants, lcmd(A x B), of a Kronecker product of matrices, of which one is an integral matrix A with two columns and the other is the incidence matrix of a complete graph with n vertices. We prove that this quantity is the least common multiple of lcmd(A) to the power n-1 and certain binomial functions of the entries of A.
In this paper, we considered the theory of quasideterminants and row and column determinants. We considered the application of this theory to the solving of a system of linear equations in quaternion algebra. We established correspondence between row and column determinants and quasideterminants of matrix over quaternion algebra.
One of the aims of this paper is to provide a short survey on the Z2-graded, the symmetric and the left (right) generalizations of the classical determinant theory for square matrices with entries in an arbitrary (possibly non-commutative) ring. This will put us in a position to give a motivation for our main results. We use the preadjoint matrix to exhibit a general trace expression for the symmetric determinant. The symmetric version of the classical Newton trace formula is also presented in the 3x3 case.
Denote $Σ_n$ and $Q_n$ the set of all $n \times n$ symmetric and skew-symmetric matrices over a field $\mathbb{F}$, respectively, where $char(\mathbb{F})\neq 2$ and $\lvert \mathbb{F} \rvert \geq n^2+1$. A characterization of $ϕ,ψ:Σ_n \rightarrow Σ_n$, for which at least one of them is surjective, satisfying $$\det(ϕ(x)+ψ(y))=\det(x+y)\qquad(x,y\in Σ_n)$$ is given. Furthermore, if $n$ is even and $ϕ,ψ:Q_n \rightarrow Q_n$, for which $ψ$ is surjective and $ψ(0)=0$, satisfy $$\det(ϕ(x)+ψ(y))=\det(x+y)\qquad(x,y\in Q_n),$$ then $ϕ=ψ$ and $ψ$ must be a bijective linear map preserving the determina…
We consider several extensions of the Maillet determinant studied by Malo, Turnbull, and Carlitz and Olson, and derive properties of the underlying matrices. In particular, we compute the eigenvectors and eigenvalues of these matrices, which yield formulas for these new determinants.
Suppose a map $ϕ$ on the set of positive definite matrices satisfies $\det(A+B)=\det(ϕ(A)+ϕ(B))$. Then we have $${\rm tr}(AB^{-1}) = {\rm tr}(ϕ(A){ϕ(B)}^{-1}).$$ Through this viewpoint, we show that $ϕ$ is of the form $ϕ(A)= M^*AM$ or $ϕ(A)= M^*A^tM$ for some invertible matrix $M$ with $\det (M^*M)=1$. We also characterize the map $ϕ: \mathcal{S} \rightarrow \mathcal{S}$ preserving the determinant of convex combinations in $\mathcal{S}$ by using similar method. Here $\mathcal{S}$ can be the set of complex matrices, positive definite matrices, symmetric matrices, and upper triangular matrices.
Let $\det_2(A)$ be the block-wise determinant (partial determinant). We consider the condition for completing the determinant $\det(\det_2(A)) = \det(A),$ and characterize the case for an arbitrary Kronecker product $A$ of matrices over an arbitrary field. Further insisting that $\det_2(AB)=\det_2(A)\det_2(B)$, for Kronecker products $A$ and $B$, yields a multiplicative monoid of matrices. This leads to a determinant-root operation $\text{Det}$ which satisfies $\text{Det}(\text{Det}_2(A)) = \text{Det}(A)$ when $A$ is a Kronecker product of matrices for which $\text{Det}$ is defined.
Let $M$ be an $mn\times mn$ matrix over a commutative ring $R$. Divide $M$ into $m \times m$ blocks. Assume that the blocks commute pairwise. Consider the following two procedures: (1) Evaluate the $n \times n$ determinant formula at these blocks to obtain an $m \times m$ matrix, and take the determinant again to obtain an element of $R$; (2) Take the $mn \times mn$ determinant of $M$. It is known that the two procedures give the same element of $R$. We prove that if only certain pairs of blocks of $M$ commute, then the two procedures still give the same element of $R$, for a suitable definiti…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a Toeplitz matrix and a unipotent upper triangular matrix. The determinant of a generalized Pascal matrix equals thus the determinant of a Toeplitz matrix. This equality allows us to evaluate a few determinants of generalized Pascal matrices associated to certain sequences. In particular, we obtain families of quasi-Pascal matrices whose principal minors generate an…
Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the determinantal polynomial P_{M} of M with respect to the basis. It is a homogeneous polynomial of degree n in d indeterminates that gives the determinant of any element of M by evaluation in K^d. This paper investigates the interrelationship of M and P_{M}. We confine ourselves to finite fields K, where we can obtain useful information by applying the Lang-Wei…