相关论文: Center of distances and Bernstein sets

Basic properties of the center of distances of a set are investigated. Computation of the center for achievement sets is particularly aimed at. A new sufficient condition for the center of distances of the set of subsums of a fast…

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 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…

In this paper we shall give a short proof of the result originally obtained by Ashutosh Kumar that for each $A\subset \mathbb{R}$ there exists $B\subset A$ full in $A$ such that no distance between two distinct points from $B$ is rational.…

In this paper, we prove the following version of the famous Bernstein's theorem: Let $X\subset \mathbb R^{n+k}$ be a closed and connected set with Hausdorff dimension $n$. Assume that $X$ satisfies the monotonicity formula at $p\in X$.…

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…

In this paper, we introduce a notion of the center and radius of a subset A of metric space X. In the Euclidean spaces, this notion can be seen as the extension of the center and radius of open/closed balls. The center and radius of a…

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…

Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…

It is shown that given a set of $N$ points in the plane or on the sphere, there is a subset of size $\gtrsim N^{1/3}/\log N$ with all pairwise distances between points distinct.

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

For any $d\in \mathbb{N}$ and any function $f:(0,\infty)\to [0,1]$ with $f(R)\to 0$ as $R\to \infty$, we construct a set $A \subseteq \mathbb{R}^d$ and a sequence $R_n \to \infty$ such that $\|x-y\| \neq R_n$ for all $x,y\in A$ and…

Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…

We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…

In this paper, we introduce notions of $J$-set near zero and $C$-set near zero for a dense subsemigroup of $((0,+\infty),+)$ and obtain some results for them. Also we derive the Central Sets Theorem near zero.

We present an algorithm of clustering of many-dimensional objects, where only the distances between objects are used. Centers of classes are found with the aid of neuron-like procedure with lateral inhibition. The result of clustering does…

Let (X, d) be a Cat(k) space and P a bounded subset of X . If k > 0 then it is required that the diameter of P be less than Pi/(4 sqrt(k)) . Let u: P to R be a bounded non-negative function from P to R. The existence of a unique point in X…

In this paper we address the question whether in a given Banach space, a Chebyshev center of a nonempty bounded subset can be a farthest point of the set. Our exploration reveals that the answer depends on the convexity properties of the…