Related papers: The Triangle
A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…
The focus of this paper is on the study of specific circle formations known as orthogonal Pappus chains and the related incidence results that involve points of tangency between the circles in the construction. These chains give rise to new…
There are several remarkable points, defined for polygons and multisets of points in the plane, called centers (such as the centroid). To make possible their study, there exists a formal definition for the concept of center in both cases.…
A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at…
For a given triangle $\triangle ABC$, we define two sequences of points on line $BC$ and provide their generalizations to real functions such that centers of circumscribed circles around $A$ and adjacent points in subsequences generate a…
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…
The Six Circles Theorem of C. Evelyn, G. Money-Coutts, and J. Tyrrell concerns chains of circles inscribed into a triangle: the first circle is inscribed in the first angle, the second circle is inscribed in the second angle and tangent to…
Let S denote a Steiner triple system on an n-element set. An orientation of S is an assignment of a cyclic ordering to each of the triples in S. From an oriented Steiner triple system, one can define an anticommutative bilinear operation on…
Consider two circles, externally tangential,and with integer radii R1, R2; and with R1>R2.The two circles have three tangent lines in common, one of them being T1T2. If M is the midpoint of T1T2, and K the point of intersection of the lines…
Monsky proved that a square cannot be dissected into an odd number of triangles of equal area. Stein conjectured that the same holds for any polygon whose edges can be paired into parallel and equal-length segments. We prove Stein's…
The Euclidean Steiner problem is the problem of finding a set $St$, with the shortest length, such that $St \cup A$ is connected, where $A$ is a given set in a Euclidean space. The solutions $St$ to the Steiner problem will be called…
It is well known that the three altitudes of a triangle are concurrent at the so-called orthocenter of the triangle. So one might expect that the altitudes of a tetrahedron also meet at a point. However, it was already pointed out in 1827…
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…
We study the eleven points in the plane of a given triangle, whose pedal triangles are similar to the given one. We prove that the six points whose pedal triangles are positively oriented, lie on a single circle, while the five points,…
Solutions to the $n$-dimensional Laplace equation which are constant on a central quadric are found. The associated twistor description of the case $n=3$ is used to characterise Gibbons-Hawking metrics with tri-holomorphic $SL(2, \C)$…
If P is a point inside triangle ABC, then the cevians through P extended to the circumcircle of triangle ABC create a figure containing a number of curvilinear triangles. Each curvilinear triangle is bounded by an arc of the circumcircle…
In this paper we study Tur\'an and Ramsey numbers in linear triple systems, defined as $3$-uniform hypergraphs in which any two triples intersect in at most one vertex. A famous result of Ruzsa and Szemer\'edi is that for any fixed $c>0$…
An $N$-tiling of triangle $ABC$ by triangle $T$ (the `tile') is a way of writing $ABC$ as a union of $N$ copies of $T$ overlapping only at their boundaries. Let the tile $T$ have angles $(\alpha,\beta,\gamma)$, and sides $(a,b,c)$. This…
In one of the three 2010/2011 issues of the journal 'MathematicalSpectrum', this author gave a three-parameter description of the entire set of integral triangles(i.e. triangles with integer side lengths)and with a 120 degree angle.This…