A second course in linear algebra that goes beyond the traditional lower-level curriculum is increasingly important for students of the mathematical sciences. Although many applications involve only real numbers, a solid understanding of complex arithmetic often sheds significant light. Many instructors are unaware of the opportunities afforded by…

An elementary proof using matrix theory is given for the following criterion: if "F"/"K" and "L"/"K" are field extensions, with "F" and "L" both contained in a common extension field, then "F" and "L" are linearly disjoint over "K" if (and only if) some…

This paper introduces a new matrix tool for the sowing game Tchoukaillon, which establishes a relationship between board vectors and move vectors that does not depend on actually playing the game. This allows for simpler proofs than currently appear in the literature for two key theorems, as well as a new method for constructing move vectors.We…

An involutory matrix is a matrix that is its own inverse. Such matrices are of great importance in matrix theory and algebraic cryptography. In this note, we extend this involution to rhotrices and present their properties. We have also provided a method of constructing involutory rhotrices.

There are usually limited user evaluation of resources on a recommender system, which caused an extremely sparse user rating matrix, and this greatly reduce the accuracy of personalized recommendation, especially for new users or new items. This paper presents a recommendation method based on rating prediction using causal association rules.…

A well known result due to Laplace states the equivalence between two different ways of defining the determinant of a square matrix. We give here a short proof of this result, in a form that can be presented, in our opinion, at any level of undergraduate studies.

This note explains how Emil Artin's proof that row rank equals column rank for a matrix with entries in a field leads naturally to the formula for the nullity of a matrix and also to an algorithm for solving any system of linear equations in any number of variables. This material could be used in any course on matrix theory or linear algebra.

It is a routine matter for undergraduates to find eigenvalues and eigenvectors of a given matrix. But the converse problem of finding a matrix with prescribed eigenvalues and eigenvectors is rarely discussed in elementary texts on linear algebra. This problem is related to the "spectral" decomposition of a matrix and has important technical…

Computing the mean and covariance matrix of some multivariate distributions, in particular, multivariate normal distribution and Wishart distribution are considered in this article. It involves a matrix transformation of the normal random vector into a random vector whose components are independent normal random variables, and then integrating…

The aim of this article is to characterize the 2 x 2 matrices "X" satisfying X[superscript 2] = X + I and obtain some new identities concerning with Fibonacci and Lucas numbers. The recommendations regarding the teaching of the identities given in this article can be presented in two cases. The first is related to the pedagogical aspect. The…

In this note, a method of converting a rhotrix to a special form of matrix termed a "coupled matrix" is proposed. The special matrix can be used to solve various problems involving n x n and (n - 1) x (n - 1) matrices simultaneously.

Most model fit analyses in cognitive diagnosis assume that a Q matrix is correct after it has been constructed, without verifying its appropriateness. Consequently, any model misfit attributable to the Q matrix cannot be addressed and remedied. To address this concern, this paper proposes an empirically based method of validating a Q matrix used…

Using the elementary tools of matrix theory, we show that the product of two rotations in the three-dimensional Euclidean space is a rotation again. For this purpose, three types of rotation matrices are identified which are of simple structure. One of them is the identity matrix, and each of the other two types can be uniquely characterized by…

This paper presents the row-column multiplication of rhotrices that are of high dimension. This is an extension of the same multiplication carried out on rhotrices of dimension three, considered to be the base rhotrices.

As is known, a semi-magic square is an "n x n" matrix having the sum of entries in each row and each column equal to a constant. This note generalizes this notion and introduce a special class of block matrices called "block magic rectangles." It is proved that the Moore-Penrose inverse of a block magic rectangle is also a block magic rectangle.