Many authors have been using the Hausdorffmetric to obtain fixed point and coincidence point theorems for multimaps on a metric space. In most cases, the metric nature of the Hausdorff metric is not used and the existence part of theorems can be proved without using the concept of Hausdorff metric under much less stringent conditions on maps. The aim of this paper is to illustrate this and to o...

We explore in depth the theory behind deterministic fractals by investigat­ ing transformations on metric spaces and the contraction mapping theorem. In doing so we introduce the notion of the Hausdorff distance metric and its connection to the space of fractals. In order to understand how deterministic fractals are generated, we develop the concept of an iterated function system (IFS) and what...

In [1] the pseudo-metric dist min on compact subsets A and B of a topological space generated from arbitrary metric space is defined. Using this notion we define the Hausdorff distance (see e.g. [5]) of A and B as a maximum of the two pseudo-distances: from A to B and from B to A. We justify its distance properties. At the end we define some special notions which enable to apply the Hausdorff d...

We show that Bowen’s equation, which characterises the Hausdorff dimension of certain sets in terms of the topological pressure of an expanding conformal map, applies in greater generality than has been heretofore established. In particular, we consider an arbitrary subset Z of a compact metric space and require only that the lower Lyapunov exponents be positive on Z, together with a tempered c...

In [2] the pseudo-metric distmax min on compact subsets A and B of a topological space generated from arbitrary metric space is defined. Using this notion we define the Hausdorff distance (see e.g. [6]) of A and B as a maximum of the two pseudo-distances: from A to B and from B to A. We justify its distance properties. At the end we define some special notions which enable to apply the Hausdorf...

There are two fundamental results in the classical theory of metric Diophantine approximation: Khintchine’s theorem and Jarńık’s theorem. The former relates the size of the set of well approximable numbers, expressed in terms of Lebesgue measure, to the behavior of a certain volume sum. The latter is a Hausdorff measure version of the former. We start by discussing these theorems and show that ...

We propose a new approach to assigning distance between fuzzy numbers. A pseudo-metric on the set of fuzzy numbers and a metric on the set of trapezoidal fuzzy numbers are described. The regular reducing functions and the Hausdorff metric are used to define the metric. Using this metric, we can approximate an arbitrary generalized left right fuzzy number with a trapezoidal one. Finally, powers ...

We equip the space M(X) of all Borel probability measures an a compact Riemannian manifold X with a canonical distance function which induces the weak-∗ topology on M(X) and has the following property: the map X 7→ M(X) is Lipschitz continous with respect to the Gromov-Hausdorff distance on the space of all the (isometry classes of) compact metric spaces. Introduction Last century brought sever...

It is well known that a microperiodic function mapping a topological group into reals, which is continuous at some point is constant. We introduce the notion of a microperiodic multifunction, defined on a topological group with values in a metric space, and study regularity conditions implying an analogous result. We deal with Vietoris and Hausdorff continuity concepts.Stability of microperiodi...

We extend the Voronoi diagram framework to compute the critical area of a circuit layout [15, 12, 16, 13, 14] with the ability to accurately compute critical area for via-blocks on via and contact layers in the presence of multilayer loops, redundant vias, and redundant interconnects. Critical area is a measure reflecting the sensitivity of a VLSI design to random defects during IC manufacturin...