Related papers: Squaring the Circle Revisited
A new method Spherical Rectangular Equal-Area Grid (SREAG) was proposed in Malkin (2019) for splitting spherical surface into equal-area rectangular cells. In this work, some more detailed features of SREAG are presented. The maximum number…
We describe a new non-constructive technique to show that squares are avoidable by an infinite word even if we force some letters from the alphabet to appear at certain occurrences. We show that as long as forced positions are at distance…
Let $ABC$ be an equilateral triangle. For certain triangles $T$ (the "tile") and certain $N$, it is possible to cut $ABC$ into $N$ copies of $T$. It is known that only certain shapes of $T$ are possible, but until now very little was known…
We searched up to height $10^7$ for rational points on diagonal quartic surfaces. The computations fill several gaps in earlier lists computed by Pinch, Swinnerton-Dyer, and Bright.
Given a set of $n$ circular arcs of the same radius in the plane, we consider the problem of computing the number of intersections among the arcs. The problem was studied before and the previously best algorithm solves the problem in…
Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…
Recently we gave arguments that only two unique topologically different configurations of 7 equal all mutually touching round cylinders (the configurations being mirror reflections of each other) are possible in 3D, although a whole world…
This paper presents a general method for obtaining radius of the corresponding circumference to a cyclical polygon $n$ sides given the lengths of said sides, using the notion of complex number. As of radius $r$, obtained, can then be…
In the present popular-science paper, we find out which rectangles can be dissected into squares. The proof is based on a physical interpretation in terms of electrical networks. Only a secondary school background is assumed in the paper.
In his seminal paper on triangle centers, Clark Kimberling made a number of conjectures concerning the distances between triangle centers. For example, if $D(i; j)$ denotes the distance between triangle centers $X_i$ and $X_j$ , Kimberling…
The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…
There are known constructions for some regular polygons, usually inscribed in a circle, but not for all polygons - the Gauss-Wantzel Theorem states precisely which ones can be constructed. The constructions differ greatly from one polygon…
A curious number is a palindromic number whose base ten representation has the form $a \ldots a b \ldots b a \ldots a$. In this paper, we determine all curious numbers that are perfect squares. Our proof involves reducing the search for…
We estimate from below the number of lines meeting each of given 4 disjoint smooth closed curves in a given cyclic order in the real projective 3-space and in a given linear order in the Euclidean 3-space. Similarly, we estimate the number…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
A sphere is a fundamental geometric object widely used in (computer aided) geometric design. It possesses rational parameterizations but no parametric polynomial parameterization exists. The present study provides an approach to the optimal…
This paper deals with the history of the following problem: "Can an arbitrary rectangle be dissected into 3 non-rectangular congruent regions?" We present a new elementary proof that the answer is indeed no.
In this paper we have a look at squared squares with small integer sidelengths, where the only restriction is that any two subsquares of the same size are not allowed to share a full border. We prove that there are exactly two such squared…