Related papers: Uniform Triangles with Equality Constraints
A symmetric random variable is called a Gaussian mixture if it has the same distribution as the product of two independent random variables, one being positive and the other a standard Gaussian random variable. Examples of Gaussian mixtures…
Some additive reverses of the generalised triangle inequality in normed linear spaces are given. Applications for complex numbers are provided as well.
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
A classical statistical inequality is used to show that the distance covariance of two bounded random vectors is bounded from above by a simple function of the dimensionality and the bounds of the random vectors. Two special cases that…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
The draw of some knockout tournaments requires finding a perfect matching in a balanced bipartite graph. The problem becomes challenging with draw constraints: the two draw procedures used in sports are known to be non-uniformly distributed…
We prove that uniform random triangulations whose genus is proportional to their size $n$ have diameter of order $\log n$ with high probability. We also show that in such triangulations, the distances between most pairs of points differ by…
For any three nonzero vectors $a,b,c$ in $\mathbb R^2$, we obtain a necessary and sufficient condition for the sum of the three pairwise angles between these vectors to equal $2\pi$. As an easy consequence of this, a proof of Euclid's…
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…
Consider three qubits A, B, and C which may be entangled with each other. We show that there is a trade-off between A's entanglement with B and its entanglement with C. This relation is expressed in terms of a measure of entanglement called…
A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of…
In this work the Erdos-Mordell's inequality is examined for the case of a triangle $ABC$ in the taxicab plane geometry. It is shown that the Erdos-Mordell's inequality $R_A + R_B + R_C \, \geq \, w \, (r_a + r_b + r_c)$ holds for triangles…
Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…
After a brief look at the well-known standard approaches to determine the angle gamma of the unitarity triangle, we focus on two kinds of strategies, employing $B\to\pi K$ modes, and U-spin-related B decays. Interesting "puzzles", which may…
The LHCb collaboration has studied various promising ways to determine the Unitarity Triangle angle $\gamma$. Three complementary methods will be considered. The potential of the $B \to DK^{(*)}$ decays has been studied by employing the…
A method of ``blocking'' triangulations that rests on the self-similarity feature of dynamically triangulated random manifolds is proposed. The method is used to define the renormalization group for random geometries. As an illustration,…
A previously overlooked constraint for the distribution of entanglement in three-qubit systems is exploited for the first time and used to reveal a new genuine tripartite entanglement measure. It is interpreted as the area of a so-called…
Given a triangle ABC, we derive the probability distribution function and the moments of the area of an inscribed triangle RST whose vertices are uniformly distributed on AB, BC, and CA. The theoretical results are confirmed by a Monte…
It is consistent relative to an inaccessible cardinal that ZF+DC holds, the hypergraph of equilateral triangles on a given Euclidean space has countable chromatic number, while the hypergraph of isosceles triangles in the plane does not.
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…