Related papers: Eulerian Composition of Certain Franklin Squares
Benjamin Franklin constructed three squares which have amazing properties, and his method of construction has been a mystery to date. In this article, we divulge his secret and show how to construct such squares for any order.
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.
We describe a generalization of most-perfect magic squares, called type-p most-perfect squares, and in prime-power orders we give a linear construction of these squares reminiscent of de la Loubere's classical magic square construction…
This is a translation of Leonhard Euler's ``De quadratis magicis'' . It is E795 in the Enestrom index. This paper studies how to construct magic squares with certain numbers of cells, in particular 9, 16, 25 and 36. It considers some…
In this paper, constructions of multimagic squares are investigated. Diagonal Latin squares and Kronecker products are used to get some constructions of multimagic squares. Consequently, some new families of compound multimagic squares are…
Magic squares have been an enthralling topic in mathematics for centuries. They are formed by filling in all the cells of a square matrix with the numbers starting from one so that the sum of all rows, columns, and diagonals is the same.…
The aim of this note is to introduce fastest new general methods for the construction of double and single even order magic squares. As in [5], the method for double even order magic squares is fairly straight-forward but some adjustments…
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.
Using computational algebraic geometry techniques and Hilbert bases of polyhedral cones we derive explicit formulas and generating functions for the number of magic squares and magic cubes.
In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove…
Using multiple Bernoulli series, we give a formula in the spirit of Euler MacLaurin formula. We also give a wall crossing formula and a decomposition formula. The study of these series is motivated by formulae of E.Witten for volumes of…
We use functions of a bicomplex variable to unify the existing constructions of harmonic morphisms from a 3-dimensional Euclidean or pseudo-Euclidean space to a Riemannian or Lorentzian surface. This is done by using the notion of…
The construction of Freudenthal's Magic Square, which contains the exceptional simple Lie algebras, in terms of symmetric composition algebras is further developed here. The para-Hurwitz algebras, which form a subclass of the symmetric…
The aim of this note is to introduce a fast new general method for the construction of double and single even order magic squares. The method for double even order magic squares is fairly straight-forward but some adjustment is necessary…
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
A construction of the magic square, and hence of exceptional Lie algebras, is carried out using trialities rather than division algebras. By way of preparation, a comprehensive discussion of trialities is given, incorporating a number of…
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,…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
In an analogous construction as by Euler for 4x4 matrices, a parametrization of 8x8 magic squares of squares with orthogonal rows is shown to be obtainable by extending the quaternionic method, as shown by Hurwitz, to octonions, but not…
Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…