Objectives: To establish a fixed-point theorem on complete S -metric space. Methods: By using (E.A)-property of self-maps and applying the concept strong comparison function. Findings: Obtained unique common for four S-metric space validated it with suitable example. Novelty: utilizing weak compatibility together (E.A)- property, fixed point is obtained which more robust generalization existing...

This study deals with an establishment of some common fixed point theorems for weak sub sequential continuous and compatibility of type (E) maps via C-class functions in a non Archimedean Menger Probabilistic Metric space.

In this paper we introduced the (E.A.)-property and weak compatibility of mappings in G-metric spaces. We have utilized these concepts to deduce certain common fixed point theorems in G-metric space

Silver nanoparticles (AgNPs) have tremendous potentials in medical devices due to their excellent antimicrobial properties. Blood compatibility should be investigated for AgNPs due to the potential blood contact. However, so far, most studies are not systematic and have not provided insights into the mechanisms for blood compatibility of AgNPs. In this study, we have investigated the blood biol...

Building on the work in \cite{BCH15,CH18,TIVP17}, this article we propose and study a simple, geometrically constrained, probabilistic algorithm geared towards capturing some aspects of nucleation shape-memory alloys. As main novelty with respect to algorithms \cite{BCH15,CH18,TIVP17} include \emph{mechanical compatibility}. The mechanical compatibility here is guaranteed by using \emph{convex ...

In this paper, we prove a general common fixed point theorem for two pairs of weakly compatible self-mappings of a metric space satisfying a weak Meir-Keeler type contractive condition by using a class of implicit relations. In particular, our result generalizes and improves a result of K. Jha, R.P. Pant, S.L. Singh, by removing the assumption of continuity, relaxing compatibility to weakly com...

We discuss different regularity notions for Lp-wellposed linear systems with 1 p < ∞: – compatibility in the sense of Helton (1976), – weak regularity in the sense of Weiss and Weiss (1997) or Staffans and Weiss (2000), – strong regularity in the sense of Weiss (1994a), – uniform regularity in the sense of Helton (1976) and Ober and Wu (1996). Compatibility is the minimal assumption if we want ...

We provide a characterization of virtual Bayesian implementation in pure strategies for environments satisfying no-total-indifference. A social choice function in such environments is virtually Bayesian implementable if and only if it satisfies incentive compatibility and a condition we term virtual monotonicity. The latter is weaker than Bayesian monotonicity known to be necessary for Bayesian...