R. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.

<p>In this paper, we prove there exists a coupled fixed point for a set- valued contraction mapping defined on X× X , where X is incomplete ordered G-metric. Also, we prove the existence of a unique fixed point for single valued mapping with respect to implicit condition defined on a complete G- metric.</p>

The purpose of this paper is to introduce and prove some coupled coincidence fixed point theorems for self mappings satisfying -contractive condition with rational expressions on complete partially ordered metric spaces involving altering distance functions with mixed monotone property of the mapping. Our results improve and unify a multitude of coupled fixed point theorems and generalize some recent results in partially ordered metric space. An example is given to show the validity of our main result. 

In the context of normed space, Banach's fixed point theorem for mapping is studied in this paper. This idea is generalized in Banach's classical fixed-point theory. Fixed point theory explains many situations where maps provide great answers through an amazing combination of mathematical analysis. Picard- Lendell's theorem, Picard's theorem, implicit function theorem, and other results are created by other mathematicians later using this fixed-point theorem. We have come up with ideas that Banach's theorem can be used to easily deduce many well-known fixed-point theorems. Extending the Banach contraction principle to include metric space with modular spaces has been included in some recent research, the aim of study proves some pro

In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.

In this paper, we will focus to one of the recent applications of PU-algebras in the coding theory, namely the construction of codes by soft sets PU-valued functions. First, we shall introduce the notion of soft sets PU-valued functions on PU-algebra and investigate some of its related properties.Moreover, the codes generated by a soft sets PU-valued function are constructed and several examples are given. Furthermore, example with graphs of binary block code constructed from a soft sets PU-valued function is constructed.

This work aims to investigate the tensile and compression strengths of heat- cured acrylic resin denture base material by adding styrene-butadiene (S- B) to polymethyl methacrylate (PMMA). The most well- known issue in prosthodontic practice is fracture of a denture base. All samples were a blend of (90%, 80%) PMMA and (10%, 20%) S- B powder melted in Oxolane (Tetra hydro furan). These samples were chopped down into specimens of dimensions 100x10x2.5mm to carry out the requirements of tensile tests. The compression strength test specimens were shaped into a cylinder with dimensions of 12.7mm in diameter and 20mm in length. The experimental results show a significant increase in both tensile and compression strengths when compared to cont