نتایج جستجو برای: weakly compatible pairs
تعداد نتایج: 201658 فیلتر نتایج به سال:
In this paper, we obtain common fixed point theorem for common property(E.A.) and weakly compatible functions in intuitionistic fuzzy metric space.
In this paper, employing the property (E.A), we prove a common fixed theorem for weakly compatible maps using contractive condition in intuitionistic fuzzy metric space.
Lack of long-time stability dsDNA-based supramolecular assemblies is an important issue that hinders their applications. In this work, 20 base pairs long dsDNA fragments [(dCdG)20-65 %] composed 65 % dCdG and 35 dAdT nucleotides were tethered via a thiol to the surface gold electrode. The self-assembled (dCdG)20-65 monolayer was immersed in solutions containing ectoine, compatible solute. Elect...
Let F be a family of pairs of sets. We call it an (a, b)-set system if for every set-pair (A,B) in F we have that |A| = a, |B| = b, A ∩ B = ∅. The following classical result on families of cross-intersecting set-pairs is due to Bollobás [6]. Let F be an (a, b)-set system with the cross-intersecting property, i.e., for (Ai, Bi), (Aj, Bj) ∈ F with i 6= j we have that both Ai ∩ Bj and Aj ∩ Bi are ...
INTRODUCTION There have been a number of generalizations of metric spaces. One such generalization is Menger space introduced in 1942 by Menger[9] who used distribution functions instead of nonnegative real numbers as values of the metric. This space was expanded rapidly with the pioneering works of Schweizer and Sklar [11, 12]. Modifying the idea of Kramosil and Michalek [7], George and Veeram...
We introduce a generalization of semistandard composition tableaux called permuted composition tableaux. These tableaux are intimately related to permuted basement semistandard augmented fillings studied by Haglund, Mason and Remmel. Our primary motivation for studying permuted composition tableaux is to enumerate all possible ordered pairs of permutations (σ1, σ2) that can be obtained by stand...
Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ $K_n$ in $\mathbb{R}^3$ such that some cycle links a with non-zero linking number. We say are weakly linked if the absolute value number any is $0$ or $1$. Our main result an algebraic characterisation when pair disjointly embedded linked.
 As step towards this result, we show linked, then each contains either vertex common to...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید