نتایج جستجو برای: if set
تعداد نتایج: 1258182 فیلتر نتایج به سال:
Let S be a semigroup with a left multiplier on S. A new product on S is defined by related to S and such that S and the new semigroup ST have the same underlying set as S. It is shown that if is injective then where, is the extension of on Also, we show that if is bijective then is amenable if and only if is so. Moreover, if S completely regular, then is weakly amenable.
The backing of the fuzzy ideal is normal ideal in some ring and in same time there fuzzy set whose is not fuzzy ideal and it backing set is ideal, i.e., it crisp is normal ideal. Consequently, in this paper we constructing a fuzziness function which defined on fuzzy sets and assigns membership grade for every fuzzy set whose it backing set are crisp ideal. Now, Let be collection of all fuzzy s...
we present a characterization of arens regular semigroup algebras $ell^1(s)$, for a large class of semigroups. mainly, we show that if the set of idempotents of an inverse semigroup $s$ is finite, then $ell^1(s)$ is arens regular if and only if $s$ is finite.
This paper investigates the powerplay in one-day cricket. The rules concerning the powerplay have been tinkered with over the years, and therefore the primary motivation of the paper is the assessment of the impact of the powerplay with respect to scoring. The form of the analysis takes a “what if” approach where powerplay outcomes are substituted with what might have happened had there been no...
let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...
in this paper, countable compactness and the lindel¨of propertyare defined for l-fuzzy sets, where l is a complete de morgan algebra. theydon’t rely on the structure of the basis lattice l and no distributivity is requiredin l. a fuzzy compact l-set is countably compact and has the lindel¨ofproperty. an l-set having the lindel¨of property is countably compact if andonly if it is fuzzy compact. ...
Let R be a commutative ring with identity such that R admits at least two maximal ideals. In this article, we associate a graph with R whose vertex set is the set of all proper ideals I of R such that I is not contained in the Jacobson radical of R and distinct vertices I and J are joined by an edge if and only if I and J are not comparable under the inclusion relation. The aim of this article ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید