Search results for " Distance"
showing 10 items of 696 documents
On a pair of fuzzy $\varphi$-contractive mappings
2010
We establish common fixed point theorems for fuzzy mappings under a $\varphi$-contraction condition on a metric space with the d_$\infty$-metric (induced by the Hausdorff metric) on the family of fuzzy sets. The study of fixed points of fuzzy set-valued mappings related to the d_$\infty$-metric is useful in geometric problems arising in high energy physics. Our results generalize some recent results.
A Suzuki type fixed point theorem for a generalized multivalued mapping on partial Hausdorff metric spaces
2013
Abstract In this paper, we obtain a Suzuki type fixed point theorem for a generalized multivalued mapping on a partial Hausdorff metric space. As a consequence of the presented results, we discuss the existence and uniqueness of the bounded solution of a functional equation arising in dynamic programming.
On the points realizing the distance to a definable set
2011
Abstract We prove a definable/subanalytic version of a useful lemma, presumably due to John Nash, concerning the points realizing the Euclidean distance to an analytic submanifold of R n . We present a parameter version of the main result and we discuss the properties of the multifunction obtained.
Finite linear spaces in which any n-gon is euclidean
1986
Abstract An n-gon of a linear space is a set S of n points no three of which are collinear. By a diagonal point of S we mean a point p off S with the property that at least two lines through p intersect S in two points. The number of diagonal points is called the type of S. For example, a 4-gon has at most three diagonal points. We call an n-gon euclidean if (roughly speaking) it contains the maximal possible number of 4-gons of type 3. In this paper, we characterize all finite linear spaces in which, for a fixed number n ⩾ 5, any n-gon is euclidean. It turns out that these structures are essentially projective spaces or punctured projective spaces.
Best Proximity Point Results in Non-Archimedean Fuzzy Metric Spaces
2013
We consider the problem of finding a best proximity point which achieves the minimum distance between two nonempty sets in a non-Archimedean fuzzy metric space. First we prove the existence and uniqueness of the best proximity point by using di fferent contractive conditions, then we present some examples to support our best proximity point theorems.
An extension of the Burrows-Wheeler Transform
2007
AbstractWe describe and highlight a generalization of the Burrows–Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A∗. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Partial Hausdorff metric and Nadler’s fixed point theorem on partial metric spaces
2012
Abstract In this paper, we introduce the concept of a partial Hausdorff metric. We initiate study of fixed point theory for multi-valued mappings on partial metric space using the partial Hausdorff metric and prove an analogous to the well-known Nadlerʼs fixed point theorem. Moreover, we give a homotopy result as application of our main result.
Transportation cost inequalities on path and loop groups
2005
AbstractLet G be a connected Lie group with the Lie algebra G. The action of Cameron–Martin space H(G) on the path space Pe(G) introduced by L. Gross (Illinois J. Math. 36 (1992) 447) is free. Using this fact, we define the H-distance on Pe(G), which enables us to establish a transportation cost inequality on Pe(G). This method will be generalized to the path space over the loop group Le(G), so that we obtain a transportation cost inequality for heat measures on Le(G).
Scalable Ellipsoidal Classification for Bipartite Quantum States
2008
The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to this ellipsoid. If the vectorized Density Operator falls inside the ellipsoid, it is regarded as s…
Efficient algorithm for learning simple regular expressions from noisy examples
1994
We present an efficient algorithm for finding approximate repetitions in a given sequence of characters. First, we define a class of simple regular expressions which are of star-height one and do not contain union operations, and a stochastic mutation process of a given length over a string of characters. Then, assuming that a given string of characters is obtained corrupted by the defined mutation process from some long enough word generated by a simple regular expression, we try to restore the expression. We prove that to within some reasonable accuracy it is always possible if the length of the mutation process is bounded comparing to the length of the example. We provide an algorithm by…