MHB Is a Latin Square always invertible?

  • Thread starter Thread starter Sudharaka
  • Start date Start date
  • Tags Tags
    Inverse Square
Sudharaka
Gold Member
MHB
Messages
1,558
Reaction score
1
Hi everyone, :)

An interesting question I thought about recently. Is it true that a Latin Square of integers (or real numbers) treated as a matrix is always invertible? If not can anybody give a counterexample. I think latin squares are invertible but I am unable to prove it. Hope you can help me out. :)
 
Physics news on Phys.org
Sudharaka said:
Hi everyone, :)

An interesting question I thought about recently. Is it true that a Latin Square of integers (or real numbers) treated as a matrix is always invertible? If not can anybody give a counterexample. I think latin squares are invertible but I am unable to prove it. Hope you can help me out. :)
The smallest counterexample I can come up with is the $6\times6$ circulant matrix $$\begin{bmatrix} 12&4&8&13&3&9 \\4&8&13&3&9&12 \\ 8&13&3&9&12&4 \\ 13&3&9&12&4&8 \\ 3&9&12&4&8&13 \\ 9&12&4&8&13&3 \end{bmatrix}\ .$$ This has determinant zero and is therefore not invertible.
If negative numbers are allowed, the problem is much easier, and the smallest counterexample would be $\begin{bmatrix}1&-1 \\ -1&1\end{bmatrix}.$ In fact, a Latin square matrix whose elements have sum zero is never invertible. Reason: if you add all the other rows of the matrix to the top row then each element of the top row becomes the sum of the elements. If that is zero then the determinant is zero.

More generally, if $x_1,x_2,\ldots,x_n$ are the elements in a circulant matrix, and $\omega$ is a primitive $n$th root of unity, then $x_1 + \omega x_2 + \omega^2x_3 + \ldots + \omega^{n-1}x_n$ is a factor of the determinant of the matrix. If that sum is zero then the matrix will not be invertible. The smallest example I could find where that happens with distinct positive integers for $x_1,x_2,\ldots,x_n$ was when $n=6$, using the numbers $12,4,8,13,3,9$ as in the above matrix.
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top