Related papers: Squaring the Circle Revisited
The two dimensional sphere can't be approximated by finite homogeneous spaces. We describe the optimal approximation and its distance from the sphere.
An n-simplex is called circumscriptible (or edge-incentric) if there is a sphere tangent to all its n(n + 1)/2 edges. We obtain a closed formula for the radius of the circumscribed sphere of the circumscriptible n-simplex, and also prove a…
The objectives of this article are three-fold. Firstly, we present for the first time explicit constructions of an infinite family of \textit{unbalanced} Ramanujan bigraphs. Secondly, we revisit some of the known methods for constructing…
The early Renaissance artist Albrecht Durer published a book on geometry a few years before he died. This was intended to be a guide for young craftsmen and artists giving them both practical and mathematical tools for their trade. In the…
A $\textit{polygonal curve}$ is a collection of $m$ connected line segments specified as the linear interpolation of a list of points $\{p_0, p_1, \ldots, p_m\}$. These curves may be obtained by sampling points from an oriented curve in…
In this paper, we continue the study of almost squares and extend the result of the author's fourth paper of the series to almost squares with closer factors.
In 1928 Henry Scudder described how to use a carpenter's square to trisect an angle. We use the ideas behind Scudder's technique to define a trisectrix---a curve that can be used to trisect an angle. We also describe a compass that could be…
What is the smallest number of pieces that you can cut an n-sided regular polygon into so that the pieces can be rearranged to form a rectangle? Call it r(n). The rectangle may have any proportions you wish, as long as it is a rectangle.…
We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an…
We determine which connected surfaces can be partitioned into topological circles. There are exactly seven such surfaces up to homeomorphism: those of finite type, of Euler characteristic zero, and with compact boundary components. As a…
A magic SET square is a 3 by 3 table of SET cards such that each row, column, diagonal, and anti-diagonal is a set. We allow the following transformations of the square: shuffling features, shuffling values within the features, rotations…
This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…
A digraph is $3$-dicritical if it cannot be vertex-partitioned into two sets inducing acyclic digraphs, but each of its proper subdigraphs can. We give a human-readable proof that the number of 3-dicritical semi-complete digraphs is finite.…
By considering mirror symmetry applied to conformal field theories corresponding to strings propagating in quintic hypersurfaces in projective 4-space, Candelas, de la Ossa, Green and Parkes calculated the ``number of rational curves on the…
We study the curvature of a smooth algebraic surface $X\subset \mathbb R^3$ of degree $d$ from the point of view of algebraic geometry. More precisely, we consider umbilical points and points of critical curvature. We prove that the number…
In this comment we show that the approach presented by Foj\'on et al~\cite{Fojon10} is not as accurate as they claim. A straightforward calculation using the models considered buy those authors clearly shows that the spectral method, which…
We study the geometry of billiard orbits on rectangular billiards. A truncated billiard orbit induces a partition of the rectangle into polygons. We prove that thirteen is a sharp upper bound for the number of different areas of these…
We review a known method of compounding two magic square matrices of order m and n with the all-ones matrix to form two magic square matrices of order mn. We show that these compounded matrices commute. Simple formulas are derived for their…
Is there any other proportion for a rectangle, other than the Golden Proportion, that will allow the process of cutting off successive squares to produce an infinite paving of the original rectangle by squares of different sizes? The answer…
By a simple method we prove the following conjecture on Sharygin triangles: there is only one Sharygin triangle (up to an isometry) whose vertices are chosen from the set of vertices of a regular polygon inscribed in a circle of radius 1.