Bordered magic squares: elements for a comprehensive approach
Eduardo Saenz de Cabezon
Abstract
General methods for the construction of magic squares of any order have been searched for centuries. There have been several standard strategies for this purpose, such as the knight movement, or the construction of bordered magic squares, which played an important role in the development of general methods. What we try to do here is to give a general and comprehensive approach to the construction of magic borders, capable of assuming methods produced in the past like particular cases. This general approach consists of a transformation of the problem of constructing magic borders to a simpler - almost trivial - form. In the first section, we give some definitions and notation. The second section consists of the exposition and proof of our method for the diferent cases that appear (theorems 1 and 2). Although methods for the construction of bordered magic squares have always been presented as individual succesful attempts to solve the problem, we will see that a common pattern underlies the fundamental mechanisms that lead to the construction of such squares. This approach provides techniques for constructing many magic bordered squares of any order, which is a first step to construct all of them, and finally know how many bordered squares are for any order. These may be the first elements of a general theory on bordered magic squares.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.