Related papers: Discrete metric spaces: structure, enumeration, an…

We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets (denoted IDENTIFYING CODE, (OPEN) LOCATING-DOMINATING SET and METRIC DIMENSION) of an interval or a permutation graph. In…

Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…

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…

We study Polish spaces for which a set of possible distances $A \subseteq \mathbb{R}^+$ is fixed in advance. We determine, depending on the properties of $A$, the complexity of the collection of all Polish metric spaces with distances in…

We develop various Ehrenfeucht-Fra\"{\i}ss\'{e} games for distances between metric structures. We study two forms of distances: pseudometrics stemming from mapping spaces onto each other with some form of approximate isomorphism, and…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

The class of O-metric spaces generalize several existing metric-types in literature including metric spaces, b-metric spaces, and ultra metric spaces. In this paper, we discuss the properties of the topology induced by an O-metric and…

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…

A marked metric measure space (mmm-space) is a triple (X,r,mu), where (X,r) is a complete and separable metric space and mu is a probability measure on XxI for some Polish space I of possible marks. We study the space of all (equivalence…

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

We develop the theory of a metric completion of an asymmetric metric space. We characterize the points on the boundary of Outer Space that are in the metric completion of Outer Space with the Lipschitz metric. We prove that the simplicial…

A metric space is said to be strongly rigid if no positive distance is taken twice by the metric. In 1972, Janos proved that a separable metrizable space has a strongly rigid metric if and only if it is zero-dimensional. In this paper, we…

A metric measure space $(X,\mu)$ is 1-regular if \[0< \lim_{r\to 0} \frac{\mu(B(x,r))}{r}<\infty\] for $\mu$-a.e $x\in X$. We give a complete geometric characterisation of the rectifiable and purely unrectifiable part of a 1-regular measure…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

The move structure represents a permutation $\pi$ of $[0,n)$ as a covering set of $O(r)$ disjoint intervals (contiguous subsets of $[0,n)$), where $r$ is the minimum number of intervals whose values permute together. Formally, $r = 1 +…

We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…

A mode of a multiset $S$ is an element $a \in S$ of maximum multiplicity; that is, $a$ occurs at least as frequently as any other element in $S$. Given a list $A[1:n]$ of $n$ items, we consider the problem of constructing a data structure…

We propose a novel measure of statistical depth, the metric spatial depth, for data residing in an arbitrary metric space. The measure assigns high (low) values for points located near (far away from) the bulk of the data distribution,…

Green and Sisask showed that the maximal number of $3$-term arithmetic progressions in $n$-element sets of integers is $\lceil n^2/2\rceil$; it is easy to see that the same holds if the set of integers is replaced by the real line or by any…

We study transportation cost spaces over finite metric spaces, also known as Lipschitz free spaces. Our work is motivated by a core problem posed by S. Dilworth, D. Kutzarova and M. Ostrovskii, namely, find a condition on a metric space $M$…