Related papers: Approimate satisfaction of identities

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

We introduce and systematically study a profile function whose asymptotic behavior quantifies the dimension or the size of a metric approximation of a finitely generated group $G$ by a family of groups $\mathcal{F}=\{(G_{\alpha},…

The Sinc approximation is a function approximation formula that attains exponential convergence for rapidly decaying functions defined on the whole real axis. Even for other functions, the Sinc approximation works accurately when combined…

Some concepts, such as non-compactness measure and condensing operators, defined on metric spaces are extended to uniform spaces. Such extensions allow us to locate, in the context of uniform spaces, some classical results existing in…

The invariance identity involving three operations $D_{f,g}:X\times X\rightarrow X$ of the form \begin{equation*} D_{f,g}\left( x,y\right) =\left( f\circ g\right) ^{-1}\left( f\left( x\right) \oplus g\left( y\right) \right) \text{,}…

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

We study the question of constructive approximation of the harmonic measure $\omega_x^\Omega$ of a connected bounded domain $\Omega$ with respect to a point $x\in\Omega$. In particular, using a new notion of computable harmonic…

We give an explicit bound for the $L_1$-distance between two additive processes of local characteristics $(f_j(\cdot),\sigma^2(\cdot),\nu_j)$, $j = 1,2$. The cases $\sigma =0$ and $\sigma > 0$ are both treated. We allow $\nu_1$ and $\nu_2$…

We call an objective function or algorithm symmetric with respect to an input if after swapping two parts of the input in any algorithm, the solution of the algorithm and the output remain the same. More formally, for a permutation $\pi$ of…

A lower semi-definite self-adjoint linear operator in a Hilbert space is taken whose discrete spectrum is not empty and comprises at least several eigenvalues $\lambda_{min}=\lambda_1\leqslant\ldots\leqslant\lambda_m<\sigma_{ess}$. The…

Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…

Extracting the relevant information by exploiting the spatial data warehouse becomes increasingly hard. In fact, because of the enormous amount of data stored in the spatial data warehouse, the user, usually, don't know what part of the…

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…

There has been much discussion recently about how fairness should be measured or enforced in classification. Individual Fairness [Dwork, Hardt, Pitassi, Reingold, Zemel, 2012], which requires that similar individuals be treated similarly,…

Let (X,d) be a metric space of p-negative type. Recently I. Doust and A. Weston introduced a quantification of the p-negative type property, the so called gap {\Gamma} of X. This talk introduces some formulas for the gap {\Gamma} of a…

This paper studies the properties of a new lower bound for the natural pseudo-distance. The natural pseudo-distance is a dissimilarity measure between shapes, where a shape is viewed as a topological space endowed with a real-valued…

We consider operators $L$ acting on functions on a Riemannian surface, $\Sigma$, of the form $L = \Delta + V +a K.$ Here $\Delta$ is the Laplacian of $\Sigma$, $V$ a non-negative potential on $\Sigma$, K the Gaussian curvature and $a$ is a…

Sequence classification algorithms, such as SVM, require a definition of distance (similarity) measure between two sequences. A commonly used notion of similarity is the number of matches between $k$-mers ($k$-length subsequences) in the…

Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…

Opacity is an important information-flow security property in the analysis of cyber-physical systems. It captures the plausible deniability of the system's secret behavior in the presence of an intruder that may access the information flow.…