In this paper, we are proposing a flexible method for constructing bivariate generalized Farlie-Gumbel-Morgenstern (G-FGM) copula family. The is mainly developed around the function $\phi(t)$ ($t\in [0,1]$), where $\phi$ generator of G-FGM copula. proposed construction has useful advantages. first which direct relationship between and Kendall's tau. second advantage possibility multi-parameter ...

let $mathcal{a}$ and $mathcal{b}$ be two $c^{*}$-algebras such that $mathcal{b}$ is prime. in this paper, we investigate the additivity of maps $phi$ from $mathcal{a}$ onto $mathcal{b}$ that are bijective, unital and satisfy $phi(ap+eta pa^{*})=phi(a)phi(p)+eta phi(p)phi(a)^{*},$ for all $ainmathcal{a}$ and $pin{p_{1},i_{mathcal{a}}-p_{1}}$ where $p_{1}$ is a nontrivial projection in $mathcal{a...

Let $mathcal{A}$ and $mathcal{B}$ be two $C^{*}$-algebras such that $mathcal{B}$ is prime. In this paper, we investigate the additivity of maps $Phi$ from $mathcal{A}$ onto $mathcal{B}$ that are bijective, unital and satisfy $Phi(AP+eta PA^{*})=Phi(A)Phi(P)+eta Phi(P)Phi(A)^{*},$ for all $Ainmathcal{A}$ and $Pin{P_{1},I_{mathcal{A}}-P_{1}}$ where $P_{1}$ is a nontrivial projection in $mathcal{A...

The purpose of this paper is to introduce some new classes of rings and modules that are closely related to the classes of almost Dedekind domains and almost Dedekind modules. We introduce the concepts of $\phi$-almost Dedekind rings and $\Phi$-almost Dedekind modules and study some properties of this classes. In this paper we get some equivalent conditions for $\phi$-almost Dedekind rings and ...

in this paper we study the concept of ph-biatness ofa banach algebra a, where ph is a continuous homomorphism on a.we prove that if ph is a continuous epimorphism on a and a hasa bounded approximate identity and a is ph- biat, then a is ph-amenable. in the case where ph is an isomorphism on a we showthat the ph- amenability of a implies its ph-biatness.

‎inspired by the work of suzuki in‎ ‎[t. suzuki‎, ‎a generalized banach contraction principle that characterizes metric completeness‎, proc‎. ‎amer‎. ‎math‎. ‎soc. ‎136 (2008)‎, ‎1861--1869]‎, ‎we prove a fixed point theorem for contractive mappings‎ ‎that generalizes a theorem of geraghty in [m.a‎. ‎geraghty‎, ‎on contractive mappings‎, ‎proc‎. ‎amer‎. ‎math‎. ‎soc., ‎40 (1973)‎, ‎604--608]‎an...

In the encoding of many real-world problems to propositional satisfiability, the cardinality constraint is a recurrent constraint that needs to be managed effectively. Several efficient encodings have been proposed while missing that such a constraint can be involved in a more general propositional formulation. To avoid combinatorial explosion, Tseitin principle usually used to translate such g...