What Is a Pseudo-Orthogonal Matrix?

  • Thread starter Thread starter orthogonal
  • Start date Start date
  • Tags Tags
    Matrix
Click For Summary
A pseudo-orthogonal matrix is defined as a binary matrix with equal numbers of ones in each row and column, where any two rows share exactly one column with a one. The discussion explores whether this matrix type has a formal name and its potential applications, particularly in error-correcting codes and games like Spot It! The user has successfully generated matrices up to order 6 but struggles with order 7 due to computational challenges. Suggestions include investigating eigenvalues and related mathematical concepts. The conversation highlights a growing interest in the geometric properties of these matrices.
orthogonal
Messages
10
Reaction score
0
Hey all, I have been playing around with a special type of matrix and am wondering if anyone knows of some literature about it. I have been calling it a pseudo-orthogonal matrix but would like to learn if it has a real name or if we can come up with a better name. The characteristics of the matrix are as follows:
1) The matrix is composed of only ones and zeros
2) Each row and each column have the same number of ones in it. (If there are 3 ones in each row/column then I call a 3rd order matrix)
3) Between any two rows, there is one and only one common column with a one.

Here is an example of what I call a 3rd order pseudo-orthogonal matrix. Let's call him 'M'
1 1 1 0 0 0 0
1 0 0 1 1 0 0
1 0 0 0 0 1 1
0 1 0 1 0 1 0
0 1 0 0 1 0 1
0 0 1 1 0 0 1
0 0 1 0 1 1 0

I call it a pseudo inverse because inv(M) = M/2-1/6 , i.e. with adding and multiplying by constants I can arrive at the inverse of M.

Has anyone played with something like this before? I am hoping to gleen information to help me generate higher order matrices of this type.
 
Physics news on Phys.org
Hey orthogonal and welcome to the forums.

I've never played with this kind of thing (I haven't had to): do you have a reason for doing this: (pure curiosity or do you have an application in mind)?

I don't know whether this would help but error correcting code matrices (in binary XOR) might share common properties with this (it's just a hunch and its probably wrong anyway, but you never know!).
 
I am working on the applications but I found the matrix by analyzing the matching card game Spot it! It is a card game which has 8 symbols per card with one and only one matching symbol between any two cards. If you follow the link above you can play a demo.
 
I have some findings to report:

I have written a program which can generate up to order 6 successfully, but when my code attempts to do order 7 it chokes (24 hours + with no solution returned!).

After googling around some more I found a poster presentation which describes the problem using mutually orthogonal Latin squares. It looks like I have some reading to do to catch up on all this higher order geometry stuff.
 
I am studying the mathematical formalism behind non-commutative geometry approach to quantum gravity. I was reading about Hopf algebras and their Drinfeld twist with a specific example of the Moyal-Weyl twist defined as F=exp(-iλ/2θ^(μν)∂_μ⊗∂_ν) where λ is a constant parametar and θ antisymmetric constant tensor. {∂_μ} is the basis of the tangent vector space over the underlying spacetime Now, from my understanding the enveloping algebra which appears in the definition of the Hopf algebra...

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
4K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 14 ·
Replies
14
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
2
Views
2K