نتایج جستجو برای: o complete metric space

تعداد نتایج: 1414794  

In this paper, we explain a new generalized contractive condition for multivalued mappings and prove a fixed point theorem in metric spaces (not necessary complete) which extends some well-known results in the literature. Finally, as an application, we prove that a multivalued function satisfying a general linear functional inclusion admits a unique selection fulfilling the corresp...

Journal: :bulletin of the iranian mathematical society 2013
a. abkar m. eslamian

in this paper, we present some common fixed point theorems for two generalized nonexpansive multivalued mappings in cat(0) spaces as well as in uced banach spaces. moreover, we prove the existence of fixed points for generalized nonexpansive multivalued mappings in complete geodesic metric spaces with convex metric for which the asymptotic center of a bounded sequence in a bounded closed convex...

2013
Romain Abraham Jean-François Delmas Patrick Hoscheit

We present an extension of the Gromov-Hausdorff metric on the set of compact metric spaces: the Gromov-Hausdorff-Prokhorov metric on the set of compact metric spaces endowed with a finite measure. We then extend it to the non-compact case by describing a metric on the set of rooted complete locally compact length spaces endowed with a boundedly finite measure. We prove that this space with the ...

Journal: :CoRR 2009
Nicolas Catusse Victor Chepoi Yann Vaxès

In this paper, we present an optimal O(n) time algorithm for deciding if a metric space (X, d) on n points can be isometrically embedded into the plane endowed with the l1-metric. It improves the O(n 2 log n) time algorithm of J. Edmonds (2008). Together with some ingredients introduced by Edmonds, our algorithm uses the concept of tight span and the injectivity of the l1-plane. A different O(n...

Journal: :Theor. Comput. Sci. 2011
Nicolas Catusse Victor Chepoi Yann Vaxès

In this paper, we present an optimal O(n) time algorithm for deciding if a metric space (X, d) on n points can be isometrically embedded into the plane endowed with the l1-metric. It improves the O(n 2 log n) time algorithm of J. Edmonds (2008). Together with some ingredients introduced by Edmonds, our algorithm uses the concept of tight span and the injectivity of the l1-plane. A different O(n...

2012
James R. Lee Arnaud de Mesmay Mohammad Moharrami

We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...

2009
RENJIE FENG

We show that the classical Szasz analytic function SN (f)(x) is related to the Bergman kernel for the Bargmann-Fock space. Then we generalize this relation to any noncompact toric Kähler manifold, defining the generalized Szasz analytic function ShN (f)(x). Then we will prove the complete asymptotic expansion of ShN (f)(x) and its scaling limit property. As examples, we will compute the general...

Journal: :iranian journal of fuzzy systems 2013
antonio roldan juan martnez-moreno concepcion roldan

considering the increasing interest in fuzzy theory and possible applications,the concept of fuzzy metric space concept has been introduced by severalauthors from different perspectives. this paper interprets the theory in termsof metrics evaluated on fuzzy numbers and defines a strong hausdorff topology.we study interrelationships between this theory and other fuzzy theories suchas intuitionis...

Journal: :Polythematic Online Scientific Journal of Kuban State Agrarian University 2017

Journal: :Discrete & Computational Geometry 2013
James R. Lee Arnaud de Mesmay Mohammad Moharrami

We show that every n-point tree metric admits a (1 + ε)-embedding into ` C(ε) logn 1 , for every ε > 0, where C(ε) ≤ O ( ( 1ε ) 4 log 1ε ) ) . This matches the natural volume lower bound up to a factor depending only on ε. Previously, it was unknown whether even complete binary trees on n nodes could be embedded in ` O(logn) 1 with O(1) distortion. For complete d-ary trees, our construction ach...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید