Related papers: Quasi-triangle inequality for absolute correlation…

Almost $50$ years ago Erd\H{o}s and Purdy asked the following question: Given $n$ points in the plane, how many triangles can be approximate congruent to equilateral triangles? They pointed out that by dividing the points evenly into three…

Here we show that any n-dimensional centrally symmetric convex body K has an n-dimensional perturbation T which is convex and centrally symmetric, such that the isotropic constant of T is universally bounded. T is close to K in the sense…

We investigate the optimal approximation to triple incompatible quantum measurements within the framework of statistical distance and joint measurability. According to the lower bound of the uncertainty inequality presented in [Physical…

We characterize the graphs for which the independence number equals the packing number. As a consequence we obtain simple structural descriptions of the graphs for which (i) the distance-$k$-packing number equals the distance-$2k$-packing…

In this paper, we prove an optimal systolic inequality and characterize the case of equality on closed Riemannian manifolds with positive triRic curvature. This extends prior work of Bray-Brendle-Neves \cite{BrayBrenleNevesrigidity} and…

We consider the \emph{$k$-edge connected spanning subgraph} (kECSS) problem, where we are given an undirected graph $G = (V, E)$ with nonnegative edge costs $\{c_e\}_{e\in E}$, and we seek a minimum-cost \emph{$k$-edge connected} subgraph…

We prove that if for the curved $n$-body problem in $\mathbb{S}^{k-1}$, $k\geq 3$, the masses are given, the minimum distance between the point masses of a specific type of relative equilibrium solution that is a generalisation of positive…

In this paper, we prove that a natural candidate for a homogeneous norm on a graded Lie algebra of any length satisfies the triangle inequality which answers Moskowitz's question.

In this note, we extend the main results of our paper on quasilinearization and curvature of Aleksandrov spaces of curvature $\leq0$ to curvature bounds other than $0$. For non-zero $K$, we employ the previously introduced notion of the…

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

We consider the distances between a line and a set of points in the plane defined by the L^p-norms of the vector consisting of the euclidian distance between the single points and the line. We determine lines with minimal geometric…

We study the convergence of specific inexact alternating projections for two non-convex sets in a Euclidean space. The $\sigma$-quasioptimal metric projection ($\sigma \geq 1$) of a point $x$ onto a set $A$ consists of points in $A$ the…

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

In this paper we present a new correlation inequality and use it for proving an Almost Sure Local Limit Theorem for the so-called Dickman distribution. Several related results are also proved

Consider the trilinear form for twisted convolution on $\mathbb{R}^{2d}$: \begin{equation*} \mathcal{T}_t(\mathbf{f}):=\iint f_1(x)f_2(y)f_3(x+y)e^{it\sigma(x,y)}dxdy,\end{equation*} where $\sigma$ is a symplectic form and $t$ is a…

Distance correlation is a novel class of multivariate dependence measure, taking positive values between 0 and 1, and applicable to random vectors of arbitrary dimensions, not necessarily equal. It offers several advantages over the…

We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our…

The closest tensors of higher symmetry classes are derived in explicit form for a given elasticity tensor of arbitrary symmetry. The mathematical problem is to minimize the elastic length or distance between the given tensor and the closest…

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…

We study side-lengths of triangles in path metric spaces. We prove that unless such a space X is bounded, or quasi-isometric to line or half-line, every triple of real numbers satisfying the strict triangle inequalities, is realized by the…