Soft Neutrosophic Bi-LA-semigroup and Soft Neutrosophic N-LA-seigroup
|
|
- Hilary King
- 5 years ago
- Views:
Transcription
1 Neutrosophc Sets and Systems, Vol. 5, Soft Neutrosophc B-LA-semgroup and Soft Mumtaz Al, Florentn Smarandache, Muhammad Shabr 3,3 Department of Mathematcs, Quad--Azam Unversty, Islamabad, 44000,Pakstan. -mal: Unversty of New Mexco, 705 Gurley Ave., Gallup, New Mexco 8730, USA -mal: Abstract. Soft set theory s a general mathematcal tool for dealng wth uncertan, fuzzy, not clearly defned objects. In ths paper we ntroduced soft neutrosophc b- LA-semgroup,soft neutosophc sub b-la-semgroup, soft neutrosophc N -LA-semgroup wth the dscusson of some of ther characterstcs. We also ntroduced a new type of soft neutrophc b-lasemgroup, the so called soft strong neutrosophc b-lasemgoup whch s of pure neutrosophc character. Ths s also extend to soft neutrosophc strong N-LA-semgroup. We also gven some of ther propertes of ths newly born soft structure related to the strong part of neutrosophc theory. Keywords: Neutrosophc b-la-semgroup,neutrosophc N -LA-semgroup, Soft set, Soft neutrosophc b-lasemgroup. Soft Neutrosophc N -LA-semgroup. Introducton Florentne Smarandache for the frst tme ntroduced the concept of neutrosophy n 995, whch s bascally a new branch of phlosophy whch actually studes the orgn, nature, and scope of neutraltes. The neutrosophc logc came nto beng by neutrosophy. In neutrosophc logc each proposton s approxmated to have the percentage of truth n a subset T, the percentage of ndetermnacy n a subset I, and the percentage of falsty n a subset F. Neutrosophc logc s an extenson of fuzzy logc. In fact the neutrosophc set s the generalzaton of classcal set, fuzzy conventonal set, ntutonstc fuzzy set, and nterval valued fuzzy set. Neutrosophc logc s used to overcome the problems of mprecseness, ndetermnate, and nconsstences of date etc. The theory of neutrosophy s so applcable to every feld of algebra. W.B. Vasantha Kandasamy and Florentn Smarandache ntroduced neutrosophc felds, neutrosophc rngs, neutrosophc vector spaces, neutrosophc groups, neutrosophc bgroups and neutrosophc N -groups, neutrosophc semgroups, neutrosophc bsemgroups, and neutrosophc N -semgroups, neutrosophc loops, nuetrosophc bloops, and neutrosophc N -loops, and so on. Mumtaz al et. al. ntroduced nuetrosophc LA -semgroups. Soft neutrosophc LA-semgroup has been ntroduced by Florentn Smarandache et.al. Molodtsov ntroduced the theory of soft set. Ths mathematcal tool s free from parameterzaton nadequacy, syndrome of fuzzy set theory, rough set theory, probablty theory and so on. Ths theory has been appled successfully n many felds such as smoothness of functons, game theory, operaton research, emann ntegraton, Perron ntegraton, and probablty. ecently soft set theory attaned much attenton of the researchers snce ts appearance and the work based on several operatons of soft set ntroduced n,9,0. Some propertes and algebra may be found 5. By n. Feng et al. ntroduced soft semrngs n means of level soft sets an adjustable approach to fuzzy soft set can be seen n 6. Some other concepts together wth fuzzy set and rough set were shown n 7,8. In ths paper we ntroduced soft nuetrosophc b-lasemgroup and soft neutrosophc N -LA-semgroup and the related strong or pure part of neutrosophy wth the notons of soft set theory. In the proceedng secton, we defne soft neutrosophc b-la-semgroup, soft neutrosophc strong b-la-semgroup, and some of ther propertes are dscussed. In the last secton soft neutrosophc N -LAsemgroup and ther correspondng strong theory have been constructed wth some of ther propertes. Neutrosophc N-LA-segroup
2 46 Neutrosophc Sets and Systems, Vol. 5, 04 Fundamental Concepts Defnton. Let ( BN( S),, ) be a nonempty set wth two bnary operatons and. ( BN( S),, ) s sad to BN( S) P P be a neutrosophc b-la-semgroup f where atleast one of ( P, ) or ( P, ) s a neutrosophc LA-semgroup and other s just an LA- semgroup. P and P are proper subsets of If both ( P, ) and ( P, ) n the above defnton are neutrosophc LA-semgroups then we call ( BN( S),, ) a strong neutrosophc b-la-semgroup. Defnton. Let ( BN( S) P P;:, ) be a neutrosophc b-la-semgroup. A proper subset ( T,, ) s sad to be a neutrosophc sub b-la-semgroup of BN( S ) f. T T T where T P T and T PT and (, ) ( T, ) s a neutrosoph-. At least one of T or c LA-semgroup. Defnton 3. Let ( BN( S) P P,, ) be a neutrosophc b-la-semgroup. A proper subset ( T,, ) s sad to be a neutrosophc strong sub b-la-semgroup of BN( S ) f. T T T where T P T and T PT and. ( T, ) and ( T, ) are neutrosophc strong LAsemgroups. Defnton 4. Let ( BN( S) P P,, ) be any neutrosophc b-la-semgroup. Let J be a proper subset of BN( S ) such that J J P and J J P are deals of P and P respectvely. Then J s called the neutrosophc bdeal of Defnton 5. Let ( BN( S),, ) be a strong neutrosophc b-la-semgroup where BN( S) P P wth ( P, ) and ( P, ) be any two neutrosophc LA-semgroups. Let J be a proper subset of BN( S ) where I II wth I I P and I I P are neutrosophc deals of the neutrosophc LA-semgroups P and P respectvely. Then I s called or defned as the strong neutrosophc bdeal of Defnton 6. Let { SN ( ),,..., } be a non-empty set wth N -bnary operatons defned on t. We call SN ( ) a neutrosophc N -LA-semgroup ( N a postve nteger) f the followng condtons are satsfed. ) S( N) S... SN where each S s a proper subset of SN ( ).e. S Sj or Sj S f j. ) ( S, ) s ether a neutrosophc LA-semgroup or an LA-semgroup for,,3,..., N. If all the N -LA-semgroups ( S, ) are neutrosophc LA-semgroups (.e. for,,3,..., N ) then we call SN ( ) to be a neutrosophc strong N -LA-semgroup. Defnton 7. Let S( N) { S S... S N,,,..., N } be a neutrosophc N -LA-semgroup. A proper subset P {P P...P,,,..., } of SN ( ) s sad N to be a neutrosophc sub N -LA-semgroup f P P S,,,..., N are sub LA-semgroups of S n whch atleast some of the sub LA-semgroups are neutrosophc sub LA-semgroups. Defnton 8. Let S( N) { S S... S N,,,..., N } be a neutrosophc strong N -LA-semgroup. A proper subset T {T T... T,,,..., } of SN ( ) s N sad to be a neutrosophc strong sub N -LA-semgroup f each ( T, ) s a neutrosophc sub LA-semgroup of ( S, ) for,,..., N where T S T. Defnton 9. Let S( N) { S S... S N,,,..., N } be a neutrosophc N -LA-semgroup. A proper subset P {P P... P N,,,..., N } of SN ( ) s sad to be a neutrosophc N -deal, f the followng condtons are true,. P s a neutrosophc sub N -LA-semgroup of N N
3 Neutrosophc Sets and Systems, Vol. 5, ach P S P,,,..., N s an deal of S. Defnton 0. Let S( N) { S S... S N,,,..., N } be a neutrosophc strong N -LA-semgroup. A proper subset J {J J...J,,,..., } where N Jt J St for t,,..., N s sad to be a neutrosophc strong N -deal of SN ( ) f the followng condtons are satsfed. ) ach t s a neutrosophc sub LA-semgroup of St, t,,..., N.e. It s a neutrosophc strong N- sub LA-semgroup of ) ach t s a two sded deal of S t for t,,..., N. Smlarly one can defne neutrosophc strong N -left deal or neutrosophc strong rght deal of A neutrosophc strong N -deal s one whch s both a neutrosophc strong N -left deal and N -rght deal of Soft Sets Throughout ths subsecton U refers to an ntal unverse, s a set of parameters, PU ( ) s the power set of U, and A, B. Molodtsov defned the soft set n the followng manner: Defnton. A par ( FA, ) s called a soft set over U where F s a mappng gven by F : A P( U ). In other words, a soft set over U s a parameterzed famly of subsets of the unverse U. For a A, F(a) may be consdered as the set of a -elements of the soft set ( FA, ), or as the set of a -approxmate elements of the soft set. xample. Suppose that U s the set of shops. s the set of parameters and each parameter s a word or sentence. Let hgh rent,normal rent,. n good condton,n bad condton Let us consder a soft set ( FA, ) whch descrbes the attractveness of shops that Mr.Z s takng on rent. Suppose that there are fve houses n the unverse N U { s, s, s3, s4, s 5} under consderaton, and that A { a, a, a } be the set of parameters where 3 a stands for the parameter 'hgh rent, a stands for the parameter 'normal rent, a 3 stands for the parameter 'n good condton. Suppose that F( a) { s, s 4}, F( a ) { s, s }, 5 F( a ) { s }. 3 3 The soft set ( FA, ) s an approxmated famly { F( a ),,,3} of subsets of the set U whch gves us a collecton of approxmate descrpton of an object. Then ( FA, ) s a soft set as a collecton of approxmatons over U, where F( a ) hgh rent { s, s }, F( a ) normal rent { s, s }, 5 F( a ) n good condton { s }. 3 3 Defnton. For two soft sets ( FA, ) and ( HB, ) over U, ( FA, ) s called a soft subset of ( HB, ) f. A B and. F( a) H( a ), for all x A. Ths relatonshp s denoted by ( A) ( H, B ). Smlarly ( FA, ) s called a soft superset of ( HB, ) f ( HB, ) s a soft subset of ( FA, ) whch s denoted by ( A) ( H, B ). Defnton 3. Two soft sets ( FA, ) and ( HB, ) over U are called soft equal f ( FA, ) s a soft subset of ( HB, ) and ( HB, ) s a soft subset of ( FA, ). Defnton 4. Let ( FA, ) and ( KB, ) be two soft sets over a common unverse U such that A B. Then ther restrcted ntersecton s denoted by ( A) ( K, B) ( H, C ) where ( HC, ) s defned as H( c) F( c) c) for all c C A B.
4 48 Neutrosophc Sets and Systems, Vol. 5, 04 Defnton 5. The extended ntersecton of two soft sets ( FA, ) and ( KB, ) over a common unverse U s the soft set ( HC, ), where C A B, and for all c C, Hc () s defned as F( c) f c A B, H( c) G( c) f c B A, F( c) G( c) f c A B. We wrte ( A) ( K, B) ( H, C ). Defnton 6. The restrcted unon of two soft sets ( FA, ) and ( KB, ) over a common unverse U s the soft set ( HC, ), where C A B, and for all c C, () H c F c G c for all c C. We wrte t as ( A) ( K, B) ( H, C). Hc s defned as ( ) ( ) ( ) Defnton 7. The extended unon of two soft sets ( FA, ) and ( KB, ) over a common unverse U s the soft set ( HC, ), where C A B, and for all c C, Hc () s defned as F( c) f c A B, H( c) G( c) f c B A, F( c) G( c) f c A B. We wrte ( A) ( K, B) ( H, C ). 3 Soft Neutrosophc B-LA-semgroup Defnton 8. Let BN( S ) be a neutrosophc b-la- semgroup and ( FA, ) be a soft set over Then ( FA, ) s called soft neutrosophc b-la-semgroup f and only f Fa ( ) s a neutrosophc sub b-la-semgroup of BN( S ) for all a A. xample. Let BN( S) { SI S I } be a neutrosophc b-la-semgroup where S I,,3,4, I, I,3 I,4I s a neutrosophc LA-semgroup wth the followng table. * 3 4 I I 3I 4I 4 3 I 4I I 3I 3 4 3I I 4I I I I 3I I I 3I I 4I I I 4I I 3I I 4I I 3I I 3I I 4I I 3I I 4I I 3I 4I I 3I I 4I I 3I I 4I I 3I I 4I I 3I I 4I S I,,3, I, I,3I be another neutrosophc b-la-semgroup wth the followng table. * 3 I I 3I I 3I 3I I 3I 3I I 3I 3I I 3I 3I 3I 3I 3I 3I I 3I 3I 3I 3I 3I 3I 3I I 3I 3I I 3I 3I A { a, a, a } be a set of parameters. Then clearly Let 3 ( FA, ) s a soft neutrosophc b-la-semgroup over BN( S ), where F( a ) {, I} {,3,3 I}, F( a ) {, I} {,3, I,3 I}, F( a ) {4,4 I} { I,3 I}. 3 K be two soft neu- Proposton. Let ( FA, ) and (, D) trosophc b-la-semgroups over Then
5 Neutrosophc Sets and Systems, Vol. 5, Ther extended ntersecton ( A) ( K,D) s soft neutrosophc b-la-semgroup over. Ther restrcted ntersecton ( A) ( K,D) s soft neutrosophc b-la-semgroup over 3. Ther AND operaton ( A) ( K,D) neutrosophc b-la-semgroup over K be two soft neutro- emark. Let ( FA, ) and (, D) sophc b-la-semgroups over Then s soft. Ther extended unon ( A) ( K,D) soft neutrosophc b-la-semgroup over. Ther restrcted unon ( A) ( K,D) soft neutrosophc b-la-semgroup over 3. Ther O operaton ( A) ( K,D) soft neutrosophc b-la-semgroup over One can easly proved (),(), and (3) by the help of examples. Defnton 9. Let ( FA, ) and (K,D) be two soft neutrosophc b-la-semgroups over Then (K,D) s called soft neutrosophc sub b-la-semgroup of ( FA, ), f. D A.. K( a ) s a neutrosophc sub b-la-semgroup of Fa ( ) for all a A. xample 3. Let ( FA, ) be a soft neutrosophc b-la- semgroup over BN( S ) n xample (). Then clearly ( KD, ) s a soft neutrosophc sub b-la-semgroup of ( FA, ) over BN( S ), where K( a ) {, I} {3,3 I}, K( a ) {, I} {, I}. Theorem. Let A be a soft neutrosophc b-lasemgroup over ( ) BN S and j j H, B : j J be a non-empty famly of soft neutrosophc sub b-lasemgroups of A. Then ) H Bj jj s a soft neutrosophc sub b-lasemgroup of A. ) H Bj jj s a soft neutrosophc sub b-lasemgroup of A. 3) H Bj jj s a soft neutrosophc sub b-lasemgroup of A f j k k J. B B for all FA be a soft set over a neutrosoph- FA s called soft Fa s Defnton 0. Let (, ) c b-la-semgroup Then (, ) neutrosophc bdeal over BN( S ) f and only f ( ) a neutrosophc bdeal of BN( S ), for all a A. xample 4. Let BN( S) { SI S I } be a neutrosophc b-la-semgroup, where S I,,3, I, I,3I be another neutrosophc b-la-semgroup wth the followng table. * 3 I I 3I I 3I 3I I 3I 3I I 3I 3I I 3I 3I 3I 3I 3I 3I I 3I 3I 3I 3I 3I 3I 3I I 3I 3I I 3I 3I
6 50 Neutrosophc Sets and Systems, Vol. 5, 04,,3,,,3 be another neutrosophc LA-semgroup wth the followng table. And S I I I I. 3 I I 3I 3 3 3I 3I I I I I 3 I I I I 3I 3I I 3I 3I I I I I I I I I 3I I I I I I I Let A { a, a} be a set of parameters. Then, a soft neutrosophc bdeal over BN( S ), where F a,i,3,3 I {, I}, F a,3, I,3 I {,3, I,3I}. F A s Proposton. very soft neutrosophc bdeal over a neutrosophc b-la-semgroup s trvally a soft neutrosophc b-la-semgroup but the conver true n general. One can easly see the converse by the help of example. Proposton 3. Let A and KD, be two soft neutrosophc bdeals over Then ) Ther restrcted unon F A, ( K, D) a soft neutrosophc bdeal over ) Ther restrcted ntersecton A K, D soft neutrosophc bdeal over 3) Ther extended unon A K, D s a a soft neutrosophc bdeal over 4) Ther extended ntersecton A K, D soft neutrosophc bdeal over s a Proposton 4. Let A and ( KD, ) be two soft neutrosophc bdeals over Then. Ther O operaton A K, D a soft neutrosophc bdeal over. Ther AND operaton A K, D s a soft neutrosophc bdeal over Defnton. Let A and (K,D) be two soft neutrosophc b- LA-semgroups over Then ( KD, ) s called soft neutrosophc bdeal of A, f ) B A, and ) Ka ( ) s a neutrosophc bdeal of ( ) a A. Fa, for all xample 5. Let A be a soft neutrosophc b-lasemgroup over BN( S ) n xample (*). Then ( KD, ) A over BN( S ), s a soft neutrosophc bdeal of where K a I,3 I {, I}, K a,3, I,3 I { I,3I}. Theorem. A soft neutrosophc bdeal of a soft neutrosophc b-la-semgroup over a neutrosophc b- LA_semgroup s trvally a soft neutosophc sub b-lasemgroup but the converse true n general. G B are soft neutro- Proposton 5. If F, A and, sophc bdeals of soft neutrosophc b-la-semgroups A and GB, over neutrosophc b-lasemgroups F ', A ' G ', B ' NS and N T respectvely. Then s a soft neutrosophc bdeal of soft neutrosophc b-la-semgroup A G, B N S N T. over Theorem 3. Let A be a soft neutrosophc b-lasemgroup over ( ) BN S and j j H, B : j J be a non-empty famly of soft neutrosophc bdeals of A. Then
7 Neutrosophc Sets and Systems, Vol. 5, 04 5 s a soft neutrosophcb deal of ) H Bj jj A. ) H Bj s a soft neutrosophc bdeal of j J A. 3) H Bj jj s a soft neutrosophc bdeal of A. 4) H Bj s a soft neutrosophc bdeal of j J A. 4 Soft Neutrosophc Storng B-LA-semgroup Defnton. Let BN( S ) be a neutrosophc b-lasemgroup and ( FA, ) be a soft set over Then ( FA, ) s called soft neutrosophc strong b-lasemgroup f and only f Fa ( ) s a neutrosophc strong sub b-la-semgroup for all a A. xample 6. Let BN( S ) be a neutrosophc b-lasemgroup n xample (). Let A { a, a} parameters. Then (, ) LA-semgroup over BN( S ),where be a set of FA s a soft neutrosophc strong b- F( a ) { I, I,3 I,4 I} { I,3 I}, F( a ) { I, I,3 I,4 I} { I,3 I}. K be two soft neu- Proposton 6. Let ( FA, ) and (, D) trosophc strong b-la-semgroups over Then. Ther extended ntersecton ( A) ( K,D) s soft neutrosophc strong b-la-semgroup over. Ther restrcted ntersecton ( A) ( K,D) s soft neutrosophc strong b-la-semgroup over 3. Ther AND operaton ( A) ( K,D) s soft neutrosophc strong b-la-semgroup over K be two soft neutro- emark. Let ( FA, ) and (, D) sophc strong b-la-semgroups over Then. Ther extended unon ( A) ( K,D) soft neutrosophc strong b-la-semgroup over. Ther restrcted unon ( A) ( K,D) soft neutrosophc strong b-la-semgroup over 3. Ther O operaton ( A) ( K,D) soft neutrosophc strong b-la-semgroup over One can easly proved (),(), and (3) by the help of examples. Defnton 3. Let ( FA, ) and (K,D) be two soft neutrosophc strong b-la-semgroups over Then (K,D) s called soft neutrosophc strong sub b-lasemgroup of ( FA, ), f. B A.. K( a ) s a neutrosophc strong sub b-lasemgroup of Fa ( ) for all a A. Theorem 4. Let A be a soft neutrosophc strong b- LA-semgroup over ( ) BN S and j j H, B : j J be a non-empty famly of soft neutrosophc strong sub b- LA-semgroups of A. Then s a soft neutrosophc strong. H Bj jj sub b-la-semgroup of A. s a soft neutrosophc strong sub. H Bj jj b-la-semgroup of A. s a soft neutrosophc strong 3. H Bj jj
8 5 Neutrosophc Sets and Systems, Vol. 5, 04 sub b-la-semgroup of A f B B for all k j k J. Defnton 4. Let ( FA, ) be a soft set over a neutrosophc b-la-semgroup Then ( FA, ) s called soft neutrosophc strong bdeal over BN( S ) f and only f Fa ( ) s a neutrosophc strong bdeal of BN( S ), for all a A. xample 7. Let BN( S ) be a neutrosophc b-la- A { a, a } be a set of semgroup n xample (*). Let parameters. Then clearly (A) s a soft neutrosophc strong bdeal over BN( S ), where F a I,3 I {I, I,3 I}, F a I,3 I {I,3I}. Theorem 5. very soft neutrosophc strong bdeal over BN( S ) s a soft neutrosophc bdeal but the converse s not true. We can easly see the converse by the help of example. Proposton 7. very soft neutrosophc strong bdeal over a neutrosophc b-la-semgroup s trvally a soft neutrosophc strong b-la-semgroup but the converse s not true n general. Proposton 8. very soft neutrosophc strong bdeal over a neutrosophc b-la-semgroup s trvally a soft neutrosophc b-la-semgroup but the converse true n general. One can easly see the converse by the help of example. Proposton 9. Let A and KD, be two soft neutrosophc strong bdeals over Then. Ther restrcted unon F A, ( K, D) a soft neutrosophc strong bdeal over. Ther restrcted ntersecton A K, D s a soft neutrosophc strong bdeal over 3. Ther extended unon A K, D a soft neutrosophc strong bdeal over 4. Ther extended ntersecton A K, D s a soft neutrosophc strong bdeal over 5. Ther O operaton A K, D a soft neutrosophc bdeal over 6. Ther AND operaton A K, D s a soft neutrosophc bdeal over Defnton 5. Let A and (K,D) be two soft neutrosophc strong b- LA-semgroups over Then ( KD, ) s called soft neutrosophc strong bdeal of A, f. D A, and Ka s a neutrosophc strong bdeal of A.. ( ) Fa ( ), for all a Theorem 6. A soft neutrosophc strong bdeal of a soft neutrosophc strong b-la-semgroup over a neutrosophc b-la_semgroup s trvally a soft neutosophc strong sub b-la-semgroup but the converse true n general. Proposton 0. If F, A and G, B are soft neutrosophc strong bdeals of soft neutrosophc b-lasemgroups A and GB, over neutrosophc b- LA-semgroups F ', A ' G ', B ' NS and N T respectvely. Then s a soft neutrosophc strong bdeal of soft neutrosophc b-la-semgroup A G, B over N S N T. Theorem 7. Let, LA-semgroup over ( ) F A be a soft neutrosophc strong b- BN S and j j H, B : j J be a non-empty famly of soft neutrosophc strong bdeals of A. Then s a soft neutrosophc strong b. H Bj jj
9 Neutrosophc Sets and Systems, Vol. 5, deal of A.. H Bj s a soft neutrosophc strong j J bdeal of A. s a soft neutrosophc strong 3. H Bj jj bdeal of A. 4. H Bj s a soft neutrosophc strong j J bdeal of A. 5 Soft Neutrosophc N-LA-semgroup Defnton 6. Let { SN ( ),,,..., N} be a neutrosophc N-LA-semgroup and ( FA, ) be a soft set over Then ( FA, ) s called soft neutrosophc N-LA-semgroup f and only f Fa ( ) s a neutrosophc sub N-LA- semgroup of SN ( ) for all a A. xample 8. Let S(N) {S SS 3,,, 3} be a neutrosophc 3-LA-semgroup where S,,3,4, I, I,3 I,4I s a neutrosophc LA- semgroup wth the followng table. * 3 4 I I 3I 4I 4 3 I 4I I 3I 3 4 3I I 4I I I I 3I I I 3I I 4I I I 4I I 3I I 4I I 3I I 3I I 4I I 3I I 4I I 3I 4I I 3I I 4I I 3I I 4I I 3I I 4I I 3I I 4I S,,3, I, I,3I be another neutrosophc b-la- semgroup wth the followng table. * 3 I I 3I I 3I 3I I 3I 3I I 3I 3I I 3I 3I 3I 3I 3I 3I I 3I 3I 3I 3I 3I 3I 3I I 3I 3I I 3I 3I And S I I I 3,,3,,,3 s another neutrosophc LA- semgroup wth the followng table.. 3 I I 3I 3 3 3I 3I I I I I 3 I I I I 3I 3I I 3I 3I I I I I I I I I 3I I I I I I I A { a, a, a } be a set of parameters. Then clearly Let 3 ( FA, ) s a soft neutrosophc 3-LA-semgroup over SN ( ), where F( a ) {, I} {,3,3 I} {,I}, F( a ) {, I} {,3, I,3 I} {,3,I,3I}, F( a ) {4,4 I} { I,3 I} {I,3I}. 3 K be two soft neu- SN. Then Proposton. Let ( FA, ) and (, D) trosophc N-LA-semgroups over ( )
10 54 Neutrosophc Sets and Systems, Vol. 5, 04. Ther extended ntersecton ( A) ( K,D) s soft neutrosophc N-LA-semgroup over. Ther restrcted ntersecton ( A) ( K,D) s soft neutrosophc N-LA-semgroup over 3. Ther AND operaton ( A) ( K,D) neutrosophc N-LA-semgroup over K be two soft neutro- SN. Then emark 3. Let ( FA, ) and (, D) sophc N-LA-semgroups over ( ) s soft. Ther extended unon ( A) ( K,D) soft neutrosophc N-LA-semgroup over. Ther restrcted unon ( A) ( K,D) soft neutrosophc N-LA-semgroup over 3. Ther O operaton ( A) ( K,D) soft neutrosophc N-LA-semgroup over One can easly proved (),(), and (3) by the help of examples. Defnton 7. Let ( FA, ) and (K,D) be two soft neutrosophc N-LA-semgroups over Then (K,D) s called soft neutrosophc sub N-LA-semgroup of ( FA, ), f. D A.. K( a ) s a neutrosophc sub N-LA-semgroup of Fa ( ) for all a A. Theorem 8. Let A be a soft neutrosophc N-LAsemgroup over ( ) SN and j j H, B : j J be a non-empty famly of soft neutrosophc sub N-LAsemgroups of A. Then s a soft neutrosophc sub N-. H Bj jj LA-semgroup of A. s a soft neutrosophc sub N-. H Bj jj LA-semgroup of A. s a soft neutrosophc sub N- 3. H Bj jj LA-semgroup of A f j k all k J. B B for FA be a soft set over a neutrosoph- FA s called soft Fa s Defnton 8. Let (, ) c N-LA-semgroup Then (, ) neutrosophc N-deal over SN ( ) f and only f ( ) a neutrosophc N-deal of SN ( ) for all a A. xample 9. Consder xample (***).Let A { a, a} be a set of parameters. Then ( FA, ) s a soft neutrosophc 3- deal over SN ( ), where F( a ) {, I} {3,3 I} {, I}, F( a ) {, I} { I,3 I} {,3,3I}. Proposton. very soft neutrosophc N-deal over a neutrosophc N-LA-semgroup s trvally a soft neutrosophc N-LA-semgroup but the converse true n general. One can easly see the converse by the help of example. Proposton 3. Let A and KD, be two soft neutrosophc N-deals over Then. Ther restrcted unon F A, ( K, D) a soft neutrosophc N-deal over. Ther restrcted ntersecton A K, D s a soft neutrosophc N-deal over 3. Ther extended unon A K, D a soft neutrosophc N-deal over
11 Neutrosophc Sets and Systems, Vol. 5, Ther extended ntersecton A K, D s a soft neutrosophc N-deal over Proposton 5. Let A and ( KD, ) be two soft neutrosophc N-deals over Then. Ther O operaton A K, D s a not soft neutrosophc N-deal over. Ther AND operaton A K, D s a soft neutrosophc N-deal over Defnton 9. Let A and (K,D) be two soft neutrosophc N- LA-semgroups over Then ( KD, ) s called soft neutrosophc N-deal of A, f. B A, and. Ka ( ) s a neutrosophc N-deal of ( ) a A. Fa for all Theorem 8. A soft neutrosophc N-deal of a soft neutrosophc N-LA-semgroup over a neutrosophc N-LAsemgroup s trvally a soft neutosophc sub N-LAsemgroup but the converse true n general. Proposton 6. If F, A and G, B are soft neutrosophc N-deals of soft neutrosophc N-LA-semgroups A and GB, over neutrosophc N-LAsemgroups F ', A ' G ', B ' NS and N T respectvely. Then s a soft neutrosophc N-deal of soft neutrosophc N-LA-semgroup A G, B N S N T. over Theorem 9. Let A be a soft neutrosophc N-LAsemgroup over ( ) SN and j j H, B : j J be a non-empty famly of soft neutrosophc N-deals of A. Then s a soft neutrosophc N-deal. H Bj jj of A.. H Bj s a soft neutrosophc N-deal of j J A. 3. H Bj jj s a soft neutrosophc N-deal of A. 4. H Bj s a soft neutrosophc N-deal of j J A. 6 Soft Neutrosophc Strong N-LA-semgroup Defnton 30. Let { SN ( ),,,..., N} be a neutrosophc N-LA-semgroup and ( FA, ) be a soft set over SN ( ). Then ( FA, ) s called soft neutrosophc strong N-LA-semgroup f and only f Fa ( ) s a neutrosophc strong sub N-LA-semgroup of SN ( ) for all a A. xample 0. Let S(N) {S SS 3,,, 3} be a neutrosophc 3-LA-semgroup n xample 8. Let A { a, a, a } be a set of parameters. Then clearly 3 ( FA, ) s a soft neutrosophc strong 3-LA-semgroup over SN ( ), where F( a ) { I} { I,3 I} {I}, F( a ) { I} { I,3 I} {I,3I}, SN s a neutrosophc strong N-LA- FA s also a soft neutrosophc strong Theorem 0. If ( ) semgroup, then (, ) N-LA-semgroup over K be two soft neu- SN. Then Proposton 7. Let ( FA, ) and (, D) trosophc strong N-LA-semgroups over ( ). Ther extended ntersecton ( A) ( K,D) s soft neutrosophc strong N-LA-semgroup over
12 56 Neutrosophc Sets and Systems, Vol. 5, 04. Ther restrcted ntersecton ( A) ( K,D) s soft neutrosophc strong N-LA-semgroup over 3. Ther AND operaton ( A) ( K,D) neutrosophc strong N-LA-semgroup over K be two soft neutro- SN. Then emark 4. Let ( FA, ) and (, D) sophc strong N-LA-semgroups over ( ) s soft. Ther extended unon ( A) ( K,D) soft neutrosophc strong N-LA-semgroup over. Ther restrcted unon ( A) ( K,D) soft neutrosophc strong N-LA-semgroup over 3. Ther O operaton ( A) ( K,D) soft neutrosophc strong N-LA-semgroup over One can easly proved (),(), and (3) by the help of examples. Defnton 3. Let ( FA, ) and (K,D) be two soft neutrosophc strong N-LA-semgroups over Then (K,D) s called soft neutrosophc strong sub N-LAsemgroup of ( FA, ), f 3. D A. 4. K( a ) s a neutrosophc strong sub N-LAsemgroup of Fa ( ) for all a A. Theorem. Let A be a soft neutrosophc strong N- LA-semgroup over ( ) SN and j j H, B : j J be a non-empty famly of soft neutrosophc strong sub N-LAsemgroups of A. Then s a soft neutrosophc strong. H Bj jj sub N-LA-semgroup of A. s a soft neutrosophc strong sub. H Bj jj N-LA-semgroup of A. s a soft neutrosophc strong sub 3. H Bj jj N-LA-semgroup of A f j k for all k J. B B FA be a soft set over a neutrosoph- FA s called soft SN f and only f SN for all Defnton 3. Let (, ) c N-LA-semgroup Then (, ) neutrosophc strong N-deal over ( ) Fa ( ) s a neutrosophc strong N-deal of ( ) a A. Proposton 8. very soft neutrosophc strong N-deal over a neutrosophc N-LA-semgroup s trvally a soft neutrosophc strong N-LA-semgroup but the converse s not true n general. One can easly see the converse by the help of example. Proposton 9. Let A and KD, be two soft neutrosophc strong N-deals over Then. Ther restrcted unon F A, ( K, D) a soft neutrosophc strong N-deal over. Ther restrcted ntersecton A K, D s a soft neutrosophc N-deal over 3. Ther extended unon A K, D s also a not soft neutrosophc strong N-deal over 4. Ther extended ntersecton A K, D s a soft neutrosophc strong N-deal over 5. Ther O operaton A K, D s a not soft neutrosophc strong N-deal over 6. Ther AND operaton A K, D s a
13 Neutrosophc Sets and Systems, Vol. 5, soft neutrosophc strong N-deal over Defnton 33. Let A and (K,D) be two soft neutrosophc strong N- LA-semgroups over Then ( KD, ) s called soft neutrosophc strong N-deal of A, f. B A, and. Ka ( ) s a neutrosophc strong N-deal of Fa ( ) for all a A. Theorem. A soft neutrosophc strong N-deal of a soft neutrosophc strong N-LA-semgroup over a neutrosophc N-LA_semgroup s trvally a soft neutosophc strong sub N-LA-semgroup but the converse true n general. Theorem 3. A soft neutrosophc strong N-deal of a soft neutrosophc strong N-LA-semgroup over a neutrosophc N-LA_semgroup s trvally a soft neutosophc strong N- deal but the converse true n general. Proposton 0. If F, A and G, B are soft neutrosophc strong N-deals of soft neutrosophc strong N- LA-semgroups A and GB, over neutrosophc N-LA-semgroups F ', A ' G ', B ' NS and N T respectvely. Then s a soft neutrosophc strong N-deal of soft neutrosophc strong N-LA-semgroup A G, B N S N T. over Theorem 4. Let A be a soft neutrosophc strong N-LA-semgroup over ( ) SN and j j H, B : j J be a non-empty famly of soft neutrosophc strong N-deals of A. Then s a soft neutrosophc strong N-. H Bj jj deal of A.. H Bj s a soft neutrosophc strong N- j J deal of A. s a soft neutrosophc strong N- 3. H Bj jj deal of A. 4. H Bj Concluson s a soft neutrosophc strong N- j J deal of A. Ths paper we extend soft neutrosophc bsemgroup, soft neutrosophc N -semgroup to soft neutrosophc b-la-semgroup, and soft neutrosophc N -LAsemgroup. Ther related propertes and results are explaned wth many llustratve examples. The notons related wth strong part of neutrosophy also establshed. eferences ) H. Aktas, N. Cagman, Soft sets and soft groups, Inf. Sc. 77 (007) ) K. Atanassov, Intutonstc fuzzy sets, Fuzzy Sets Syst. 64()(986) ) M. Shabr, M. Al, M. Naz, F. Smarandache, Soft neutrosophc group, Neutrosophc Sets and Systems. (03) 5-. 4) M. Al, F. Smarandache,M. Shabr, M. Naz, Soft neutrosophc Bgroup, and Soft Neutrosophc N-group, Neutrosophc Sets and Systems. (04) ) M. I. Al, F. Feng, X. Lu, W. K. Mn, M. Shabr, On some new operatonsn soft set theory. Comp. Math. Appl., 57(009), ) S. Broum, F. Smarandache, Intutonstc Neutrosophc Soft Set, J. Inf. & Comput. Sc. 8(03) ) D. Chen,.C.C. Tsang, D.S. Yeung, X. Wang, The parameterzaton reducton of soft sets and ts applcatons,comput. Math. Appl. 49(005) ) F. Feng, M. I. Al, M. Shabr, Soft relatons appled to semgroups, Flomat 7(7)(03) ) M.B. Gorzalzany, A method of nference n approxmate reasonng based on nterval-valued fuzzy sets, Fuzzy Sets Syst. (987) -7.
14 58 Neutrosophc Sets and Systems, Vol. 5, 04 0) W. B. V. Kandasamy, F. Smarandache, Basc Neutrosophc Algebrac Structures and ther Applcatons to Fuzzy and Neutrosophc Models, Hexs (004). ) W. B. V. Kandasamy, F. Smarandache, N-Algebrac Structures and S-N-Algebrac Structures, Hexs Phoenx (006). ) W. B. V. Kandasamy, F. Smarandache, Some Neutrosophc Algebrac Structures and Neutrosophc N- Algebrac Structures, Hexs (006). 3) P.K. Maj,. Bswas and A.. oy, Soft set theory, Comput. Math. Appl. 45(003) ) P. K. Maj, Neutrosophc Soft Sets, Ann. Fuzzy Math. Inf. 5()(03) ) D. Molodtsov, Soft set theory frst results, Comput. Math. Appl. 37(999) ) Z. Pawlak, ough sets, Int. J. Inf. Comp. Sc. (98) ) F. Smarandache, A Unfyng Feld n Logcs. Neutrosophy: Neutrosophc Probablty, Set and Logc. ehoboth: Amercan esearch Press (999). 8) F. Smarandache, M. Al, M. Shabr, Soft Neutrosophc Algebrac Structures and Ther Generalzaton. ducaton Publshng, Oho 43, USA (04). 9) L.A. Zadeh, Fuzzy sets, Inf. Cont. 8(965) eceved: July 5, 04. Accepted: August 0, 04.
Neutrosophic Bi-LA-Semigroup and Neutrosophic N-LA- Semigroup
Neutrosophc Sets Systems, Vol. 4, 04 9 Neutrosophc B-LA-Semgroup Neutrosophc N-LA- Semgroup Mumtaz Al *, Florentn Smarache, Muhammad Shabr 3 Munazza Naz 4,3 Department of Mathematcs, Quad--Azam Unversty,
More informationSmooth Neutrosophic Topological Spaces
65 Unversty of New Mexco Smooth Neutrosophc opologcal Spaces M. K. EL Gayyar Physcs and Mathematcal Engneerng Dept., aculty of Engneerng, Port-Sad Unversty, Egypt.- mohamedelgayyar@hotmal.com Abstract.
More informationA New Approach to Multi-spaces Through the Application
Neutrosophc Sets ad Systems Vol 7 015 34 A New Approach to Mult-spaces Through the Applcato Mumtaz Al 1 Floret Smaradache Sad Broum 3 ad Muhammad Shabr 4 14 Departmet of Mathematcs Quad--Azam Uversty Islamabad
More informationSubset Topological Spaces and Kakutani s Theorem
MOD Natural Neutrosophc Subset Topologcal Spaces and Kakutan s Theorem W. B. Vasantha Kandasamy lanthenral K Florentn Smarandache 1 Copyrght 1 by EuropaNova ASBL and the Authors Ths book can be ordered
More informationOn Similarity Measures of Fuzzy Soft Sets
Int J Advance Soft Comput Appl, Vol 3, No, July ISSN 74-853; Copyrght ICSRS Publcaton, www-csrsorg On Smlarty Measures of uzzy Soft Sets PINAKI MAJUMDAR* and SKSAMANTA Department of Mathematcs MUC Women
More informationOn Soft Mixed Neutrosophic N-Algebraic Structures
International J.Math. Combin. Vol.4(2014), 127-138 On Soft Mixed Neutrosophic N-Algebraic Structures F.Smarandache (University of New Mexico, 705 Gurley Ave., Gallup, New Mexico 87301, USA) M.Ali (Department
More informationNeutrosophic Left Almost Semigroup
18 Neutrosophic Left Almost Semigroup Mumtaz Ali 1*, Muhammad Shabir 2, Munazza Naz 3 and Florentin Smarandache 4 1,2 Department of Mathematics, Quaid-i-Azam University, Islamabad, 44000,Pakistan. E-mail:
More informationInterval Valued Neutrosophic Soft Topological Spaces
8 Interval Valued Neutrosoph Soft Topologal njan Mukherjee Mthun Datta Florentn Smarandah Department of Mathemats Trpura Unversty Suryamannagar gartala-7990 Trpura Indamal: anjan00_m@yahooon Department
More informationTHE RING AND ALGEBRA OF INTUITIONISTIC SETS
Hacettepe Journal of Mathematcs and Statstcs Volume 401 2011, 21 26 THE RING AND ALGEBRA OF INTUITIONISTIC SETS Alattn Ural Receved 01:08 :2009 : Accepted 19 :03 :2010 Abstract The am of ths study s to
More informationSome Concepts on Constant Interval Valued Intuitionistic Fuzzy Graphs
IOS Journal of Mathematcs (IOS-JM) e-issn: 78-578, p-issn: 39-765X. Volume, Issue 6 Ver. IV (Nov. - Dec. 05), PP 03-07 www.osrournals.org Some Concepts on Constant Interval Valued Intutonstc Fuzzy Graphs
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationBinomial transforms of the modified k-fibonacci-like sequence
Internatonal Journal of Mathematcs and Computer Scence, 14(2019, no. 1, 47 59 M CS Bnomal transforms of the modfed k-fbonacc-lke sequence Youngwoo Kwon Department of mathematcs Korea Unversty Seoul, Republc
More informationSUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION
talan journal of pure appled mathematcs n. 33 2014 (63 70) 63 SUPER PRINCIPAL FIBER BUNDLE WITH SUPER ACTION M.R. Farhangdoost Department of Mathematcs College of Scences Shraz Unversty Shraz, 71457-44776
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationNeutrosophic Ideals of Γ-Semirings
ISSN: 1304-7981 Number: 6, Year: 014, Pages: 51-61 http://jnrs.gop.edu.tr Receved: 09.06.014 Accepted: 01.07.014 Edtors-n-Chef : Nam Çağman Area Edtor: Oktay Muhtaroglu Neutrosophc Ideals of Γ-Semrngs
More informationINTERVAL SEMIGROUPS. W. B. Vasantha Kandasamy Florentin Smarandache
Interval Semgroups - Cover.pdf:Layout 1 1/20/2011 10:04 AM Page 1 INTERVAL SEMIGROUPS W. B. Vasantha Kandasamy Florentn Smarandache KAPPA & OMEGA Glendale 2011 Ths book can be ordered n a paper bound reprnt
More informationThe binomial transforms of the generalized (s, t )-Jacobsthal matrix sequence
Int. J. Adv. Appl. Math. and Mech. 6(3 (2019 14 20 (ISSN: 2347-2529 Journal homepage: www.jaamm.com IJAAMM Internatonal Journal of Advances n Appled Mathematcs and Mechancs The bnomal transforms of the
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationMatrix-Norm Aggregation Operators
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 39-765X. PP 8-34 www.osrournals.org Matrx-Norm Aggregaton Operators Shna Vad, Sunl Jacob John Department of Mathematcs, Natonal Insttute of
More informationA CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA
A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes
More informationOn the smoothness and the totally strong properties for nearness frames
Int. Sc. Technol. J. Namba Vol 1, Issue 1, 2013 On the smoothness and the totally strong propertes for nearness frames Martn. M. Mugoch Department of Mathematcs, Unversty of Namba 340 Mandume Ndemufayo
More informationLEVEL SET OF INTUITIONTISTIC FUZZY SUBHEMIRINGS OF A HEMIRING
LEVEL SET OF INTUITIONTISTIC FUZZY SUBHEMIRINGS OF HEMIRING N. NITH ssstant Proessor n Mathematcs, Peryar Unversty PG Extn Centre, Dharmapur 636705. Emal : anthaarenu@gmal.com BSTRCT: In ths paper, we
More informationCHAPTER 4 MAX-MIN AVERAGE COMPOSITION METHOD FOR DECISION MAKING USING INTUITIONISTIC FUZZY SETS
56 CHAPER 4 MAX-MIN AVERAGE COMPOSIION MEHOD FOR DECISION MAKING USING INUIIONISIC FUZZY SES 4.1 INRODUCION Intutonstc fuzz max-mn average composton method s proposed to construct the decson makng for
More informationRedesigning Decision Matrix Method with an indeterminacy-based inference process
Redesgnng Decson Matrx Method wth an ndetermnacy-based nference process Jose L. Salmeron a* and Florentn Smarandache b a Pablo de Olavde Unversty at Sevlle (Span) b Unversty of New Mexco, Gallup (USA)
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationComparative Studies of Law of Conservation of Energy. and Law Clusters of Conservation of Generalized Energy
Comparatve Studes of Law of Conservaton of Energy and Law Clusters of Conservaton of Generalzed Energy No.3 of Comparatve Physcs Seres Papers Fu Yuhua (CNOOC Research Insttute, E-mal:fuyh1945@sna.com)
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationSMARANDACHE-GALOIS FIELDS
SMARANDACHE-GALOIS FIELDS W. B. Vasantha Kandasamy Deartment of Mathematcs Indan Insttute of Technology, Madras Chenna - 600 036, Inda. E-mal: vasantak@md3.vsnl.net.n Abstract: In ths aer we study the
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationErrors in Nobel Prize for Physics (7) Improper Schrodinger Equation and Dirac Equation
Errors n Nobel Prze for Physcs (7) Improper Schrodnger Equaton and Drac Equaton u Yuhua (CNOOC Research Insttute, E-mal:fuyh945@sna.com) Abstract: One of the reasons for 933 Nobel Prze for physcs s for
More informationInternational Journal of Mathematical Archive-3(3), 2012, Page: Available online through ISSN
Internatonal Journal of Mathematcal Archve-3(3), 2012, Page: 1136-1140 Avalable onlne through www.ma.nfo ISSN 2229 5046 ARITHMETIC OPERATIONS OF FOCAL ELEMENTS AND THEIR CORRESPONDING BASIC PROBABILITY
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationSpectrum of (, q)-fuzzy Prime h-ideals of a Hemiring
World Appled Scences Journal 17 (12): 1815-1820, 2012 ISSN 1818-4952 IDOSI Publcatons, 2012 Spectrum of (, q)-fuzzy Prme h-deals of a Hemrng 1 M. Shabr and 2 T. Mahmood 1 Department of Mathematcs, Quad--Azam
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationGRA Method of Multiple Attribute Decision Making with Single Valued Neutrosophic Hesitant Fuzzy Set Information
New Trends n Neutrosophc Theory and Applcatons PRANAB BISWAS, SURAPATI PRAMANIK *, BIBHAS C. GIRI 3 Department of Mathematcs, Jadavpur Unversty, Kolkata, 70003, Inda. E-mal: paldam00@gmal.com * Department
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
More informationFuzzy Rings and Anti Fuzzy Rings With Operators
OSR Journal of Mathemats (OSR-JM) e-ssn: 2278-5728, p-ssn: 2319-765X. Volume 11, ssue 4 Ver. V (Jul - ug. 2015), PP 48-54 www.osrjournals.org Fuzzy Rngs and nt Fuzzy Rngs Wth Operators M.Z.lam Department
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationn-strongly Ding Projective, Injective and Flat Modules
Internatonal Mathematcal Forum, Vol. 7, 2012, no. 42, 2093-2098 n-strongly Dng Projectve, Injectve and Flat Modules Janmn Xng College o Mathematc and Physcs Qngdao Unversty o Scence and Technology Qngdao
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationDouble Layered Fuzzy Planar Graph
Global Journal of Pure and Appled Mathematcs. ISSN 0973-768 Volume 3, Number 0 07), pp. 7365-7376 Research Inda Publcatons http://www.rpublcaton.com Double Layered Fuzzy Planar Graph J. Jon Arockaraj Assstant
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSemilattices of Rectangular Bands and Groups of Order Two.
1 Semlattces of Rectangular Bs Groups of Order Two R A R Monzo Abstract We prove that a semgroup S s a semlattce of rectangular bs groups of order two f only f t satsfes the dentty y y, y y, y S 1 Introducton
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationLecture 7: Gluing prevarieties; products
Lecture 7: Glung prevaretes; products 1 The category of algebrac prevaretes Proposton 1. Let (f,ϕ) : (X,O X ) (Y,O Y ) be a morphsm of algebrac prevaretes. If U X and V Y are affne open subvaretes wth
More informationAffine transformations and convexity
Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationNOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules
NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationThe lower and upper bounds on Perron root of nonnegative irreducible matrices
Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College
More informationTaylor Series Approximation to Solve Neutrosophic Multi-objective Programming Problem
Taylor Seres Appromaton to Solve Neutrosophc Mult-objectve Programmng Problem Ecerpt from NETROSOPHC OPERATONA RESEARCH, Volume. Edtors: Prof. Florentn Smarandache, Dr. Mohamed Abdel-Basset, Dr. Yongquan
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationThe Pseudoblocks of Endomorphism Algebras
Internatonal Mathematcal Forum, 4, 009, no. 48, 363-368 The Pseudoblocks of Endomorphsm Algebras Ahmed A. Khammash Department of Mathematcal Scences, Umm Al-Qura Unversty P.O.Box 796, Makkah, Saud Araba
More informationModulo Magic Labeling in Digraphs
Gen. Math. Notes, Vol. 7, No., August, 03, pp. 5- ISSN 9-784; Copyrght ICSRS Publcaton, 03 www.-csrs.org Avalable free onlne at http://www.geman.n Modulo Magc Labelng n Dgraphs L. Shobana and J. Baskar
More informationAntipodal Interval-Valued Fuzzy Graphs
Internatonal Journal of pplcatons of uzzy ets and rtfcal Intellgence IN 4-40), Vol 3 03), 07-30 ntpodal Interval-Valued uzzy Graphs Hossen Rashmanlou and Madhumangal Pal Department of Mathematcs, Islamc
More informationINTERVAL-VALUED INTUITIONISTIC FUZZY CLOSED IDEALS OF BG-ALGEBRA AND THEIR PRODUCTS
ITEVL-VLED ITITIOISTIC FZZY CLOSED IDELS OF G-LGE D THEI PODCTS Tapan Senapat #, onoranjan howmk *, adhumangal Pal #3 # Department of ppled athematcs wth Oceanology Computer Programmng, Vdyasagar nversty,
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationRandić Energy and Randić Estrada Index of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationDIFFERENTIAL SCHEMES
DIFFERENTIAL SCHEMES RAYMOND T. HOOBLER Dedcated to the memory o Jerry Kovacc 1. schemes All rngs contan Q and are commutatve. We x a d erental rng A throughout ths secton. 1.1. The topologcal space. Let
More informationDIFFERENTIAL FORMS BRIAN OSSERMAN
DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationarxiv: v1 [math.co] 1 Mar 2014
Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationOn Tiling for Some Types of Manifolds. and their Folding
Appled Mathematcal Scences, Vol. 3, 009, no. 6, 75-84 On Tlng for Some Types of Manfolds and ther Foldng H. Rafat Mathematcs Department, Faculty of Scence Tanta Unversty, Tanta Egypt hshamrafat005@yahoo.com
More informationThe Quadratic Trigonometric Bézier Curve with Single Shape Parameter
J. Basc. Appl. Sc. Res., (3541-546, 01 01, TextRoad Publcaton ISSN 090-4304 Journal of Basc and Appled Scentfc Research www.textroad.com The Quadratc Trgonometrc Bézer Curve wth Sngle Shape Parameter Uzma
More informationEXPANSIVE MAPPINGS. by W. R. Utz
Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs
More informationINTUITIONISTIC FUZZY GRAPH STRUCTURES
Kragujevac Journal of Mathematcs Volume 41(2) (2017), Pages 219 237. INTUITIONISTIC FUZZY GRAPH STRUCTURES MUHAMMAD AKRAM 1 AND RABIA AKMAL 2 Abstract. In ths paper, we ntroduce the concept of an ntutonstc
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationContinuous Time Markov Chain
Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty
More informationCounterexamples to the Connectivity Conjecture of the Mixed Cells
Dscrete Comput Geom 2:55 52 998 Dscrete & Computatonal Geometry 998 Sprnger-Verlag New York Inc. Counterexamples to the Connectvty Conjecture of the Mxed Cells T. Y. L and X. Wang 2 Department of Mathematcs
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationYong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )
Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often
More informationON SEPARATING SETS OF WORDS IV
ON SEPARATING SETS OF WORDS IV V. FLAŠKA, T. KEPKA AND J. KORTELAINEN Abstract. Further propertes of transtve closures of specal replacement relatons n free monods are studed. 1. Introducton Ths artcle
More informationOn wgrα-continuous Functions in Topological Spaces
Vol.3, Issue.2, March-Aprl. 2013 pp-857-863 ISSN: 2249-6645 On wgrα-contnuous Functons n Topologcal Spaces A.Jayalakshm, 1 C.Janak 2 1 Department of Mathematcs, Sree Narayana Guru College, Combatore, TN,
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationDiscrete Mathematics. Laplacian spectral characterization of some graphs obtained by product operation
Dscrete Mathematcs 31 (01) 1591 1595 Contents lsts avalable at ScVerse ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc Laplacan spectral characterzaton of some graphs obtaned
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More informationThe Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationDISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization
DISCRIMINANTS AND RAMIFIED PRIMES KEITH CONRAD 1. Introducton A prme number p s sad to be ramfed n a number feld K f the prme deal factorzaton (1.1) (p) = po K = p e 1 1 peg g has some e greater than 1.
More informationThe Second Anti-Mathima on Game Theory
The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player
More information