Related papers: Characterizing Distances Between Points in the Lev…

The Reeb graph is a construction that studies a topological space through the lens of a real valued function. It has widely been used in applications, however its use on real data means that it is desirable and increasingly necessary to…

We study properties of strongly separately continuous mappings defined on subsets of products of topological spaces equipped with the topology of pointwise convergence. In particular, we give a necessary and sufficient condition for a…

Family of quasi-arithmetic means has a natural, partial order (point-wise order) $A^{[f]}\le A^{[g]}$ if and only if $A^{[f]}(v)\le A^{[g]}(v)$ for all admissible vectors $v$ ($f,\,g$ and, later, $h$ are continuous and monotone and defined…

This paper relates parameter distance to gradient breakdown for a broad class of nonlinear compositional functions. The analysis leads to a new distance function called deep relative trust and a descent lemma for neural networks. Since the…

Let $\Lambda_s$ denote the Lipschitz space of order $s\in(0,\infty)$ on $\mathbb{R}^n$, which consists of all $f\in\mathfrak{C}\cap L^\infty$ such that, for some constant $L\in(0,\infty)$ and some integer $r\in(s,\infty)$, \begin{equation*}…

We prove that there exist functions $f,g:\mathbb{N}\to\mathbb{N}$ such that for all nonnegative integers $k$ and $d$, for every graph $G$, either $G$ contains $k$ cycles such that vertices of different cycles have distance greater than $d$…

We seek for lines of minimal distance to finitely many points in the plane. The distance between a line and a set of points is defined by the L^p-norm, 1\leq p\leq \infty, of the vector of vertical or orthogonal distances from the single…

Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality, and restriction of the distance to finite chains may or may not coincide with the…

Let $P$ be a positive rational number. Call a function $f:\mathbb{R}\rightarrow\mathbb{R}$ to have $\textit{finite gaps property mod}$ $P$ if the following holds: for any positive irrational $\alpha$ and positive integer $M$, when the…

A function between two metric spaces is said to be totally bounded regular if it preserves totally bounded sets. These functions need not be continuous in general. Hence the purpose of this article is to study such functions vis-\'a-vis…

We study one class of continuous functions $f$ defined on segment $[0,1]$ by equality $$ f(x)=\delta_{\alpha_1(x)1}+\sum^{\infty}_{k=2}\left[\delta_{\alpha_k(x)k}\prod^{k-1}_{j=1}g_{\alpha_j…

We examine a parameterized family of functions F_a, all of which are continuous and some of which are nowhere or almost nowhere differentiable, we explore the behavior of F'_a and F"_a almost everywhere for different values of a, focusing…

This work briefly explores the possibility of approximating spatial distance (alternatively, similarity) between data points using the Isolation Forest method envisioned for outlier detection. The logic is similar to that of isolation: the…

In this note, continuous transitive maps $f$ on the interval $I$ are re-addressed, where $I$ denotes one of the intervals: $(-\infty, \infty)$, $(-\infty, a]$, $[b, \infty)$, $[a, b]$, where $a < b$ are real numbers. Such maps must have a…

We prove that if $P$ is a set of $n$ points in $\mathbb{C}^2$, then either the points in $P$ determine $\Omega(n^{1-\epsilon})$ complex distances, or $P$ is contained in a line with slope $\pm i$. If the latter occurs then each pair of…

Fuzzy closure spaces are an extension of classical closure spaces in topology, where the concept of closure is defined in terms of fuzzy sets. This article introduces interior operators and neighborhood systems in fuzzy closure spaces.…

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

Given a finitely-connected bounded planar domain $\Omega$, it is possible to define a {\it divergence distance} $D(x,y)$ from $x\in\Omega$ to $y\in\Omega$, which takes into account the complex geometry of the domain. This distance function…

It is a well-known result by Saks \cite{Saks1934} that there exists a function $f \in L^1(\mathbb{R}^2)$ so that for almost every $(x,y)\in \mathbb{R}^2$ \[ \lim_{\substack{\mathrm{diam} R\rightarrow 0, \\ (x,y) \in R \in…

We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…