Related papers: Squaring the magic squares of order 4

Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there…

We prove an effective estimate with a power saving error term for the number of square-tiled surfaces in a connected component of a stratum of quadratic differentials whose vertical and horizontal foliations belong to prescribed mapping…

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…

We study the problem of perfect tiling in the plane and exploring the possibility of tiling a rectangle using integral distinct squares. Assume a set of distinguishable squares (or equivalently a set of distinct natural numbers) is given,…

In this paper we investigate $K$-multimagic squares of order $N$, these are $N \times N$ magic squares which remain magic after raising each element to the $k$ th power for all $2 \leqslant$ $k \leqslant K$. Given $K \geqslant 2$, we…

We investigate the number of squares in a very broad family of binary recurrence sequences with $u_{0}=1$. We show that there are at most two distinct squares in such sequences (the best possible result), except under such very special…

This paper shows that, for matrix multiplications and convolutions, it is possible to asymptotically replace each real multiplication with a single squaring operation. Similarly, a single complex multiplication can be replaced with 3…

In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with…

Lagrange's four-square theorem states that every natural number $n$ can be represented as the sum of four integer squares: $n=x_1^2+x_2^2+x_3^2+x_4^2$. Ramanujan generalized Lagrange's result by providing, up to equivalence, all $54$…

It is known that semi-magic square matrices form a 2-graded algebra or superalgebra with the even and odd subspaces under centre-point reflection symmetry as the two components. We show that other symmetries which have been studied for…

We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.

In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…

We describe how to construct and enumerate Magic squares, Franklin squares, Magic cubes, and Magic graphs as lattice points inside polyhedral cones using techniques from Algebraic Combinatorics. The main tools of our methods are the Hilbert…

Suppose f is a real univariate polynomial of degree D with exactly 4 monomial terms. We present an algorithm, with complexity polynomial in log D on average (relative to the stable log-uniform measure), for counting the number of real roots…

It is well-known that Lagrange's four-square theorem, stating that every natural number may be written as the sum of four squares, may be proved using methods from the classical theory of modular forms and theta functions. We revisit this…

In this paper we study the rotation and spatial inversion symmetry of regular tetrahedron. We obtain the representation matrix, multiplication table,the order of all group elements, all possible combinations of generator elements, the…

In this note explicit algorithms for calculating the exponentials of important structured 4 x 4 matrices are provided. These lead to closed form formulae for these exponentials. The techniques rely on one particular Clifford Algebra…

In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…

We show how to prove theorems in additive number theory using a decision procedure based on finite automata. Among other things, we obtain the following analogue of Lagrange's theorem: every natural number > 686 is the sum of at most 4…

We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.