Related papers: A new complete algorithm for Irreducible Diophanti…
This paper introduces a Delaunay triangulation algorithm based on the external incremental method. Unlike traditional random incremental methods, this approach uses convex hull and points as basic operational units instead of triangles.…
A recent result of Eden, Levi, and Ron (ECCC 2015) provides a sublinear time algorithm to estimate the number of triangles in a graph. Given an undirected graph $G$, one can query the degree of a vertex, the existence of an edge between…
This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…
This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…
Diophantine tuples are of ancient and modern interest, with a huge literature. In this paper we study Diophantine graphs, i.e., finite graphs whose vertices are distinct positive integers, and two vertices are linked by an edge if and only…
In any triangle, the perpendicular side bisectors meet the corresponding internal angle bisectors on the circumcircle. If we take those three points as the vertices of a new triangle and repeat the operation indefinitly, we end up in the…
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 describe a new construction algorithm for the recursive generation of all non-isomorphic IPR fullerenes. Unlike previous algorithms, the new algorithm stays entirely within the class of IPR fullerenes, that is: every IPR fullerene is…
There are four characteristic circles for each triangle on a plane. All for are tangential to the three straight lines containing the triangles' three sides. Three are exterior circles, the fourth is the in-circle. When the triangle is…
In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…
The celebrated Mantel's theorem states that any triangle-free graph on $n$ vertices contains at most $\left\lfloor n^2/4\right\rfloor$ edges. It is natural to ask how many triangles must exist in a graph with more than $\left\lfloor…
In this paper, a theorem about similar triangles is proved. It shows that two small and four large triangles similar to the original triangle can appear if we choose well among several intersections of the perpendicular bisectors of the…
We consider the construction of a polygon $P$ with $n$ vertices whose turning angles at the vertices are given by a sequence $A=(\alpha_0,\ldots, \alpha_{n-1})$, $\alpha_i\in (-\pi,\pi)$, for $i\in\{0,\ldots, n-1\}$. The problem of…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
We study some Diophantine problems related to triangles with two given integral sides. We solve two problems posed by Zolt\'an Bertalan and we also provide some generalization.
In this article, we introduce an algorithm for automatic generation and categorization of triangle geometry theorems.
We provide a spectrum of new theoretical insights and practical results for finding a Minimum Dilation Triangulation (MDT), a natural geometric optimization problem of considerable previous attention: Given a set $P$ of $n$ points in the…
A Heron triangle is a triangle whose side lengths and area are all positive integers. If the greatest common divisor of the three side lengths is $1$, it is called a primitive Heron triangle. In this paper, we give an equivalent condition…
We have computed a table of the triangle sides of all congruent numbers less than 10,000, which improves and extends the existing public table. We give some background on properties of the triangle sides, and explain how we computed our…
In 1934 B. Berggren first discovered the surprising result that every Pythagorean triplet is the pre product of the triplet (3, 4, 5) presented as a column by a product of three matrices, that every triplet is obtained in this manner…