Related papers: Parable of the Parabola
We describe invariants of centers of ellipse-inscribed triangle families with two vertices fixed to the ellipse boundary and a third one which sweeps it. We prove that: (i) if a triangle center is a fixed affine combination of barycenter…
This paper is a sequel to arXiv:2511.01024 (Base 1), where an axiomatic framework for angles and the foundations of difference-angle geometry were introduced. In difference-angle geometry, where the difference of slopes of lines is treated…
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…
We consider 3-periodic orbits in an elliptic billiard. Numerical experiments conducted by Dan Reznik have shown that the locus of the centers of inscribed circles of the corresponding triangles is an ellipse. We prove this fact by the…
The theorem of three circles in real algebraic geometry guarantees the termination and correctness of an algorithm of isolating real roots of a univariate polynomial. The main idea of its proof is to consider polynomials whose roots belong…
This proof without words demonstrates that there are $\binom{n+2}{4}$ equilateral triangles in the regular $n$-vertices-per-side triangular grid by describing a map from four-element subsets of $\{1,2, \dots, n+2\}$ into the set of…
We use a variational principle to prove an existence and uniqueness theorem for planar weighted Delaunay triangulations (with non-intersecting site-circles) with prescribed combinatorial type and circle intersection angles. Such weighted…
High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical, Euclidean and…
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.…
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
We show that the the image of the regular projection of a vertex of a cone over a triangle that minimizes the ratio of the cube of the area of the boundary of the cone and the square of the volume of the cone coincides with the incenter.
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…
In this paper, an efficient algorithm to find the center of the biggest circle inscribed in a given polygon is described. This work was inspired by the publication of Daniel Garcia-Castellanos & Umberto Lombardo and their algorithm used to…
In the Euclidean setting, Napoleon's Theorem states that if one constructs an equilateral triangle on either the outside or the inside of each side of a given triangle and then connects the barycenters of those three new triangles, the…
The three Apollonius circles of a triangle, each passing through a triangle vertex, the corresponding vertex of the cevian triangle of the incenter and the corresponding vertex of the circumcevian triangle of the symmedian point, are…
This study investigates a generalisation of the Pythagorean theorem to the lengths of conic arcs constructed symmetrically on the sides of a right triangle. It is demonstrated that the theorem remains valid whenever the conic eccentricity…
The theorem of Feuerbach states that the nine-point circle of a nonequilateral triangle is tangent to both its incircle and its three excircles. We give a simple proof of this theorem.
In the paper we prove that the number of graphs inscribed into graph of a convex polyhedron and circumscribed around another graph does not exceed 4. For this we first studied Poncelet type problem about the number of convex $n$-gons…
An elliptic curve defined over a number field possesses only a finite number of torsion points defined over the cyclotomic closure of its field of definition. In analogy to the relative version of the Manin-Mumford conjecture stated by…
The motivation of this work are the two classical theorems on inscribing rectangles and squares into large subsets of the plane, namely Eggleston Theorem and Mycielski Theorem. Using Shoenfield Absoluteness Theorem we prove that for every…