Related papers: Integer Point Sets Minimizing Average Pairwise L1-…

In machine learning and particularly in topological data analysis, $\epsilon$-graphs are important tools but are generally hard to compute as the distance calculation between n points takes time O(n^2) classically. Recently, quantum…

Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…

In this paper, we propose a class of elementary plane geometry problems closely related to the title of this paper. Here, a circle is the 1-dimensional curve bounding a disk. For any nonnegative integer, a circle is called $n$-enclosing if…

This paper gives simple distributed algorithms for the fundamental problem of computing graph distances in the Congested Clique model. One of the main components of our algorithms is fast matrix multiplication, for which we show an…

Local orbits of a pure state of an N x N bi-partite quantum system are analyzed. We compute their dimensions which depends on the degeneracy of the vector of coefficients arising by the Schmidt decomposition. In particular, the generic…

Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…

We link the theory of optimal transportation to the theory of integer partitions. Let $\mathscr P(n)$ denote the set of integer partitions of $n \in \mathbb N$ and write partitions $\pi \in \mathscr P(n)$ as $(n_1, \dots, n_{k(\pi)})$.…

In this paper we show that on a complete Riemannian manifold of negative curvature and dimension $n>1$ every two points which realize a local maximum for the distance function are connected by at least $2n+1$ geometrically distinct geodesic…

Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…

In this paper we provide explicit upper and lower bounds on certain $L^2$ $n$-widths, i.e., best constants in $L^2$ approximation. We further describe a numerical method to compute these $n$-widths approximately, and prove that this method…

Given a set $S$ consisting of $n$ points in $\mathbb{R}^d$ and one or two vantage points, we study the number of orderings of $S$ induced by measuring the distance (for one vantage point) or the average distance (for two vantage points)…

This paper presents the solution to the following optimization problem: What is the shape of the two-dimensional region that minimizes the average L_p distance between all pairs of points if the area of this region is held fixed? [The L_p…

The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works have explored the…

We investigate how efficient each area of urban street network is connected. Using the detour index, geographic features of street network and pairwise efficiency is studied. To do so, the detour index of 1,832,118 travel route pairs for 85…

For given positive integers $m$ and $n$ with $m<n$, the Prouhet-Tarry-Escott problem asks if there exist two disjoint multisets of integers of size $n$ having identical $k$th moments for $1\leq k\leq m$; in the ideal case one requires…

Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network…

We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries. We show that this model admits strictly more efficient…

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

Given a set $P$ of $n$ points and a set $S$ of $n$ segments in the plane, we consider the problem of computing for each segment of $S$ its closest point in $P$. The previously best algorithm solves the problem in $n^{4/3}2^{O(\log^*n)}$…

A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal…