Related papers: Magic Polygons and Their Properties
We review a general parameterization of an order-3 magic square derived by Lucas and we compound it to produce a parameterized order-9 magic square. Sequential compounding to higher order also is treated. Expressions are found for the…
Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…
The Pascal Multimysticum is a system of points and lines constructed with a straight edge starting from six points on a conic. We show that the system contains 150 infinite ranges (and 150 infinite pencils) whose projective coordinates are…
This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane $D^2$ of the real plane $R^2$ and a real convex polygon with…
The Cartesian squares (powers) of manifolds with the fixed point property (f.p.p.) are considered. Examples of manifolds with the f.p.p. are constructed whose symmetric squares fail to have the f.p.p..
In this paper we consider the problem of finding pairs of triangles whose sides are perfect squares of integers, and which have a common perimeter and common area. We find two such pairs of triangles, and prove that there exist infinitely…
Rectangulations are decompositions of a square into finitely many axis-aligned rectangles. We describe realizations of $(n-1)$-dimensional polytopes associated with two combinatorial families of rectangulations composed of $n$ rectangles.…
Two latin squares are orthogonal if, when they are superimposed, every ordered pair of symbols appears exactly once. This definition extends naturally to `incomplete' latin squares each having a hole on the same rows, columns, and symbols.…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
Let $n$ be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex $n$-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width…
A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the…
An abelian square is a string of length 2n where the last n symbols form a permutation of the first n symbols. In this note we count the number of abelian squares and give an asymptotic estimate of this quantity.
Mathematical billiards is much like the real game: a point mass, representing the ball, rolls in a straight line on a (perfectly friction-less) table, striking the sides according to the law of reflection. A billiard trajectory is then…
Polygons are compound geometric objects, but when trying to understand the expected behavior of a large collection of random polygons -- or even to formalize what a random polygon is -- it is convenient to interpret each polygon as a point…
Magical supergravities are a very special class of supergravity theories whose symmetries and matter content in various dimensions correspond to symmetries and underlying algebraic structures of the remarkable geometries of the Magic Square…
Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A…
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
Asymmetric combination of logics is a formal process that develops the characteristic features of a specific logic on top of another one. Typical examples include the development of temporal, hybrid, and probabilistic dimensions over a…
We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.
P. J. Federico used the term low-order for perfect squared squares with at most 28 squares in their dissection. In 2010 low-order compound perfect squared squares (CPSSs) were completely enumerated. Up to symmetries of the square and its…