Related papers: Linear Type-p Most-Perfect Squares
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…
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes.
In an attempt to classify all of the overlap-free morphisms constructively using the Latin-square morphism, we came across an interesting counterexample, the Leech square-free morphism. We generalize the combinatorial properties of the…
In this paper, we present the problem of counting magic squares and we focus on the case of multiplicative magic squares of order 4. We give the exact number of normal multiplicative magic squares of order 4 with an original and complete…
Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…
We define tropical analogues of the notions of linear space and Plucker coordinate and study their combinatorics. We introduce tropical analogues of intersection and dualization and define a tropical linear space built by repeated…
In various application fields, tensor type data are used recently and then a typical rank is important. Although there may be more than one typical ranks over the real number field, a generic rank over the complex number field is the…
We show arithmetic triplets of Gaussian squares are in 3-to-1 correspondence with Pythagorean triples thereof. This correspondence would transform a solution to the Magic Square of Squares puzzle into a larger structure of perfect Gaussian…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
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,…
We continue our study of the mapping ideal of operator $p$-compact maps, previously introduced by the authors. Our approach embraces a more geometric perspective, delving into the interplay between operator $p$-compact mappings and matrix…
We show the 3 by 3 magic square of squares problem equivalent to solving quartic polynomials with certain factorization constraints over an abelian extension of the rationals. We analyze a particular case in which said extension is assumed…
In this paper we introduce an algorithm of construction of cyclic space-filling curves. One particular construction provides a family of space-filling curves in all dimensions (H-curves). They are compared here with the Hilbert curve in the…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
A novel kind of self-referential square matrix is introduced. A certain subset of the matrix entries record the frequencies of occurrence of each distinct number appearing within the entire matrix. Such squares are necessarily elusive. Our…
A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…
In dimension $n=1$ we obtain $L^{p_1}(\mathbb R) \times\dots\times L^{p_m}(\mathbb R)$ to $L^p(\mathbb R)$ boundedness for the multilinear spherical maximal function in the largest possible open set of indices and we provide counterexamples…
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…
Magic squares are a fascinating mathematical challenge that has intrigued mathematicians for centuries. Given a positive (and possibly large) integer \( n \), one of the main challenges that still remains is to find, within a computational…
We show how to construct a cubic partial cube from any simplicial arrangement of lines or pseudolines in the projective plane. As a consequence, we find nine new infinite families of cubic partial cubes as well as many sporadic examples.