Related papers: DIGITAL ERA: Universal Bimagic Squares
This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…
A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that…
This article looks at the eigenvalues of magic squares generated by the MATLAB's magic($n$) function. The magic($n$) function constructs doubly even ($n = 4k$) magic squares, singly even ($n = 4k+2$) magic squares and odd ($n = 2k+1$) magic…
This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$.…
Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $\mathbb{Z}$ and $\mathbb{Z}^2$ based on the binary alphabet $\{0,1\}$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane…
We find by applying MacMahon's partition analysis that all magic squares of order three, up to rotations and reflections, are of two types, each generated by three basis elements. A combinatorial proof of this fact is given.
P. J. Federico used the term low-order for perfect squared squares with at most 28 squares in their dissection. In 2010 low-order compound perfect squared squares (CPSSs) were completely enumerated. Up to symmetries of the square and its…
This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…
We give an overview of universal quadratic forms and lattices, focusing on the recent developments over the rings of integers in totally real number fields. In particular, we discuss indecomposable algebraic integers as one of the main…
Quadratic forms over Z that represent all positive integers are called universal. Starting with Ramanujan, 54 universal quaternary quadratic forms without cross product terms were discovered. The form that is the sum of four squares was…
Using equivariant geometry, we find a universal formula that computes the number of times a general cubic surface arises in a family. As applications, we show that the PGL(4) orbit closure of a generic cubic surface has degree 96120, 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…
Bicubic four-sided patches are widely used in computer graphics, CAD/CAM systems etc. Their flexibility is high and enables to compress a surface description before final rendering. However, computer graphics hardware supports only…
A grand unification model with a single $E_8$ gauge superfield in 10 dimensions is presented. It is shown that, through the orbifold $T^6/(\mathbb{Z}_6\times \mathbb{Z}_2)$ and its corresponding Wilson lines, the symmetry is broken to the…
We present an integrated version of the global program proving that every prescribed prime \(q_0\ge 5\) occurs in some \(3\times 3\) magic square whose nine entries are distinct positive primes. The manuscript explicitly corrects the four…
In this paper we construct new Griesmer codes of dimension $k\geq 5$ by means of some geometric methods such as projective dual and geometric puncturing.
A celebrated theorem of Hopf, Bott, Milnor, and Kervaire states that every finite-dimensional real division algebra has dimension 1, 2, 4, or 8. While the real division algebras of dimension 1 or 2 and the real quadratic division algebras…
We initiate the study of chromatic numbers for contact graphs of configurations of integer-sized cuboids in three dimensions, all of which are mutually congruent. Disallowing rotations, we show a global upper bound of 8 for the chromatic…
Choi Seok-Jeong studied Latin squares at least 60 years earlier than Euler although this was less known. He introduced a pair of orthogonal Latin squares of order 9 in his book. Interestingly, his two orthogonal non-double-diagonal Latin…
Similar to how standard Young tableaux represent paths in the Young lattice, Latin rectangles may be use to enumerate paths in the poset of semi-magic squares with entries zero or one. The symmetries associated to determinant preserve this…