Related papers: On the sum of the angles between three vectors

For finite sets A and B in the plane, we write A+B to denote the set of sums of the elements of A and B. In addition, we write tr(A) to denote the common number of triangles in any triangulation of the convex hull of A using the points of A…

This purpose of this paper is to prove the following result: let phi be a strictly convex, smooth, convex body in the Euclidean plane, if the intersection of n translates of phi has a non-empty interior, and all of the translates contribute…

Given a triangle, what is the equation of the line which bisects its area and has a given slope? The set of all lines bisecting the area of a triangle has been elegantly determined as a certain 'deltoid' envelope and this gives an indirect…

We revisit the group structure on elliptic curves and give a simple and elementary proof of the associativity of the addition. We do this by providing an explicit formula for the sum of three points, only using the explicit definition of…

We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…

The solid angle subtended by a right circular cylinder at a point source located at an arbitrary position generally consists of a sum of two terms: that defined by the cylindrical surface ($\Omega_{cyl}$) and the other by either of the end…

We prove a fairly general inequality that estimates the number of lattice points in a ball of positive radius in general position in a Euclidean space. The bound is uniform over lattices induced by a matrix having a bounded operator norm.

The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete…

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…

While solving problems, if direct methods does not provide solution, indirect methods are explored. Today, we need an indirect method to solve the problem of angle trisection as the direct methods have been proved not to provide solutions.…

In the present work, the problem about shadow, generalized on domains of space $\mathbb{R}^n$, $n\le 3$, is investigated. Here the shadow problem means to find the minimal number of balls satisfying some conditions an such that every line…

Interior and exterior angle vectors of polytopes capture curvature information at faces of all dimensions and can be seen as metric variants of $f$-vectors. In this context, Gram's relation takes the place of the Euler--Poincar\'e relation…

Given two vectors in Euclidean space, how unlikely is it that a random vector has a larger inner product with the shorter vector than with the longer one? When the random vector has independent, identically distributed components, we…

We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…

In this paper we study constant angle surfaces in Euclidean 3-space. Even that the result is a consequence of some classical results involving the Gauss map (of the surface), we give another approach to classify all surfaces for which the…

In the spirit of the Genetics of the Regular Figures, by L. Fejes T\'oth, we prove the following theorem: If $2n$ points are selected in the $n$-dimensional Euclidean ball $B^n$ so that the smallest distance between any two of them is as…

Geometric algebra is the natural outgrowth of the concept of a vector and the addition of vectors. After reviewing the properties of the addition of vectors, a multiplication of vectors is introduced in such a way that it encodes the famous…

Let $G = (V_G,E_G)$ be a simple connected graph. The eccentric distance sum of $G$ is defined as $\xi^d(G)=\sum_{v \in V_G}\,\varepsilon_G(v)D_G(v),$ where $\varepsilon_G(v)$ is the eccentricity of the vertex $v$ and $D_G(v)=\sum_{u \in…

We consider the Heisenberg spin triangle with general coupling coefficients and general spin quantum number $s$. The corresponding classical system is completely integrable. In the quantum case the eigenvalue problem can be reduced to that…

An elementary geometric construction known as Napoleon's theorem produces an equilateral triangle built on the sides of any initial triangle: the centroids of each equilateral triangle meeting the original sides, all outward or all inward,…