Related papers: Ram's theorem for Trisection
The purpose of the present paper is twofold: firstly to extend to non-orientable compact 4-manifolds the notion of gem-induced trisection, directly obtained from colored triangulations (or, equivalently, from colored graphs encoding them,…
For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…
The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous…
Geometry is essentially a global language, which is fully understood in different times, countries and cultures. The proof of a geometric theorem (e.g. the Pythagorean Theorem) or a geometric construction (e.g. the construction of an…
We present a concise self-contained inversive geometry solution of the three-circle problem of Steiner of constructing a circle that intersects each of the three given circles at one of the three given angles.
Simulations of many rigid bodies colliding with each other sometimes yield particularly interesting results if the colliding objects differ significantly in size and are non-spherical. The most expensive part within such a simulation code…
The initial techniques developed in Euclid's Elements, well before the use of the parallel postulate, are reexamined in order to clarify even the most obscure details, particularly those related to equality, superposition and angle…
If a line cuts randomly two sides of a triangle, the length of the segment determined by the points of intersection is also random. The object of this study, applied to a particular case, is to calculate the probability that the length of…
In this paper, we explain a new Iterative Method-Fixed Point and develop its convergence theory for finding approximate solutions of nonlinear equations in the setting of Banach spaces. First, we discuss the convergence analysis of our…
Many problems in Euclidean geometry, arising in computational design and fabrication, amount to a system of constraints, which is challenging to solve. We suggest a new general approach to the solution, which is to start with analogous…
We prove existence of radially symmetric solutions and validity of Euler-Lagrange necessary conditions for a class of variational problems such that neither direct methods nor indirect methods of Calculus of Variations apply. We obtain…
A three-point iterative method for solving scalar non-linear equations was selected and then adapted to solve systems of non-linear equations. Subsequently, by applying Taylor's theorem to functions of $\R^{n}$ in $\R^{n}$, it is shown that…
This paper investigates the relationship between a system of differential equations and the underlying geometry associated with it. The geometry of a surface determines shortest paths, or geodesics connecting nearby points, which are…
We re-derive Thales, Pythagoras, Apollonius, Stewart, Heron, al Kashi, de Gua, Terquem, Ptolemy, Brahmagupta and Euler's theorems as well as the inscribed angle theorem, the law of sines, the circumradius, inradius and some angle bisector…
The convex feasibility problem asks to find a point in the intersection of a collection of nonempty closed convex sets. This problem is of basic importance in mathematics and the physical sciences, and projection (or splitting) methods…
We study the geometry of the space of rational curves on smooth complete intersections of low degree, which pass through a given set of points on the variety. The argument uses spreading out to a finite field, together with an adaptation to…
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows…
This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…
A new algorithm is presented for computing a direct solution to a system of consistent linear equations. It produces a minimum norm particular solution, a generalized inverse (of type {124}), and a null space projection operator. In…
From Euclid's fundamental formula for the Pythagorean triples we define the rational triples relating certain congruent numbers by an identity and explore their relationships. We introduce two geometric methods relating the congruent number…