Related papers: Approimate satisfaction of identities
We consider a discrete-time, continuous-state random walk with steps uniformly distributed in a disk of radius of $h$. For a simply connected domain $D$ in the plane, let $\omega_h(0,\cdot;D)$ be the discrete harmonic measure at $0\in D$…
Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…
We show that the two-point function \sigma(x,x')=\sqrt{<[\phi(x)-\phi(x')]^{2}>} of a scalar quantum field theory is a metric (i.e., a symmetric positive function satisfying the triangle inequality) on space-time (with imaginary time). It…
A new sequential approach to investigations of structure of metric spaces at infinity is proposed. Criteria for finiteness and boundedness of metric spaces at infinity are found.
In his previous works the author introduced the notion of the stereotype approximation property as an analog of the classical approximation property transferred to the category ${\tt Ste}$ of stereotype spaces. It is known, that the study…
Let $(X,d)$ be a compact metric space. We consider the behavior of probability measures $\mu$ with the property that $$ \int_{X} d(x, y) d\mu(y) \qquad \mbox{is independent of}~x \in X.$$ It appears that such measures, when they exist,…
A generalization of metric space is presented which is shown to admit a theory strongly related to that of ordinary metric spaces. To avoid the topological effects related to dropping any of the axioms of metric space, first a new, and…
Given an extended real-valued submeasure $\nu$ defined on a field of subsets $\Sigma$ of a given set, we provide necessary and sufficient conditions for which the pseudometric $d_\nu$ defined by $d_{\nu}(A,B):=\min\{1,\nu(A\bigtriangleup…
A topological space $A$ is said to be compatible with a set $\Sigma$ of equations (involving operation symbols $F_t$) iff there are continuous operations $\overline F_t$ identically satisfying $\Sigma$ on $A$. The paper's main focus is on…
Aim of this paper is to show that it makes sense to write the continuity equation on a metric measure space $(X,d,m)$ and that absolutely continuous curves $\mu_t$ w.r.t. the distance $W_2$ can be completely characterized as solutions of…
The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.
We classify the metric spaces that can be approximated by finite homogeneous ones.
The concept of complexity appears in virtually all areas of knowledge. Its intuitive meaning shares similarities across fields, but disagreements between its details hinders a general definition, leading to a plethora of proposed…
We explore the notion of degree of asymmetry for integer sequences and related combinatorial objects. The degree of asymmetry is a new combinatorial statistic that measures how far an object is from being symmetric. We define this notion…
We provide a detailed description of the model Hilbert space $L^2(\bbR; d\Sigma; \cK)$, were $\cK$ represents a complex, separable Hilbert space, and $\Sigma$ denotes a bounded operator-valued measure. In particular, we show that several…
We define the concept of self-similarity of an object by considering endomorphisms of the object as `similarity' maps. A variety of interesting examples of self-similar objects in geometry, algebra and arithmetic are introduced.…
We introduce $(\gamma,\delta)$-similarity, a notion of system comparison that measures to what extent two stable linear dynamical systems behave similarly in an input-output sense. This behavioral similarity is characterized by measuring…
In algorithms for finite metric spaces, it is common to assume that the distance between two points can be computed in constant time, and complexity bounds are expressed only in terms of the number of points of the metric space. We…
A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere…
Similarity search is an important problem in information retrieval. This similarity is based on a distance. Symbolic representation of time series has attracted many researchers recently, since it reduces the dimensionality of these high…