Related papers: DIGITAL ERA: Universal Bimagic Squares
In this paper, it is proved that there is, up to isomorphism, a unique generalized quadrangle of order (4,16).
We show that the vertices and edges of a $d$-dimensional grid graph $G=(V,E)$ ($d\geqslant 2$) can be labeled with the integers from $\{1,\ldots,\lvert V\rvert\}$ and $\{1,\ldots,\lvert E\rvert\}$, respectively, in such a way that for every…
We use modular arithmetic to construct a de Bruijn array containing all fillings of an L (a 2 x 2 array with the upper right corner removed) with digits chosen from {0,...,k-1}.
Natural numbers divisible by the same prime factor lie on defined spiral graphs which are running through the Square Root Spiral (also named as the Spiral of Theodorus or Wurzel Spirale or Einstein Spiral). Prime Numbers also clearly…
This paper discusses about a sorting algorithm which uses the concept of buckets where each bucket represents a certain number of digits. A two dimensional data structure is used where one dimension represents buckets i. e; number of digits…
A cube-like graph is a Cayley graph for the elementary abelian group of order $2^n$. In studies of the chromatic number of cube-like graphs, the $k$th power of the $n$-dimensional hypercube, $Q_n^k$, is frequently considered. This coloring…
We propose a method of compiling that permits to identify quantum circuits able to simulate arbitrary $n$-qubit unitary operations via the adjustment of angles in single-qubit gates therein. The method of compiling itself extends older…
We consider the tiling of an $n$-board (a $1\times n$ array of square cells of unit width) with half-squares ($\frac12\times1$ tiles) and $(\frac12,\frac12)$-fence tiles. A $(\frac12,\frac12)$-fence tile is composed of two half-squares…
We construct and classify all possible Magic Squares (MS's) related to Euclidean or Lorentzian rank-3 simple Jordan algebras, both on normed division algebras and split composition algebras. Besides the known Freudenthal-Rozenfeld-Tits MS,…
Pebbles (calculos in Latin) are the "bits" used in the Ancients' four function calculator / computer. The Ancient Computer's normal mode is to work with numbers in what we would call exponential notation. Decimal numbers can have up to 10…
We give a hierarchial set of axioms for mathematical origami. The hierachy gives the fields of Pythagorean numbers, first discussed by Hilbert, the field of Euclidean constructible numbers which are obtained by the usual constructions of…
This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to implement and optimal both with regards to the amount of random…
Consider a periodical (in two independent directions) tiling of the plane with polygons (faces). In this article we shall only give examples using squares, regular hexagons, equilateral triangles and parallelograms ("unions" of two…
A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to…
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 consider words $w$ over the alphabet $\Sigma=\{0,1,2\}$. It is shown that there are irreducibly square-free words of all lengths $n$ except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions $uu$ as factors), but by…
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…
The unextendible orthogonal matrices (UPBs) can be used for various problems in quantum information. We provide an algorithm to check if two UPBs are non-equivalent to each other. We give a method to construct UPBs and we apply this method…
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…
We give a one dimensional octonionic representation of the different Clifford algebra Cliff(5,5)\sim Cliff(9,1), Cliff(6,6)\sim Cliff(10,2) and lastly Cliff(7,6)\sim Cliff(10,3) which can be given by (8x8) real matrices taking into account…