Related papers: Constructing Even Order Magic Squares By Consecuti…
We review a general parameterization of an order-3 magic square derived by Lucas and we compound it to produce a parameterized order-9 magic square. Sequential compounding to higher order also is treated. Expressions are found for the…
A magic labelling of a set system is a labelling of its points by distinct positive integers so that every set of the system has the same sum, the magic sum. Examples are magic squares (the sets are the rows, columns, and diagonals) and…
Let $(\Gamma,+)$ be an Abelian group of order $n^2$ and MS$_{\Gamma}(n)$ be an $n\times n$ array whose entries are all elements of $\Gamma$. Then MS$_{\Gamma}(n)$ is a $\Gamma$-magic square if all row, column, main and backward main…
In this paper we provide a straightforward proof that if a pair of amicable numbers with different parity exists (one number odd and the other one even), then the odd amicable number must be a perfect square, while the even amicable number…
Order diagrams are an important tool to visualize the complex structure of ordered sets. Favorable drawings of order diagrams, i.e., easily readable for humans, are hard to come by, even for small ordered sets. Many attempts were made to…
Graph labeling is a well-known and intensively investigated problem in graph theory. Sparse anti-magic squares are useful in constructing vertex-magic labeling for graphs. For positive integers $n,d$ and $d<n$, an $n\times n$ array $A$…
We solve Poisson's equation using new multigrid algorithms that converge rapidly. The novel feature of the 2D and 3D algorithms are the use of extra diagonal grids in the multigrid hierarchy for a much richer and effective communication…
A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…
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…
A Sudoku puzzle often has a regular pattern in the arrangement of initial digits and it is typically made solvable with known solving techniques, called strategies. In this paper, we consider the problem of generating such Sudoku instances.…
A cyclically ordered quiver is a quiver endowed with an additional structure of a cyclic ordering of its vertices. This structure, which naturally arises in many important applications, gives rise to new powerful mutation invariants.
A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…
Our purpose is to determine the complete set of mutually orthogonal squares of order $d$, which are not necessary Latin. In this article, we introduce the concept of supersquare of order $d$, which is defined with the help of its generating…
By means of $q$-series, we prove that any natural number is a sum of an even square and two triangular numbers, and that each positive integer is a sum of a triangular number plus $x^2+y^2$ for some integers $x$ and $y$ with $x\not\equiv y…
We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…
Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…
In this short note we have produced different kind of magic squares using digital letter having only the algorisms: 0, 1, 2, 5, and 8. The interesting fact in considering these five digits is that the day 8th May 2010 also have these ones…
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 this article, we reveal how Benjamin Franklin constructed his second $8 \times 8$ magic square. We also construct two new $8 \times 8$ Franklin squares.
In this paper, we consider the numerical methods preserving single or multiple conserved quantities, and these methods are able to reach high order of strong convergence simultaneously based on some kinds of projection methods. The…