Related papers: Characterizing Distances Between Points in the Lev…
A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…
In this paper we characterize the distance between the function $f$ and the set $C^{\infty}_{\mathrm{comp}}(\mathbb{R}^d)$ in generalized Morrey spaces $L_{p,\phi}(\mathbb{R}^d)$ with variable growth condition. We also prove that the…
Let $k$ be a natural number. We consider $k$-times continuously-differentiable real-valued functions $f:E\to\mathbb{R}$, where $E$ is some interval on the line having positive length. For $0<\alpha<1$ let $I_\alpha(f)$ denote the set of…
This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…
A finite set of distinct vectors $\mathcal{X}$ in the $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a $2$-distance set, if the set of mutual distances between distinct elements of $\mathcal{X}$ has cardinality exactly $2$. In…
A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…
The distance on a set is a comparative function. The smaller the distance between two elements of that set, the closer, or more similar, those elements are. Fr\'echet axiomatized the distance into what is today known as a metric. In this…
We propose a new class of metrics on sets, vectors, and functions that can be used in various stages of data mining, including exploratory data analysis, learning, and result interpretation. These new distance functions unify and generalize…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
Given a positive, non-increasing sequence $a$ with finite sum equal to $1$, we consider the family of all closed subsets of $[0,1]$ whose complementary open intervals have lengths given by a rearrangement of the sequence $a$. We study the…
We characterize the orderings of pairs of sets induced by several distances: Hamming, Jaccard, S\o rensen-Dice and Overlap. We also characterize these distances.
We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…
We study the complexity of approximations to the normalized information distance. We introduce a hierarchy of computable approximations by considering the number of oscillations. This is a function version of the difference hierarchy for…
The fixed-point analysis refers to the study of fixed-points that arise in the context of complex systems with many interacting entities. In this expository paper, we describe four levels of fixed-points in mean-field interacting particle…
This work considers the problem of estimating the distance between two covariance matrices directly from the data. Particularly, we are interested in the family of distances that can be expressed as sums of traces of functions that are…
Recently, a new distance has been introduced for the graphs of two point-to-set operators, one of which is maximally monotone. When both operators are the subdifferential of a proper lower semicontinuous convex function, this distance…
We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by…
We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a…
In this work we consider the general functional-integral equation: \begin{equation*} y(t) = f\left(t, \int_{a}^{b} k(t,s)g(s,y(s))ds\right), \qquad t\in [a,b], \end{equation*} and give conditions that guarantee existence and uniqueness of…
In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…