Related papers: Inequalities For Distances Between Triangle Center…
We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…
In this paper, we continue the study of three close factorizations of an integer and correct a mistake of a previous result. This turns out to be related to lattice points close to the center point $(\sqrt{N}, \sqrt{N})$ of the hyperbola $x…
We use the idea of the broken stick problem (which goes back to Poincare) and calculate the corresponding probabilities for the cases in which the three broken part are: the medians in a triangle, the altitudes, radii of excircles, angle…
The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…
In this paper we have considered a single inequality having 11 known divergence measures. This inequality include measures like: Jeffryes-Kullback-Leiber J-divergence, Jensen-Shannon divergence (Burbea-Rao, 1982), arithmetic-geometric mean…
For a code $C$ in a space with maximal distance $n$, we say that $C$ has symmetric distances if its distance set $S(C)$ is symmetric with respect to $n / 2$. In this paper, we prove that if $C$ is a binary code with length $2n$, constant…
The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
The {\em bottleneck distance} is a natural measure of the distance between two finite point sets of equal cardinality, defined as the minimum over all bijections between the point sets of the maximum distance between any pair of points put…
Solutions to the $n$-dimensional Laplace equation which are constant on a central quadric are found. The associated twistor description of the case $n=3$ is used to characterise Gibbons-Hawking metrics with tri-holomorphic $SL(2, \C)$…
In 1989 Kalai stated the three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the ``$3^d$-conjecture''. It is well-known that the three…
A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…
In the literature, there have been several methods and definitions for working out if two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide means to measure distances (and explore…
Let (P) denote the problem of existence of a point in the plane of a given triangle T, that is at rational distance from all the vertices of T. In this article, we provide a complete solution to (P) for all equilateral triangles.
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles, we explicitly show exactly when both cases occur.
In this paper we show that the number of distinct distances determined by a set of $n$ points on a constant-degree two-dimensional algebraic variety $V$ (i.e., a surface) in $\mathbb R^3$ is at least $\Omega\left(n^{7/9}/{\rm polylog}…
Two channels are equivalent if their maximum likelihood (ML) decoders coincide for every code. We show that this equivalence relation partitions the space of channels into a generalized hyperplane arrangement. With this, we define a coding…
We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…
We generalize the classical Ceva's and Menelaus's theorems to curvilinear triangles bounded by circular arcs. We introduce trilinear coordinates associated with such triangles and develop several geometric constructions. In particular, for…
John Conway's Circle Theorem is a gem of plane geometry. The six points formed by continuing the sides of a triangle beyond every vertex by the length of its opposite side, are concyclic. The theorem has attracted several proofs. We present…