Related papers: Characterizing Distances Between Points in the Lev…

We study the two-player communication problem of determining whether two vertices $x, y$ are nearby in a graph $G$, with the goal of determining the graph structures that allow the problem to be solved with a constant-cost randomized…

This paper examines level sets of functions of the form $f(x)=\sum_{n=0}^\infty \frac{r_n}{2^n}\phi(2^n x)$, where phi(x) is the distance from x to the nearest integer, and r_n equals 1 or -1 for each n. Such functions are referred to as…

We study the arithmetic (real) function f=g*1, with g "essentially bounded" and supported over the integers of [1,Q]. In particular, we obtain non-trivial bounds, through f "correlations", for the "Selberg integral" and the "symmetry…

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

For a family of continuous functions $f_1,f_2,\dots \colon I \to \mathbb{R}$ ($I$ is a fixed interval) with $f_1\le f_2\le \dots$ define a set $$ I_f:=\big\{x \in I \colon \lim_{n \to \infty} f_n(x)=+\infty\big\}.$$ We study the properties…

We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information…

Let $\cal{P}$ be an affine invariant property of functions $\mathbb{F}_p^n \to [R]$ for fixed $p$ and $R$. We show that if $\cal{P}$ is locally testable with a constant number of queries, then one can estimate the distance of a function $f$…

On a complete, connected, locally compact, non-compact geodesic space $(X,d)$, we assign each compact set a distance-like function. With the help of these functions, we obtain a pseudo-metric on the space of (non-empty) compact subsets of…

We construct a family of closeness functions on the space of finite volume Lorentzian geometries using the abundance of discrete intervals in the underlying random causal sets. Although strictly weaker than a Lorentzian Gromov-Hausdorff…

Let $(\mathcal{M}, c_k, n_k,\kappa)$ be a class of homogeneous Moran sets. Suppose $f(x,y)\in C^3$ is a function defined on $\mathbb{R}^2$. Given $E_1, E_2\in(\mathcal{M}, c_k, n_k,\kappa) $, in this paper, we prove, under some checkable…

Given strong local Dirichlet forms and $\mathbb{R}^N$-valued functions on a metrizable space, we introduce the concepts of geodesic distance and intrinsic distance on the basis of these objects. They are defined in a geometric and an…

We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…

Universal scaling of distances between vertices of Erdos-Renyi random graphs, scale-free Barabasi-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks are observed. A…

We propose a general approach to defining a contractive-like multivalued mappings $F$ which avoids any use of the Hausdorff distance between the sets $F(x)$ and $F(y)$. Various fixed point theorems are proved under a two-parameter control…

We provide a rigorous study on dimensions of fractal interpolation function defined on a closed and bounded interval of $\mathbb{R}$ which is associated to a continuous function with respect to a base function, scaling functions and a…

A monotone function interval is the set of monotone functions that lie pointwise between two fixed monotone functions. We characterize the set of extreme points of monotone function intervals and apply this to a number of economic settings.…

This article introduces the novel notion of dimension preserving approximation for continuous functions defined on $[0,1]$ and initiates the study of it. Restrictions and extensions of continuous functions in regards to fractal dimensions…

The degree distribution is an important characteristic of complex networks. In many applications, quantification of degree distribution in the form of a fixed-length feature vector is a necessary step. On the other hand, we often need to…

One of the prevailing ideas in geometric and topological data analysis is to provide descriptors that encode useful information about hidden objects from observed data. The Reeb graph is one such descriptor for a given scalar function. The…

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…