Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R d , consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of Dekking coincidenc...

In this paper, coincidence point and common fixed point results with the concept of generalized altering distance functions in complete ordered metric spaces are derived. These results generalize the existing fixed point results in the literature. To illustrate our results and to distinguish them from the existing ones, we equip the paper with examples. As an application, we study the existence...

We prove that there is a coincidence index for the inclusion F (x) ∈ Φ(x) when Φ is convex-valued and satisfies certain compactness assumptions on countable sets. For F we assume only that it provides a coincidence index for single-valued finite-dimensional maps (e.g. F is a Vietoris map). For the special case F = id, the obtained fixed point index is defined if Φ is countably condensing; the a...

Some fixed and coincidence point theorems for R-weakly commuting mappings are obtained. Our results generalize some recent results of Daffer and Kaneko [2] and many of the others. AMS Mathematics Subject Classification (2000): 54H25

Abstract: In this paper, we establish a new coupled coincidence point results in partially ordered probabilistic metric spaces by utilizing the Gauge function. We use the compatibility condition between two mappings. We use monotone and mixed monotone properties of functions with respect to the ordering. Our main result has several corollaries. The main result is supported with an example which...