Related papers: The Classification of Magic SET Squares
We present a configuration called a magic permutohedron that shows the placement of the numbers of $\{1, 2, 3, \dots, 24\}$ in the vertices of the permutohedra so that the sum of numbers on each square side is 50 and the sum of the numbers…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…
In this paper, we present the problem of counting magic squares and we focus on the case of multiplicative magic squares of order 4. We give the exact number of normal multiplicative magic squares of order 4 with an original and complete…
A formal n-square is the set of positions in an square matrix of size n. A shuffle of a formal n-square consists of independent rotations of each row and of each column. A key result turns out to be valid at least for n <= 34 and n = 37:…
In this paper, we study the concept of "binary color-coded magic squares" by assigning two distinct colors to the even and odd numbers within a magic square. We investigate the uniqueness of patterns within these squares using three…
We present an exact method for counting semi-magic squares of order 6. Some theoretical investigations about the number of them and a probabilistic method are presented. Our calculations show that there are exactly…
Associated to any complex simple Lie algebra is a non-reductive complex Lie algebra which we call the intermediate Lie algebra. We propose that these algebras can be included in both the magic square and the magic triangle to give an…
In this short note we have given an equation based on the date 11.09.2001 and presented some magic squares. The magic squares presented are of order 3x3, 4x4, 5x5, 9x9, 16x16 and 25x25. While the magic square of higher order 9x9, 16x16 and…
A $(p,q,r)$-board that has $pq+pr+qr$ squares consists of a $(p,q)$-, a $(p,r)$-, and a $(q,r)$-rectangle. Let $S$ be the set of the squares. Consider a bijection $f : S \to [1,pq+pr+qr]$. Firstly, for $1 \le i \le p$, let $x_i$ be the sum…
A novel kind of self-referential square matrix is introduced. A certain subset of the matrix entries record the frequencies of occurrence of each distinct number appearing within the entire matrix. Such squares are necessarily elusive. Our…
We consider the notion of a signed magic array, which is an $m \times n$ rectangular array with the same number of filled cells $s$ in each row and the same number of filled cells $t$ in each column, filled with a certain set of numbers…
We propose a neural network-based approach to calculate the value of a chess square-piece combination. Our model takes a triplet (Color, Piece, Square) as an input and calculates a value that measures the advantage/disadvantage of having…
A magic rectangle of order $m\times n$ with precisely $r$ filled cells in each row and precisely $s$ filled cells in each column, denoted $MR(m,n;r,s)$, is an arrangement of the numbers from 0 to $mr-1$ in an $m\times n$ array such that…
I found a novel class of magic square analogue, magic 24-cell. The problem is to assign the consecutive numbers 1 through 24 to the vertices in a graph, which is composed of 24 octahedra and 24 vertices, to make the sum of the numbers of…
When shuffling a deck of cards, one probably wants to make sure it is thoroughly shuffled. A way to do this is by sifting through the cards to ensure that no adjacent cards are the same number, because surely this is a poorly shuffled deck.…
A magic series is a set of natural numbers that, by virtue of its size, sum, and maximum value, could fill a row of a normal magic square. In this paper, we derive an exact two-dimensional integral representation for the number of magic…
We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…
Magic-square constraints define Diophantine systems whose solutions, in several natural families, exhibit rigid periodic structure. We study this structure in an oracle setting, where a marked set of integers is given by black-box access…
We define a natural equivalence relation on collections of cards from the card game SET, and enumerate some of the equivalence classes, vastly generalizing the standard game. On this basis, we describe several alternative games for the SET…