in this paper, vector ultrametric spaces are introduced and a fixed point theorem is given forcorrespondences. our main result generalizes a known theorem in ordinary ultrametric spaces.

‎Let ${X_{alpha}:alphainLambda}$ be a collection of topological spaces‎, ‎and $mathcal {G}_{alpha}$ be a grill on $X_{alpha}$ for each $alphainLambda$‎. ‎We consider Tychonoffrq{}s type Theorem for $X=prod_{alphainLambda}X_{alpha}$ via the above grills and a natural grill on $X$ ‎related to these grills, and present a simple proof to this theorem‎. ‎This immediately yields the classical theorem...

In this paper, we discuss the existence and uniqueness of fixed points for $G$-asymptotic contractions in metric spaces endowed with a graph. The result given here is a new version of Kirk's fixed point theorem for asymptotic contractions in metric spaces endowed with a graph. The given result here is a generalization of fixed point theorem for asymptotic contraction from metric s paces to metr...

 In this paper, some basic results concerning strict, nonstrict inequalities, local existence theorem and differential inequalities  have been proved for an IVP of first order hybrid  random differential equations with the linear perturbation of second type. A comparison theorem is proved and  applied to prove the uniqueness of random solution for the considered perturbed random differential eq...

In this paper, we introduce the concepts of $2$-isometry, collinearity, $2$%-Lipschitz mapping in $2$-fuzzy $2$-normed linear spaces. Also, we give anew generalization of the Mazur-Ulam theorem when $X$ is a $2$-fuzzy $2$%-normed linear space or $Im (X)$ is a fuzzy $2$-normed linear space, thatis, the Mazur-Ulam theorem holds, when the $2$-isometry mapped to a $2$%-fuzzy $2$-normed linear space...

Convexity theory and duality theory are important issues in math- ematical programming. Within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. Furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. Finally,...


 a variant of fixed point theorem is proved in the setting of s-metric spaces

‎let $x$ be a real normed  space, then  $c(subseteq x)$  is  functionally  convex  (briefly, $f$-convex), if  $t(c)subseteq bbb r $ is  convex for all bounded linear transformations $tin b(x,r)$; and $k(subseteq x)$  is  functionally   closed (briefly, $f$-closed), if  $t(k)subseteq bbb r $ is  closed  for all bounded linear transformations $tin b(x,r)$. we improve the    krein-milman theorem  ...