Related papers: Cartesian Magicness of 3-Dimensional Boards

Let $p$ and $q$ be polynomials with degree $2$ over an arbitrary field $\mathbb{F}$. In the first part of this article, we characterize the matrices that can be decomposed as $A+B$ for some pair $(A,B)$ of square matrices such that $p(A)=0$…

We introduce Magic Gems, a geometric representation of magic squares as three-dimensional polyhedra. By mapping an n times n magic square onto a centered coordinate grid with cell values as vertical displacements, we construct a point cloud…

In recreational mathematics, a normal magic square is an $n \times n$ square matrix whose entries are distinctly the integers $1 \ldots n^2$, such that each row, column, and major and minor traces sum to one constant $\mu$. It has been…

The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…

We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half…

A {\em signed magic rectangle} $SMR(m,n;k, s)$ is an $m \times n$ array with entries from $X$, where $X=\{0,\pm1,\pm2,\ldots, $ $\pm (mk-1)/2\}$ if $mk$ is odd and $X = \{\pm1,\pm2,\ldots,\pm mk/2\}$ if $mk$ is even, such that precisely $k$…

A polyhedral map is called $\{p, q\}$-equivelar if each face has $p$ edges and each vertex belongs to $q$ faces. In 1983, it was shown that there exist infinitely many geometrically realizable $\{p, q\}$-equivelar polyhedral maps if $q > p…

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 introduce three "Cayley-Klein" families of Lie algebras through realizations in terms of either real, complex or quaternionic matrices. Each family includes simple as well as some limiting quasi-simple real Lie algebras. Their…

By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…

Let $\mathbb F$ denote a field, and let $V$ denote a vector space over $\mathbb F$ with finite positive dimension. We consider an ordered pair of $\mathbb F$-linear maps $A: V \to V$ and $A^*:V\to V$ such that (i) each of $A,A^*$ is…

This paper studies a generalization of magic squares to finite projective space $\mathbb{P}^n(q)$. We classify at all functions from $\mathbb{P}^n(q)$ into a finite field where the sum along any $r$-flat is $0$. In doing so we show…

Nontransitive dice are dice beating one another in a cyclic way: die A wins die B, B wins C, and C wins A (like in a rock-paper-scissors game). In this article, it has been shown that a structure of mutual wins of 3 nontransitive dice (with…

We find by applying MacMahon's partition analysis that all magic labellings of the cube are of eight types, each generated by six basis elements. A combinatorial proof of this fact is given. The number of magic labellings of the cube is…

We use a representability theorem of G. L. Watson to examine sums of squares in Quaternion rings with integer coefficients. This allows us to determine a large family of such rings where every element expressible as the sum of squares can…

A $(p, q)$-leaper is a fairy chess piece that, from a square $a$, can move to any of the squares $a + (\pm p, \pm q)$ or $a + (\pm q, \pm p)$. Let $L$ be a $(p, q)$-leaper with $p + q$ odd and $C$ a cycle of $L$ within a $(p + q) \times (p…

Motivated by problems in percolation theory, we study the following 2-player positional game. Let $\Lambda_{m \times n}$ be a rectangular grid-graph with $m$ vertices in each row and $n$ vertices in each column. Two players, Maker and…

We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…

In this short paper we have produced different kinds of upside down magic squares based on a palindromic day 11.02.2011. In this day appear only the algorisms 0, 1 and 2. Some of the magic squares are bimagic and some are palindromic. Magic…

Using the geometry of the projective plane over the finite field F_q, we construct a Hermitian Lorentzian lattice L_q of dimension (q^2 + q + 2) defined over a certain number ring $\cO$ that depends on q. We show that infinitely many of…