Related papers: Squaring the Circle Revisited
Shape complexity is a hard-to-quantify quality, mainly due to its relative nature. Biased by Euclidean thinking, circles are commonly considered as the simplest. However, their constructions as digital images are only approximations to the…
We construct non-constructible simplicial $d$-spheres with $d+10$ vertices and non-constructible, non-realizable simplicial $d$-balls with $d+9$ vertices for $d\geq 3$.
For any two disjoint oriented circles embedded into the 3-dimensional real projective space, we construct a 3-dimensional configuration space and its map to the projective space such that the linking number of the circles is the half of the…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…
We give some methods for computing equations for certain Shimura curves, natural maps between them, and special points on them. We then illustrate these methods by working out several examples in varying degrees of detail. For instance, we…
We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…
We provide an explicit geometric algorithm involving only ruler and compass constructions in order to specify the specular reflection point on the surface of a reflecting sphere of radius $r$ given two focal points $A$ and $B$ lying outside…
The paper introduces cycles cross ratio, which extends the classic cross ratio of four points to various settings: conformal geometry, Lie spheres geometry, etc. Just like its classic counterpart cycles cross ratio is a measure of…
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…
A pseudocircle is a simple closed curve on the sphere or in the plane. The study of arrangements of pseudocircles was initiated by Gr\"unbaum, who defined them as collections of simple closed curves that pairwise intersect in exactly two…
We consider whether any two triangulations of a polygon or a point set on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable…
In this article we present a method for constructing two-point functions in the spirit of the hexagon proposal, which leads us to propose a "square form factor". Since cutting the square gives us two squares, we can write a consistency…
In 1907, Henry Ernest Dudeney posed a puzzle: ``cut any equilateral triangle \dots\ into as few pieces as possible that will fit together and form a perfect square'' (without overlap, via translation and rotation). Four weeks later, Dudeney…
In this paper, constructions of regular pentagon and decagon, and the calculation of the main trigonometric ratios of the corresponding central angles are approached. In this way, for didactic purposes, it is intended to show the reader…
It is well known that Heron's theorem provides an explicit formula for the area of a triangle, as a symmetric function of the lengths of its sides. It has been extended by Brahmagupta to quadrilaterals inscribed in a circle (cyclic…
From the viewpoint of the division by zero $(0/0=1/0=z/0=0)$ and the division by zero calculus, we will show that in the very beautiful theorem by Descartes on three touching circles is valid for lines and points for circles except for one…
Let D be an acyclic orientation of a simple graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let d(D) denote the number of dependent arcs in D. Define m and M to be the minimum and the maximum number of…
We classify the dihedral edge-to-edge tilings of the sphere by squares and rhombi.
We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely long overlap-free words that consist of a concatenation of…
In this paper, we study how close the terms of a finite arithmetic progression can get to a perfect square. The answer depends on the initial term, the common difference and the number of terms in the arithmetic progression.