Using the sawtooth map as the basis of a coupled map lattice enables simple analytic results to be obtained for the global Lyapunov spectra of a number of standard lattice networks. The results presented can be used to enrich a course on chaos or dynamical systems by providing tractable examples of higher dimensional maps and links to a number of…

In this case study we explored how a mathematician's teaching of the Cauchy-Riemann (CR) equations actualized the virtual aspects of the equations. Using videotaped classroom data, we found that in a three-day period, this mathematician used embodiment to animate and bind formal aspects of the CR equations (including conformality), metaphors,…

Almost all finite groups encountered by undergraduates can be represented as multiplicative groups of concise block-diagonal binary matrices. Such representations provide simple examples for beginning a group theory course. More importantly, these representations provide concrete models for "abstract" concepts. We describe Maple lab…

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…

A stochastic matrix is a square matrix with nonnegative entries and row sums 1. The simplest example is a permutation matrix, whose rows permute the rows of an identity matrix. A permutation matrix and its inverse are both stochastic. We prove the converse, that is, if a matrix and its inverse are both stochastic, then it is a permutation matrix.

A certain weighted average of the rows (and columns) of a nonnegative matrix yields a surprisingly simple, heuristical approximation to its singular vectors. There are correspondingly good approximations to the singular values. Such rules of thumb provide an intuitive interpretation of the singular vectors that helps explain why the SVD is so…

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…

This article outlines a problem-centered approach to the topic of canonical matrix forms in a second linear algebra course. In this approach, abstract theory, including such topics as eigenvalues, generalized eigenspaces, invariant subspaces, independent subspaces, nilpotency, and cyclic spaces, is developed in response to the patterns discovered…

The central goals of most introductory linear algebra courses are to develop students' proficiency with matrix techniques, to promote their understanding of key concepts, and to increase their ability to make connections between concepts. In this article, we present an innovative method using adjacency matrices to analyze students' interpretation…

This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show…

This article could be of interest to teachers of applied mathematics as well as to people who are interested in applications of linear algebra. We give a comprehensive study of linear systems from an application point of view. Specifically, we give an overview of linear systems and problems that can occur with the computed solution when the…

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.

This student research project explores the properties of a family of matrices of zeros and ones that arises from the study of the diagonal lengths in a regular polygon. There is one family for each n greater than 2. A series of exercises guides the student to discover the eigenvalues and eigenvectors of the matrices, which leads in turn to…

Through a series of six guided classroom discoveries, students create, via targeted questions, a definition for deciding when two sets have the same cardinality. The program begins by developing basic facts about cardinalities of finite sets. Extending two of these facts to infinite sets yields two statements on comparing infinite cardinalities…

In a previous study, the onto-semiotic approach was employed to analyse the mathematical notion of different coordinate systems, as well as some situations and university students' actions related to these coordinate systems in the context of multivariate calculus. This study approaches different coordinate systems through the process of change of…