In this paper, we reconstruct matrices from their minors, and give explicit formulas for the reconstruction of matrices of orders 2 × 3, 2 × 4, 2 × n, 3 × 6 and m × n. We also formulate the Plücker relations, which are the conditions of the existence of a matrix related to its given minors.

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.

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…

We will prove a well-known theorem in Linear Algebra, that is, for any "m x n" matrix the dimension of row space and column space are the same. The proof is based on the subject of "elementary matrices" and "reduced row-echelon" form of a matrix.

The Lithuanian Informatics Olympiad is a problem solving contest for high school students. The work of each contestant is evaluated in terms of several criteria, where each criterion is measured according to its own scale (but the same scale for each contestant). Several jury members are involved in the evaluation. This paper analyses the problem…

The main purpose of this note is to present and justify proof via iteration as an intuitive, creative and empowering method that is often available and preferable as an alternative to proofs via either mathematical induction or the well-ordering principle. The method of iteration depends only on the fact that any strictly decreasing sequence of…

This note presents geometric and physical interpretations of the sufficient condition for a critical point to be a strict relative extremum: f[subscript xx]f[subscript yy] - f[superscript 2][subscript xy] greater than 0. The role of the double derivative f[subscript xy] in this inequality will be highlighted in these interpretations. (Contains 14…

Benford's law of the "first digits" states that in spite of intuitively expected equal frequency of 1/9 of the decimal digits r = 1, ... , 9 appearance on the first place of any number, various empirical studies show another pattern of these frequencies distribution, which is log[subscript 10](1 + 1/r). The article considers this law and other…

Hill ciphers are linear codes that use as input a "plaintext" vector [p-right arrow above] of size n, which is encrypted with an invertible n x n matrix E to produce a "ciphertext" vector [c-right arrow above] = E [middle dot] [p-right arrow above]. Informally, a near-field is a triple [left angle bracket]N; +, *[right angle bracket] that…

In this note 4 x 4 most-perfect pandiagonal magic squares are considered in which rows, columns and the two main, along with the broken, diagonals add up to the same sum. It is shown that the Moore-Penrose inverse of these squares has the same magic property.

The well-known Frobenius rank inequality established by Frobenius in 1911 states that the rank of the product ABC of three matrices satisfies the inequality rank(ABC) [greater than or equal]rank(AB) + rank(BC) - rank(B) A new necessary and sufficient condition for equality to hold is presented and then some interesting consequences and…

Characteristic polynomials are used to determine when magic squares have magic inverses. A resulting method constructs arbitrary examples of such squares.

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.)

Discussion of models for information retrieval focuses on an application of linear algebra to text clustering, namely, a metric for measuring cluster quality based on the theory that cluster quality is proportional to the number of terms that are disjoint across the clusters. Explains term-document matrices and clustering algorithms. (Author/LRW)

In this note it is shown that the Moore-Penrose inverse of real 3 x 3 matrices can be expressed in terms of the vector product of their columns. Moreover, a simple formula of a generalized inverse is presented, which also involves the vector product.