Friday, December 12, 2014

December 12

Square cells in a rectangular grid; neighborhood defined as edges, vertices, but not self.

From an earlier post, I had these determinants, and I just added more.

For 1 x n, the determinants were:
1x1: 0
1x2: -1
1x3: 0
1x4: 1
1x5: 0
1x6: -1

The pattern: for n equiv 0 (mod 2), the determinant is either -1 or 1. (We have proved this to be true.)


For 2 x n, the determinants were:
1x2: -1

2x2: -3 = -1*3
2x3: 7 (4th prime)
2x4: 5 (3rd prime)
2x5: -33 = -1*3*11
2x6: 13 (6th prime)

2x7: 119 = 7 * 17
2x8: -171 = -1*3*57
2x9: -305 = 5 * 61
It appears that the absolute value of all these determinants is either prime or the product of 2 primes.

And for 3 x n, determinants:
3x3: 0
3x4: 9 = 3^2
3x5: 0

3x6: -497 = 7*71
3x7: 0
3x8: -8687 = 7*241

Thursday, December 11, 2014

December 11

Square cells in a rectangular grid; neighborhood defined as edges, vertices, but not self.

These are the blocks:

0 1 0…
1 0 1…
0 1 0…

1 1 0…
1 1 1…
0 1 1…

0 0 0…
0 0 0…
0 0 0…

To see the pattern, let the first of the blocks be A, the second B, and the third C. 


The 3x3 adjacency matrix:

A B C
B A B
C B A


The 3x4 adjacency matrix:

0 1 0 0 1 1 0 0 0 0 0 0
1 0 1 0 1 1 1 0 0 0 0 0
0 1 0 1 0 1 1 1 0 0 0 0
0 0 1 0 0 0 1 1 0 0 0 0
1 1 0 0 0 1 0 0 1 1 0 0
1 1 1 0 1 0 1 0 1 1 1 0
0 1 1 1 0 1 0 1 0 1 1 1
0 0 1 1 0 0 1 0 0 0 1 1
0 0 0 0 1 1 0 0 0 1 0 0
0 0 0 0 1 1 1 0 1 0 1 0
0 0 0 0 0 1 1 1 0 1 0 1
0 0 0 0 0 0 1 1 0 0 1 0

So, if we think about it in terms of the blocks, a 3x4 looks like:
A B C
B A B
C B A

Which is the same as the 3x3. We can note that the blocks are now 3x4 instead of 3x3 like they were for the 3x3.

Now, let's look at a 4x4:

0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0
1 0 1 0 1 1 1 0 0 0 0 0 0 0 0 0
0 1 0 1 0 1 1 1 0 0 0 0 0 0 0 0
0 0 1 0 0 0 1 1 0 0 0 0 0 0 0 0
1 1 0 0 0 1 0 0 1 1 0 0 0 0 0 0
1 1 1 0 1 0 1 0 1 1 1 0 0 0 0 0
0 1 1 1 0 1 0 1 0 1 1 1 0 0 0 0
0 0 1 1 0 0 1 0 0 0 1 1 0 0 0 0
0 0 0 0 1 1 0 0 0 1 0 0 1 1 0 0
0 0 0 0 1 1 1 0 1 0 1 0 1 1 1 0
0 0 0 0 0 1 1 1 0 1 0 1 0 1 1 1
0 0 0 0 0 0 1 1 0 0 1 0 0 0 1 1
0 0 0 0 0 0 0 0 1 1 0 0 0 1 0 0
0 0 0 0 0 0 0 0 1 1 1 0 1 0 1 0
0 0 0 0 0 0 0 0 0 1 1 1 0 1 0 1
0 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0

If we convert to blocks, the 4x4 looks like:

A B C C
B A B C
C B A B
C C B A

Now, let's think about what the blocks are. A is the 1xn adjacency matrix for square cells in a rectangular grid including edges and not self, and C is all 0s. B is a 1xn adjacency matrix for square cells in a rectangular grid including edges and self. This is interesting.

I'm not sure how we can find the determinant… 

Monday, December 1, 2014

December 1

Square cells in a rectangular grid; neighborhood defined as edges, vertices, but not self.

Let's look at the adjacency matrix for a 3x3.

0 1 0 1 1 0 0 0 0
1 0 1 1 1 1 0 0 0
0 1 0 0 1 1 0 0 0
1 1 0 0 1 0 1 1 0
1 1 1 1 0 1 1 1 1
0 1 1 0 1 0 0 1 1
0 0 0 1 1 0 0 1 0
0 0 0 1 1 1 1 0 1
0 0 0 0 1 1 0 1 0

This seems to be made of the following blocks:

0 1 0
1 0 1
0 1 0

1 1 0
1 1 1
0 1 1

0 0 0
0 0 0
0 0 0

To see the pattern, let the first of the blocks be A, the second B, and the third C. From this, the adjacency matrix for a 3x3 is:

A B C
B A B
C B A

So we see that the diagonal is made up of As.