Related papers: Computing the Distance between Piecewise-Linear Bi…
We bound the mean distance in a connected graph which is not a tree in function of its order $n$ and its girth $g$. On one hand, we show that mean distance is at most $\frac{n+1}{3}-\frac{g(g^2-4)}{12n(n-1)}$ if $g$ is even and at most…
In this paper, we introduced some notions on the n-Normed Spaces. Those are bounded k-linear (or multilinear) functionals and k-continuous (or multicontinuous) functions with k \in \mathbb{N}. We defined k-linear functionals under several…
This work establishes computable bounds between f-divergences for probability measures within a generalized quasi-$\varepsilon_{(M,m)}$-neighborhood framework. We make the following key contributions. (1) a unified characterization of local…
We study stochastic optimization problems with objective function given by the expectation of the maximum of two linear functions defined on the component random variables of a multivariate Gaussian distribution. We consider random…
In this paper we deal with the task of uniformly approximating an $L$-biLipschitz curve by means of piecewise linear ones. This is rather simple if one is satisfied to have approximating functions which are $L'$-biLipschitz, for instance…
There are many applications that benefit from computing the exact divergence between 2 discrete probability measures, including machine learning. Unfortunately, in the absence of any assumptions on the structure or independencies within…
A threshold graph G on n vertices is defined by binary sequence of length n. In this paper we present an explicit formula for computing the distance characteristic polynomial of a threshold graph from its binary sequence. As application, we…
Monotone systems preserve a partial ordering of states along system trajectories and are often amenable to separable Lyapunov functions that are either the sum or the maximum of a collection of functions of a scalar argument. In this paper,…
Purpose of writing this paper is to solve a transcendental function containing a product of a variable and its double exponential by a unique method of approximation. If the value of the said product is given, then its inverse function is…
The separation dimension of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before…
In this paper, the notion of dimension preserving approximation for real-valued bivariate continuous functions, defined on a rectangular domain $\rectangle$, has been introduced and several results, similar to well-known results of…
In the field of topological data analysis, persistence modules are used to express geometrical features of data sets. The matching distance $d_\mathcal{M}$ measures the difference between $2$-parameter persistence modules by taking the…
This paper presents a fast algorithm for projecting a given function to the set of shift orthogonal functions (i.e. set containing functions with unit $L^2$ norm that are orthogonal to their prescribed shifts). The algorithm can be…
We study $q$-variation inequality for bilinear averaging operators over convex bodies $(G_t)_{t>0}$ defined by \begin{align*} \mathbf{A}_t^G(f_1,f_2)(x) & =\frac{1}{|G_t|}\int_{G_t} f_1(x+y_1)f_2(x+y_2)\, dy_1\, dy_2, \quad x\in \Bbb R^d.…
A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.
We discuss the following question: For a function f of two or more variables which is convex in the directions of coordinate axes, how can its trace g(x) = f(x, x, ..., x) look like? In the two-dimensional case, we provide some necessary…
This paper prescribes a distance between learning tasks modeled as joint distributions on data and labels. Using tools in information geometry, the distance is defined to be the length of the shortest weight trajectory on a Riemannian…
We study the best approximation and distance problems in the operator space $\B(\HS)$ and in the space of trace class operators $\LS^1(\B(\HS))$. Formulations of distances are obtained in both cases. The case of finite-dimensional…
We prove fractional Leibniz rules and related commutator estimates in the settings of weighted and variable Lebesgue spaces. Our main tools are uniform weighted estimates for sequences of square-function-type operators and a bilinear…
In this paper we study Hankel operators in the quaternionic setting. In particular we prove that they can be exploited to measure the $L^{\infty}$ distance of a slice $L^{\infty}$ function from the space of bounded slice regular functions.