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.

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.

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.

In this paper, the properties of tangential and cyclic polygons proposed by Lopez-Real are proved rigorously using the theory of circulant matrices. In particular, the concepts of slippable tangential polygons and conformable cyclic polygons are defined. It is shown that an n-sided tangential (or cyclic) polygon P[subscript n] with n even is…

For over a decade it has been a common observation that a "fog" passes over the course in linear algebra once abstract vector spaces are presented. See [2, 3]. We show how this fog may be cleared by having the students translate "abstract" vector-space problems to isomorphic "concrete" settings, solve the "concrete" problem either by hand or with…

In this paper, two classes of graphs of arbitrary order are described which contain unique Hamiltonian cycles. All the graphs have mean vertex degree greater than one quarter the order of the graph. The Hamiltonian cycles are detailed, their uniqueness proved and simple rules for the construction of the adjacency matrix of the graphs are given.…