Related papers: On the Construction of Even Order Magic Squares
We construct, for every even dimensional sphere $S^n$, $n >1$, and every odd integer $k$, a homogeneous polynomial map $f: S^{n}\to S^{n}$ of Brouwer degree $k$ and algebraic degree $2|k|-1$.
This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.
Explicit algorithms are developed for constructing odd order n pandiagonal latin cubes in 3 and 4 dimensions, and these are used to construct pandiagonal magic cubes and 4 dimensional hypercubes, respectively. It is established that these…
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 for the first time in the history different kinds of universal bimagic squares. This we have made using only the digits 0,1 and 2. The universal bimagic squares of order 8x8 and 16x16 are with the digits…
This work discusses an approach to solving geometric construction problems in which the given figure is included in a set ordered by construction steps. The flow of information is carried through the chain, allowing the original problem to…
The aim of this paper is to study the characteristics of a general method to produce a new approximation sequence from a given one, by using suitable convex combinations.
In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…
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…
The purpose of this note is twofold. First, we survey results on the construction of large class groups of number fields by specialization of finite covers of curves. Then we give examples of applications of these techniques.
We find an explicit formula for the generating function for the squaring the terms of an $\ell^{th}$ order linear recurrence.
Simple constructions are given for finite semifields that include as special cases both old semifields and recently constructed semifields.
Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…
This note presents a simple, universal closed form for the powers of any square matrix. A diligent search of the internet gave no indication that the form is known.
A random jigsaw puzzle is constructed by arranging $n^2$ square pieces into an $n \times n$ grid and assigning to each edge of a piece one of $q$ available colours uniformly at random, with the restriction that touching edges receive the…
For prime $p$ we define magic squares of order $kp^3$, called type-$p$ Franklin squares, whose properties specialize to those of classical Franklin squares in the case $p=2$. We construct type-$p$ Franklin squares in prime-power orders.
This paper introduces a novel and efficient partitioning technique for quicksort, specifically designed for real-world data with duplicate elements (50-year-old problem). The method is referred to as "equal quicksort" or "eqsort". Based on…
The aim of this paper is to present a recursive construction of simple t-designs for arbitrary t. The construction is of purely combinatorial nature and it requires finding solutions for the indices of the ingredient designs that satisfy a…