Related papers: A New Proof of Pappus's Theorem
We provide a natural answer to Lewis Carroll's pillow problem of what is the probability that a triangle is obtuse, Prob(Obtuse). This arises by straightforward combination of a) Kendall's Theorem - that the space of all triangles is a…
We study a new formulation for the eikonal equation |grad u| =1 on a bounded subset of R^2. Considering a field P of orthogonal projections onto 1-dimensional subspaces, with divergence bounded in L^2, we prove existence and uniqueness for…
$\SLR$ geometry is one of the eight 3-dimensional Thurston geometries, it can be derived from the 3-dimensional Lie group of all $2\times 2$ real matrices with determinant one. Our aim is to describe and visualize the {\it regular infinite…
The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the…
We will simplify earlier proofs of Perelman's collapsing theorem for 3-manifolds given by Shioya-Yamaguchi and Morgan-Tian. Among other things, we use Perelman's critical point theory (e.g., multiple conic singularity theory and his…
Based on the theory of invariant sets of descending flow, we give a new proof of the existence of three nontrivial solutions and some remarks on it.
A set of n segments in the plane may form a Euclidean TSP tour, a tree, or a matching, among others. Optimal TSP tours as well as minimum spanning trees and perfect matchings have no crossing segments, but several heuristics and…
Ring puzzles are tessellations of the Euclidean plane respecting local constraints around vertices. Such puzzles may arise in geometric group theory, for example, as embedded flat planes in certain CAT(0) complexes of dimension 2. In the…
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…
By "solving a triangle", one refers to determining the three sidelengths and the three angles, based on given information.Depending on the specific information, one or more triangles may satisfy the requirements of the given information.In…
We obtain an explicit expression for the number of ramified coverings of the sphere by the torus with given ramification type for a small number of ramification points, and conjecture this to be true for an arbitrary number of ramification…
Linear and semidefinite programming (LP, SDP), regularisation through basis pursuit (BP) and Lasso have seen great success in mathematics, statistics, data science, computer-assisted proofs and learning. The success of LP is traditionally…
The property of triality only appears in one linear simple Lie algebra: $D_4$, a.k.a. $\mathfrak{so}(8, \mathbb{C})$. Though often explored in abstract, it is desirable to have an explicit realization of the concept since there are no other…
We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…
We study point-line configurations and their associated matroid and circuit varieties. We aim to find a finite set of defining equations for matroid varieties and an irreducible decomposition for circuit varieties. To solve the former…
We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…
This paper considers the problem of testing whether there exists a solution satisfying certain non-negativity constraints to a linear system of equations. Importantly and in contrast to some prior work, we allow all parameters in the system…
We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…
A theorem which is named after the American Mathematician Moris Marden states a very surprising and interesting fact concerning the relationship between the points of a triangle in the complex plane and the zeros of two complex polynomials…
We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible by three. This confirms a conjecture of Bar\'at and Thomassen…