in this paper, we prove a common fixed point theorem for six mappings (two set valued and four single valued mappings) without assuming compatibility and continuity of any mapping on non complete metric spaces. to prove the theorem, we use a non compatible condition, that is, weak commutativity of type (kb). we show that completeness of the whole space is not necessary for the existence and uni...

The hypothesis that planning music-like sequential actions involves anticipating their auditory effects was investigated in a series of experiments. Participants with varying levels of musical experience responded to each of four colour-patch stimuli by producing a unique sequence of three taps on three vertically aligned keys. Each tap triggered a tone in most experimental conditions. Response...

In a recent paper, “Why does deep and cheap learning work so well?”, Lin and Tegmark claim to show that the mapping between deep belief networks and the variational renormalization group derived in [1] is invalid, and present a “counterexample” that claims to show that this mapping does not hold. In this comment, we show that these claims are incorrect and stem from a misunderstanding of the va...

In this paper we study the existence of common fixed point for r-compatible mapping satisfying a generalized quasi contraction condition integral type in modular spaces Our results extend and generalize Beygmohammadi Razani [4] Moradi [25].

A classic finding in the choice reaction time (RT) literature is that RT is faster when stimulus and response correspond in the external space (compatible mapping) than when they do not correspond (incompatible mapping); e.g. Fitts and Deininger (1954). This effect is independent of the anatomical identity of the effecters involved in the task (Brebner et al. 1972) as well as of the amplitude (...

In this paper xed point and coincidence results are presented for two and three single-valued map-pings. These results extend previous results given by Rhoades (2003) and Djoudi and Merghadi(2008).

n this paper, we prove some common fixed point theorems for multivalued mappings and we present some new generalization contractive conditions under the condition of weak compatibility. Our results extends Chang-Chen’s results  as well as ´Ciri´c results. An example is given to support the usability of our results.

Current quantum annealing (QA) hardware suffers from practical limitations such as finite temperature, sparse connectivity, small qubit numbers, and control error. We propose new algorithms for mapping Boolean constraint satisfaction problems (CSPs) onto QA hardware mitigating these limitations. In particular, we develop a new embedding algorithm for mapping a CSP onto a hardware Ising model wi...