We present an algorithm for a matrix-based Enigma-type encoder based on a variation of the Hill Cipher as an application of 2 × 2 matrices. In particular, students will use vector addition and 2 × 2 matrix multiplication by column vectors to simulate a matrix version of the German Enigma Encoding Machine as a basic example of cryptography. The…

Given three planes in space, a complete characterization of their intersection is provided. Special attention is paid to the case when the intersection set does not exist of one point only. Besides the vector cross product, the tool of generalized inverse of a matrix is used extensively.

We present a short-term class project used in an introductory linear algebra course, designed to engage students in matrix algebra. In this activity, students responded to a survey of their pop culture tastes. Using the survey responses, they worked to design a series of matching algorithms, using matrices, with the goal of matching the students…

Usually a student learns to solve a system of linear equations in two ways: "substitution" and "elimination." While the two methods will of course lead to the same answer they are considered different because the thinking process is different. In this paper the author solves a system in these two ways to demonstrate the…

Most students complete their first and only course in linear algebra with the understanding that a real, square matrix "A" has an inverse if and only if "rref"("A"), the reduced row echelon form of "A", is the identity matrix I[subscript n]. That is, if they apply elementary row operations via the Gauss-Jordan algorithm to the partitioned matrix…

This paper describes a case study of two pure mathematicians who flipped their lecture to teach matrix determinants in two large mathematics service courses (one at Stage I and the other at Stage II). The purpose of the study was to transform the passive lecture into an active learning opportunity and to introduce valuable mathematical skills,…

This thesis investigates and develops a few acceleration techniques for the search engine algorithms used in PageRank and HITS computations. PageRank and HITS methods are two highly successful applications of modern Linear Algebra in computer science and engineering. They constitute the essential technologies accounted for the immense growth and…

The Hill cipher is the simplest example of a "block cipher," which takes a block of plaintext as input, and returns a block of ciphertext as output. Although it is insecure by modern standards, its simplicity means that it is well suited for the teaching of such concepts as encryption modes, and properties of cryptographic hash functions. Although…

Two methods for solving matrix equations are discussed. Both operate entirely on a matrix level. (MNS)

This note presents a brief and partial review of the work of Broom, Cannings and Vickers [1]. It also presents some simple examples of an extension of the their formalism to non-symmetric matrices. (Contains 1 figure.)

Two statements concerning magic squares, considered as 3x3 matrices, are discussed and their proofs given using only high school level techniques. (MP)

A lively example to use in a first course in linear algebra to clarify vector space notions is the space of square matrices of fixed order with its subspaces of affine, coaffine, doubly affine, and magic squares. In this note, the projection theorem is illustrated by explicitly constructing the orthogonal projections (in closed forms) of any…