Related papers: Characterizing Distances Between Points in the Lev…
It is shown that a set in product of $n$ metrizable spaces is the discontinuity points set of some separately continuous function if and only if this set can be represented as the union of a sequence of $F_{\sigma}$-sets which are locally…
Let $(X,d,\mu)$ be a space of homogeneous type. In this note we study the relationship between two types of $s$-sets: relative to a distance and relative to a measure. We find a condition on a closed subset $F$ of $X$ under which we have…
We define sequence patterns of length $n$ and level $\ell$ to be equivalence classes of sequences that have $n$ elements from the set of $\ell$ integer symbols $\{1,2,\ldots,\ell\}$ with no restriction on repetition, where the equivalence…
In this paper we study a sufficient conditions for continuous and almost continuous extensions of f to space X for an image space Y with different separation axioms.
The degree to which subjects differ from each other with respect to certain properties measured by a set of variables, plays an important role in many statistical methods. For example, classification, clustering, and data visualization…
We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C is fixed-parameter…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
We introduce an equivalence relation on the space $W^{1,1}(\Omega;{\mathbb S}^1)$ which classifies maps according to their "topological singularities". We establish sharp bounds for the distances (in the usual sense and in the Hausdorff…
We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial…
We consider the problem of computing the distance between two piecewise-linear bivariate functions $f$ and $g$ defined over a common domain $M$. We focus on the distance induced by the $L_2$-norm, that is $\|f-g\|_2=\sqrt{\iint_M (f-g)^2}$.…
When dealing with certain mathematical problems, it is sometimes necessary to show that some function induces a metric on a certain space. When this function is not a well renowned example of a distance, one has to develop very particular…
The main purpose of this paper is to explore normality in terms of distances between points and sets. We prove some important consequences on realvalued contractions, i.e. functions not enlarging the distance, showing that as in the…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
We construct a variety of mappings of the unit interval into $\mathcal{L}^p([0,1])$ to generalize classical examples of $\mathcal{L}^p$-convergence of sequences of functions with simultaneous pointwise divergence. By establishing relations…
The quantale of distance distributions is of fundamental importance for understanding probabilistic metric spaces as enriched categories. Motivated by the categorical interpretation of partial metric spaces, we are led to investigate the…
In this paper we consider certain types of betweenness axioms on the interval function $I_G$ of a connected graph $G$. We characterize the class of graphs for which $I_G$ satisfy these axioms. The class of graphs that we characterize…
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…
New Matlab functions for network centrality are introduced. Instead of the mean distance, the generalized mean distance is used. If closer relationships are prioritized, this closeness measure is also defined for unconnected graphs. Instead…