Related papers: Squares from any Quadrilateral
The goal of this paper is to determine the number of perpendicularly inscribed polygons that intersect a given side of a regular polygon with an odd number of sides. This is done using circular permutations with repetition, and some special…
Three circles define each of the Brocard points of a triangle. If one adds the three circles through a pair of vertices and the orthocentre one has nine circles. It is described how each of the nine centres of these circles lies at the…
We consider closed chains of circles $C_1,C_2,\ldots,C_n,C_{n+1}=C_1$ such that two neighbouring circles $C_i,C_{i+1}$ intersect or touch each other with $A_i$ being a common point. We formulate conditions such that a polygon with vertices…
A formal n-square is the set of positions in an square matrix of size n. A shuffle of a formal n-square consists of independent rotations of each row and of each column. A key result turns out to be valid at least for n <= 34 and n = 37:…
A Heron quadrilateral is a cyclic quadrilateral whose area and side lengths are rational. In this work, we establish a correspondence between Heron quadrilaterals and a family of elliptic curves of the form $y^2 = x3+/alpha x^2-n^2x.$ This…
Answering a question posed by Joseph Malkevitch, we prove that there exists a polyhedral graph, with triangular faces, such that every realization of it as the graph of a convex polyhedron includes at least one face that is a scalene…
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…
Meyerson's Theorem says that all but at most 2 points of any Jordan loop are vertices of inscribed equilateral triangles. We show that for any Jordan loop there are uncountable many other triangle shapes for which this same result is true.…
Connect each vertex of a convex quadrilateral Q to the midpoint of the next (proceeding counterclockwise) side. The four connecting lines create an interior quadrilateral I. We study the ratio area(I)/area(Q). We also determine what happens…
Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…
We prove that over a Poncelet triangle family interscribed between two nested ellipses $\mathcal{E},\mathcal{E}_c$, (i) the locus of the orthocenter is not only a conic, but it is axis-aligned and homothetic to a $90^o$-rotated copy of…
Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…
We present higher dimensional versions of the classical results of Euler and Fuss, both of which are special cases of the celebrated Poncelet porism. Our results concern polytopes, specifically simplices, parallelotopes and cross polytopes,…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…
In 1882 J.J. Sylvester already proved, that the number of different ways to partition a positive integer into consecutive positive integers exactly equals the number of odd divisors of that integer (see [1]). We will now develop an…
A framework, which is a (possibly infinite) graph with a realization of its vertices in the plane, is called flexible if it can be continuously deformed while preserving the edge lengths. We focus on flexibility of frameworks in which…
The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…