| viXra.org > Combinatorics and Graph Theory > viXra:2301.0017 |
 |
 |
| viXra.org > Combinatorics and Graph Theory > viXra:2301.0017 |
|
|
Combinatorics and Graph Theory |
|
Authors: Elmar Guseinov
Consider the following five matrices corresponding to black and white square patterns: ((0,0,0),(0,0,0),(0,0,0)), ((0,0,0),(1,1,0),(0,1,0)), ((0,1,0),(0,1,0),(0,1,0)), ((0,1,0),(1,1,0),(0,1,0)), ((0,1,0),(1,1,1),(0,1,0)). You can rotate these matrices clockwise and after that choose four of them (possibly repeated) to build up a big 6x6 pattern. How many big patterns can be obtained if the clockwise rotation gives the same big pattern?
Comments: 2 Pages. In Russian
Download: PDF
[v1] 2023-01-04 02:32:49
Unique-IP document downloads: 167 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.
| Third-Party Links: |
|