Related papers: Demystifying Benjamin Franklin's other 8-square

In this paper we have established relations of the genetic tables with magic and bimagic squares. Connections with Hamming distances, binomial coefficients are established. The idea of Gray code is applied. Shannon entropy of magic squares…

We introduce Magic Gems, a geometric representation of magic squares as three-dimensional polyhedra. By mapping an n times n magic square onto a centered coordinate grid with cell values as vertical displacements, we construct a point cloud…

We show by explicit construction the existence of various four dimensional models of type II superstrings with N=2 supersymmetry, purely vector multiplet spectrum and no hypermultiplets. Among these, two are of special interest, at the…

In this paper, we investigate two methods to express the natural powers of $2$ as sums over integer partitions. First we consider a formula by N. J. Fine that allows us to express a binomial coefficient in terms of multinomial coefficients…

Let $\chi_{\bar{k}}(n)$ be the number of colors required to color the $n$-dimensional hypercube such that no two vertices with the same color are at a distance at most $k$. In other words, $\chi_{\bar{k}}(n)$ is the minimum number of binary…

Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…

Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…

We show how to construct unramified qoaternion extensions of quadratic number fields.

We show how Coxeter's work implies a bijection between complex reflection groups of rank two and real reflection groups in $O(3)$. We also consider this magic square of reflections and rotations in the framework of Clifford algebras: we…

We provide a polynomial time algorithm to determine a cubic bipartite graph has a hamilton cycle or not.

We consider the tiling of an $n$-board (a board of size $n\times1$) with squares of unit width and $(1,1)$-fence tiles. A $(1,1)$-fence tile is composed of two unit-width square subtiles separated by a gap of unit width. We show that the…

The regular icosahedron is connected to many exceptional objects in mathematics. Here we describe two constructions of the $\mathrm{E}_8$ lattice from the icosahedron. One uses a subring of the quaternions called the "icosians", while the…

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…

This is the second part of our study of epimorphisms with source a thick generalized $m$-gon and target a thin generalized $m$-gon. We classify the case $m = 8$ when the polygons are finite (in the first part [15] we handled the cases $m =…

This paper provides a commentary and guide to Appendix 8 of Laws Of Form, which is a chapter (appendix) on number theory in the book Laws of Form by Spencer-Brown. (Spencer-Brown,Laws Of Form,Revised Seventh English edition. Bohmeier…

In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Euler's classic partition identity states that the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts. We develop a new generalization of this identity, which yields a previous…

In this short paper we have produced different kinds of upside down magic squares based on a palindromic day 11.02.2011. In this day appear only the algorisms 0, 1 and 2. Some of the magic squares are bimagic and some are palindromic. Magic…

The Lie superalgebras in the extended Freudenthal Magic Square in characteristic 3 are shown to be related to some known simple Lie superalgebras, specific to this characteristic, constructed in terms of orthogonal and symplectic triple…