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...

The purpose of this paper is to prove some coincidence point theorems for non-linear hybrid contraction involving two pairs of single-valued and multivalued mappings on complete metric space.

In this paper we obtain new inclusion and coincidence theorems for absolutely or multiple summing multilinear mappings. In particular, we derive optimal coincidence theorems of Bohnenblust-Hille type for multilinear forms on K-convex Banach spaces of cotype 2.

in this paper, we establish an existence result of the solution for an generalized strong vector variational inequality already considered in the literature and as applications we obtain a new coincidence point theorem in hilbert spaces.