Related papers: the center of distances for some multigeometric se…

The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove the inequality $|C(X)| \le 1 + \lfloor \log_2 n \rfloor$ for all…

In this paper we introduce the notion of the center of distances of a metric space, which is required for a generalization of the theorem by J. von Neumann about permutations of two sequences with the same set of cluster points in a compact…

We show that for any subset $A\subset [0,\infty)$, where $0\in A$, there exists a Bernstein set $X\subset \mathbb R$ such that $A$ is the center of distances of $X$.

The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove that the equalities $C(X)=\{0\}$ or $C(X)=\{0,\operatorname{diam}X\}…

The purpose of this paper is to give a survey on the notions of distance between subsets either of a metric space or of a measure space, including definitions, a classification, and a discussion of the best-known distance functions, which…

This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…

A metric space $\mathrm{M}=(M;\de)$ is {\em homogeneous} if for every isometry $f$ of a finite subspace of $\mathrm{M}$ to a subspace of $\mathrm{M}$ there exists an isometry of $\mathrm{M}$ onto $\mathrm{M}$ extending $f$. A metric space…

Measuring the distance between data points is fundamental to many statistical techniques, such as dimension reduction or clustering algorithms. However, improvements in data collection technologies has led to a growing versatility of…

An achievement set of a series is a set of all its subsums. We study the properties of achievement sets of conditionally convergent series in finite dimensional spaces. The purpose of the paper is to answer some of the open problems…

The geometric median, a notion of center for multivariate distributions, has gained recent attention in robust statistics and machine learning. Although conceptually distinct from the mean (i.e., expectation), we demonstrate that both are…

Considering the sets of subsums of series (or achievement sets) we show that for conditionally convergent series the multidimensional case is much more complicated than that of the real line. Although we are far from the full topological…

There are several remarkable points, defined for polygons and multisets of points in the plane, called centers (such as the centroid). To make possible their study, there exists a formal definition for the concept of center in both cases.…

We examine properties of achievement sets of series in $\mathbb{R}^2$. We show several examples of unusual sets of subsums on the plane. We prove that we can obtain any set of P-sums as a cut of an achievement set in $\mathbb{R}^2.$ We…

There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the…

A well-known object in classical Euclidean geometry is the circumcenter of a triangle, i.e., the point that is equidistant from all vertices. The purpose of this paper is to provide a systematic study of the circumcenter of sets containing…

The input to the \emph{sets-$k$-means} problem is an integer $k\geq 1$ and a set $\mathcal{P}=\{P_1,\cdots,P_n\}$ of sets in $\mathbb{R}^d$. The goal is to compute a set $C$ of $k$ centers (points) in $\mathbb{R}^d$ that minimizes the sum…

The Centre Symmetry Set of a planar curve $M$ is the envelope of affine chords of $M$, i.e. the lines joining points on $M$ with parallel tangent lines. In this paper we study global geometrical properties of this set including the number…

An $m$-distance set is a collection of points such that the distances between any two points have $m$ possible values. We use two different methods to construct large $m$-distance sets on the triangular lattices. One is to use the first m…

Here is presented a concept of centrogeometry which can be seen as a combination of the concept of point-like observer with an idea of Poincar\'{e}'s that different geometries are principally equivalent. As it is to be shown later, all…

Distance geometry is the study of the arrangements of points in space using only the mutual distances between them. The basic idea in this letter is to use distance geometry for thermodynamics studies of small clusters in the microcanonical…