Related papers: Odd Order Pandiagonal Latin and Magic Cubes in Thr…
In this paper we have produced different kinds of bimagic squares based on bimagic squares of order 8x8, 16x16, 25x25, 49x49, etc. A different technique is applied to produce bimagic square of order 16x16, 25x25, 49x49, etc. The bimagic…
To get another from a given latin square, we have to change at least 4 entries. We show how to find these entries and how to change them.
A magic square of order n is an nxn square (matrix) whose entries are distinct nonnegative integers such that the sum of the numbers of any row and column is the same number, the magic constant. In this paper we introduce the concept of…
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…
In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…
We consider the self-assembly of cross junctions in a general space dimension ($d$) as an extension of the problem studied in a previous paper for $d = 3$. This problem is equivalent to constructing a $d$-dimensional hypercubic jungle gym,…
We study $n$-dimensional matrices with $\{0,1\}$-entries ($n$-cubes) such that all their $2$-dimensional slices are incidence matrices of symmetric designs. A known construction of these objects obtained from difference sets is generalized…
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking techniques, and on several heuristic optimizations and bit…
A k-magic square of order n is an arrangement of the numbers from 0 to kn-1 in an n by n matrix, such that each row and each column has exactly k filled cells, each number occurs exactly once, and the sum of the entries of any row or any…
Do you want to know what an anti-chiece Latin square is? Or what a non-consecutive toroidal modular Latin square is? We invented a ton of new types of Latin squares, some inspired by existing Sudoku variations. We can't wait to introduce…
The Alon-Tarsi Latin square conjecture is extended to odd dimensions by stating it for reduced Latin squares (Latin squares having the identity permutation as their first row and first column). A modified version of Onn's colorful…
For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4…
We consider the question of when the $n$-dimensional hypercube can be decomposed into paths of length $k$. Mollard and Ramras \cite{MR2013} noted that for odd $n$ it is necessary that $k$ divides $n2^{n-1}$ and that $k\leq n$. Later, Anick…
We determine the minimal volume of arithmetic hyperbolic orientable n-dimensional orbifolds (compact and non-compact) for every odd dimension n>3. Combined with the previously known results it solves the minimal volume problem for…
We derive necessary and sufficient conditions for there to exist a latin square of order $n$ containing two subsquares of order $a$ and $b$ that intersect in a subsquare of order $c$. We also solve the case of two disjoint subsquares. We…
We study arithmetic constraints arising from the three faces meeting along the space diagonal of a rectangular cuboid. Using a propagation mechanism along this diagonal, based on the appearance of a minimal odd prime in certain triangular…
For a general cubic fourfold $X \subset \mathbb{P}^5$, we compute the Hodge numbers of the locus $S \subset F$ of lines of second type. We also give an upper bound of 6 for the degree of irrationality of the Fano scheme of lines of any…
There exists a bijection between the set of Latin squares of order $n$ and the set of feasible solutions of the 3-dimensional planar assignment problem ($3PAP_n$). In this paper, we prove that, given a Latin square isotopism $\Theta$, we…
In this paper we are constructing integer lattice squares, cubes or hypercubes in $\mathbb R^d$ with $d\in \{2,3,4\}$. For squares and cubes we find a complete description of their Ehrhart polynomial. For hypercubes, we compute one of the…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…