Related papers: Play Ground for Victor's Magic Squares
We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…
We discuss some applications of an intrinsic multipication in the space of simple loops in a surface.
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…
This paper aims to develop the mathematical representation of a surface generated by elliptical arcs joining the sides of a regular polygon to a point lying vertically upward on the central axis of the polygon. The volume of the…
An additive-multiplicative magic square is a square grid of numbers whose rows, columns, and long diagonals all have the same sum (called the magic sum) and the same product (called the magic product). There are numerous open problems about…
In this expository article, we survey the rapidly emerging area of random geometric simplicial complexes.
We consider generalizations of the familiar fifteen-piece sliding puzzle on the 4 by 4 square grid. On larger grids with more pieces and more holes, asymptotically how fast can we move the puzzle into the solved state? We also give a…
We describe a generalization of most-perfect magic squares, called type-p most-perfect squares, and in prime-power orders we give a linear construction of these squares reminiscent of de la Loubere's classical magic square construction…
By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…
In this article we survey some of the recent developments in the structure theory of set addition.
The purpose of this paper is to construct topology on vague soft sets. The concept of vague soft topology is introduced and its basic properties are given.
Finite field transforms have many applications and, in many cases, can be implemented with a low computational complexity. In this paper, the Z Transform over a finite field is introduced and some of its properties are presented.
We give a simple construction of an orthogonal basis for the space of m by n matrices with row and column sums equal to zero. This vector space corresponds to the affine space naturally associated with the Birkhoff polytope, contingency…
A perspective on charm physics, emphasizing recent developments, future prospects, and the interplay with lattice QCD.
In this paper we provide a case study of the use of relatively sophisticated mathematics and algorithms to redefine and adapt a simple traditional game/puzzle to exploit the computational power of smart devices. The focus here is not so…
In this paper, we introduce the concept of triad. Using this notion, we study, revisit, discover and rediscover some basic properties of ludics from a very general point of view.
This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.
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.
We present systematic methods of constructing pandiagonal sudoku squares of order k*k and Knut Vik sudoku squares of order k*k not divisible by 2 or 3. Pandiagonal magic squares are constructed from these squares. Examples of all these…