Related papers: On the sum of the angles between three vectors
We determine the minimum number of vertices needed to provide balanced triangulations of $\mathbb S^{d-2}$-bundles over $\mathbb S^1$. If $d$ is odd and the bundle is orientable, or $d$ is even and the bundle is non-orientable, the minimum…
Euclid uses an undefined notion of "equal figures", to which he applies the common notions about equals added to equals or subtracted from equals. When (in previous work) we formalized Euclid Book~I for computer proof-checking, we had to…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
We describe all triangles that shares the same circumcircle and Euler circle. Although this two circles do not form a poristic pair of circles, we find a poristic circle "in-between" that enable to solve this problem using Poncelet porism.
In this paper, we study universal sums of triangular numbers and squares. Specifically, we prove that a sum of triangular numbers and squares is universal if and only if it represents…
Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…
Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…
Three points uniformly selected on the unit circle form a triangle containing a point $X$ at distance $r \in [0; 1]$ from its center with probability $P(r) = \frac{1}{4} - \frac{3}{2 \pi^2}\textrm{Li}_2(r^2)$, where $\textrm{Li}_2$ is the…
We establish a general `gluing theorem', which states roughly that if two nondegenerate constant mean curvature surfaces are juxtaposed, so that their tangent planes are parallel and very close to one another, but oppositely oriented, then…
We prove the following Theorem: Given any three distinct points on a straight line r, there exist an equilateral triangle, whose circumcenter lies on r, such that the projections of its vertices on r are exactly the three given points.
We extend Heawood's theorem on the colourability of plane triangulations to triangulations of 3-space. We prove that a triangulation of 3-space can be edge coloured with three colours if and only if all edges have even degree.
For an even set of points in the plane, choose a max-sum matching, that is, a perfect matching maximizing the sum of Euclidean distances of its edges. For each edge of the max-sum matching, consider the ellipse with foci at the edge's…
Euler explored the problem of finding three numbers such that the sum or difference of any two of them is a perfect square. He discovered a parametric solution represented by polynomials of degree 18 and identified the smallest of these…
In general it requires at least 7 point correspondences to compute the fundamental matrix between views. We use the cross ratio invariance between corresponding epipolar lines, stemming from epipolar line homography, to derive a simple…
We measure by Monte Carlo simulations $\g_{string}$ for a model of random surfaces embedded in three dimensional Euclidean space-time. The action of the string is the usual Polyakov action plus an extrinsic curvature term. The system…
We consider the generalised friendship paradox, focussing on the number of triangles at a vertex as the relevant attribute. We show that, contrary to the setting where the attribute is the number of edges at a vertex or the number of wedges…
We present an algebraic generalization of Euler's theorem for quadrilaterals. Starting from the parallelogram identity in an inner product space, we derive Apollonius' identity and obtain Euler's quadrilateral identity in a unified vector…
If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…
A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…