SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION

Size: px
Start display at page:

Download "SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION"

Transcription

1 Palestie Joural of Mathematics Vol. 607, Palestie Polytechic Uiversity-PPU 07 SOME ALGEBRAIC IDENTITIES IN RINGS AND RINGS WITH INVOLUTION Chirag Garg ad R. K. Sharma Commuicated by Ayma Badawi MSC 00 Classicatios: 6W 5, 6N60, 6U80. Keywords ad phrases: Geeralized Jorda θ, ϕ-derivatio, Geeralized Jorda left θ, ϕ -derivatio, Geeralized Jorda θ, ϕ -derivatio. Abstract. I this paper, we study algebraic idetities which are i F x + = F xθx + ϕxdx +F x θx+ϕx Dx ii F x + = F xθx + i= ϕxi Dxθx i iii F x + = θx F x + i= θx i ϕx i Dx, where F ad D are additive mappigs o rig ad rig with ivolutio. Itroductio Throughout this paper R deotes a associative rig with idetity e ad ZR deotes the ceter of R. A additive mappig x x satisfyig x = x ad xy = y x is called a ivolutio. A rig equipped with a ivolutio is called -rig or rig with ivolutio. A rig R is said to be prime if for ay a, b R, arb = {0} implies either a = 0 or b = 0 ad ad is said to be semiprime if for ay a R, ara = 0 implies a = 0. Give a iteger >, a rig R is said to be -torsio free if for ay x R, x = 0 implies x = 0. A additive mappig D from R to R is said to be a derivatio if Dxy = Dxy + xdy for all x, y R ad is said to be a Jorda derivatio if Dx = Dxx + xdx for all x R. We otice that every derivatio is a Jorda derivatio but the coverse eed ot be true. Herstei [9] proved a mile stoe result which states that a Jorda derivatio o a prime rig R with characteristic differet from two is a derivatio. A brief proof ca be foud i Cusack [6]. Cusack [6] geeralized Herstei's result ad proved that if R is a semi prime rig which is -torsio free the every Jorda derivatio o R is a derivatio. We have divided this paper i two sectios. I Sectio, R is ay associative rig where as i Sectio, R is ay associative rig with ivolutio. Bre sar [5] itroduced the cocept of geeralized derivatio mappig. A additive mappig F o R is said to be geeralized derivatio if there exists a derivatio D o R such that F xy = F xy+xdy for all x, y R. A additive mappig F o R is said to be a geeralized Jorda derivatio if there exists a Jorda derivatio D o R such that F x = F xx + xdx for all x R. Vukma [] proved that if R is a -torsio free semi prime rig, the every geeralized Jorda derivatio o R is a geeralized derivatio. A additive mappig D : R R is called θ, ϕ-derivatio resp. Jorda θ, ϕ-derivatio if Dxy = Dxθy + ϕxdy resp. Dx = Dxθx + ϕxdx holds for all x, y R. A additive mappig F : R R is said to be geeralized θ, ϕ-derivatio resp. geeralized Jorda θ, ϕ-derivatio if there exists a θ, ϕ-derivatio resp. Jorda θ, ϕ-deviatio D : R R such that F xy = F xθy + ϕxdy resp. F x = F xθx + ϕxdx for all x, y R. Recetly, Dhara ad Sharma [7] proved a additive map satisfyig a idetity to be derivatio. I 03, Ashraf et al. [3] worked o additive mappigs satisfyig some algebraic idetities. I Sectio, we will prove a additive mappig satisfyig a algebraic idetity to be geeralized Jorda θ, ϕ-derivatio. I Sectio, we will study the results i rigs with ivolutio. Bresar ad Vukma [4] studied the otios of a -derivatio ad a Jorda -derivatio. Let R be a - rig. A addi-

2 ALGEBRAIC IDENTITIES IN RINGS 39 tive mappig D : R R is said to be a -derivatio resp. Jorda -derivatio if Dxy = Dxy + xdy resp. Dx = Dxx + xdx holds for all x, y R. Further, let θ, ϕ be the automorphisms o R. A additive mappig D : R R is said to be θ, ϕ - derivatio if Dxy = Dxθy + ϕxdy ad D is said to be a left θ, ϕ -derivatio if Dxy = θy Dx + ϕxdy holds for all x, y R. A additive mappig F : R R is said to be a geeralized -derivatio associated with -derivatio D if F xy = F xy + xdy holds for all x, y R. Further, let θ, ϕ be automorphisms of R. A additive mappig F : R R is said to be a geeralized θ, ϕ -derivatio resp. geeralized Jorda θ, ϕ -derivatio with associated θ, ϕ -derivatio D resp. Jorda θ, ϕ -derivatio if F xy = F xθy +ϕxdy resp. F x = F xθx +ϕxdx ad F is said to be a left geeralized θ, ϕ -derivatio resp. Jorda left geeralized θ, ϕ - derivatio with associated left θ, ϕ -derivatio D resp. Jorda left θ, ϕ -derivatio if F xy = θy F x+ϕxdy resp. F x = θx F x+ϕxdx holds for all x, y R. Vukma [] proved the followig result: Let R be a 6-torsio free semiprime -rig. Let D : R R be a additive mappig satisfyig the relatio Dxyx = Dxy x +xdyx +xydx for all x, y R. The D is a Jorda -derivatio. Ali [] exteded this result to Jorda triple θ, ϕ -derivatio. Very recetly, N.Rehma et al. [0] cosidered additive mappigs satisfyig some algebraic idetities o rig with ivolutio. I Sectio, we will dee some algebraic idetities o rig with ivolutio. Algebraic Idetity o Rig Dhara ad Sharma [8] proved a additive map satisfyig a idetity to be geeralized Jorda derivatio. Motivated by [8], we dee a idetity o a rig R ad prove the followig: Theorem.. Let be ay xed iteger, R be a +!-torsio free ay rig with idetity elemet ad θ, ϕ be two automorphisms o R. If F : R R ad D : R R are additive mappigs such that F x + = F xθx + ϕxdx + F x θx + ϕx Dx for all x R, the D is a Jorda θ, ϕ-derivatio ad F is a geeralized Jorda θ, ϕ-derivatio. Proof. We have the idetity F x + = F xθx + ϕxdx + F x θx + ϕx Dx. holds for all x R. Replacig x by e i., where e is a idetity of R, we get F e = F e + De which implies De = 0. Sice R is +!-torsio free, we get De = 0. Now replacig x by x + le i 5, where l is ay positive iteger, we get F { x + le +} = F x + leθx + le + ϕx + led {x + le } + F {x + le } θx + le + ϕx + le Dx + le Expadig the powers of x + le ad usig De = 0, we get { } + + F x l x + l x + l + e { } = F x + le θx + + l θx + l θx + l e { } + ϕx + led x + + l x + l x + l e { } + F x + + l x + l x + l e θx + le { } + ϕx + + l ϕx + l ϕx + l e Dx..3

3 40 Chirag Garg ad R. K. Sharma Usig., the above relatio ca be writte as lf θx, ϕx, e + l f θx, ϕx, e +...l f θx, ϕx, e = 0.4 for all x R. Now, replacig l by,,..., i.4 ad cosiderig the resultig system of homogeous equatios, we get that the resultig matrix of the system is a Va der Mode matrix Sice the determiet of the matrix is equal to a product of positive itegers, each of which is less tha ad R is +! torsio free. It follows that the system has oly a zero solutio. Thus f i θx, ϕx, e = 0 for all x R ad i =,,...,. Now, f θx, ϕx, e = 0 implies that + F x = + F eθx + + Dx.5 Agai sice R is +!-torsio free, we get F x = F eθx + Dx for all x R. Now, f θx, ϕx, e = 0 gives + F x = F xθx +! + F xθx + F eθx + ϕxdx +! F x + ϕxdx! Multiplyig both sides by i above equatio, we get Dx!.6 + F x = 4F xθx + 4ϕxDx + F x + F eθx + Dx.7 Usig +! torsio freeess of R ad F x = F eθx+dx, we get Dx = Dxθx+ ϕxdx, x R, hece D is a Jorda θ, ϕ-derivatio i R. Agai usig F x = F eθx+ Dx, we get F x = F eθx + Dxθx + ϕxdx = F xθx + ϕxdx, x R which implies that F is a geeralized Jorda θ, ϕ-derivatio i R. Thus the proof of theorem is completed. 3 Algebraic Idetities o Rig with Ivolutio I 04, N.Rehma et al. [0] cosidered the additive mappigs F : R R ad D : R R satisfyig the coditio F x + = F xx + i= xi Dxx i for all x R ad proved that if R is a +!-torsio free -rig with idetity, the D is a Jorda -derivatio ad F is a geeralized Jorda -derivatio o R. We will exted the results of A. Asari et al. [] to rig with ivolutio as follows: Theorem 3.. Let be ay xed iteger, R be a +!-torsio free ay rig with idetity elemet ad θ, ϕ be two automorphisms o R. If F : R R ad D : R R are additive mappigs such that F x + = F xθx + i= ϕxi Dxθx i for all x R, the D is a Jorda θ, ϕ -derivatio ad F is a geeralized Jorda θ, ϕ -derivatio. Proof. We have the idetity F x + = F xθx + ϕx i Dxθx i 3. i=

4 ALGEBRAIC IDENTITIES IN RINGS 4 for all x R. We replace x by e i 3.. Clearly e = e so that θe = ϕe = e. Hece, by -torsio freeess of R, De = 0 implies De = 0. Agai replacig x by x + le i 3., where l is ay positive iteger, we obtai F x + le + = F x + leθx + le + ϕx + le i Dxθx + le i i= = F x + lf eθx + le + ϕx + le i Dxθx + le i i= 3. for all x R. By expadig the powers of x + le, we get F x x l + = F x + lf e θx + + i= ϕx i + i ϕx i l + i i + θx i l + x l l + e θx l + i θx l l e ϕx i l l i e θx i l l i e Dx θx i 3.3 for all x R. 3.3 ca be rewritte as + + F x + + F x l + x l l + e = F x + lf eθx + F x + lf e θx l + θx l l e i i + ϕx i Dx θx i + θx i l + θx i l i= l i e + i= i + θx i l + i ϕx i l + i i ϕx i l l i e Dx θx i θx i l l i e 3.4

5 4 Chirag Garg ad R. K. Sharma for all x R. Usig 3., we have + + F x l + x l l + e = lf eθx + F x + lf e θx l + i i + ϕx i Dx θx i l + i= θx l l e θx i l l i e i i + ϕx i l + ϕx i l l i e Dx θx i i= i i + θx i l + θx i l l i e for all x R, where we deote k = 0 for k < 0 ad for k >. The above relatio ca be writte as 3.5 lf θx, ϕx, e + l f θx, ϕx, e +...l f θx, ϕx, e = for all x R. We proceed i similar way as i the proof of Theorem., we get f i θx, ϕx, e = 0, i =,,...,. Now, f θx, ϕx, e = 0 implies that + F x = F x + F eθx + Dx implies that Sice R is -torsio free, we obtai + F x = F x + F eθx + Dx 3.8 F x = F eθx + Dx 3.9 Agai f θx, ϕx, e = 0 implies that + F x = F xθx + F eθx + + Dxθx for all x R. 3.0 ca be rewritte as + ϕxdx 3.0 +F x = F xθx + F eθx ++ϕxdx+ Dxθx 3. for all x R. Sice R is -torsio free, we get + F x = F xθx + F eθx + + ϕxdx + Dxθx 3. Usig 3.9 i 3., we d + F x = + F eθx + + ϕxdx + + Dxθx 3.3 for all x R. Sice R is + -torsio free, so we have Replacig x by x i 3.9, we obtai F x = F eθx + ϕxdx + Dxθx 3.4 F x = F eθx + Dx 3.5

6 ALGEBRAIC IDENTITIES IN RINGS 43 Comparig 3.4 ad 3.5, we d that for all x R. Usig 3.6 i 3.5, we get Dx = Dxθx + ϕxdx 3.6 F x = F eθx + Dxθx + ϕxdx = {F eθx + Dx}θx + ϕxdx 3.7 for all x R. Agai, usig 3.9 i 3.7, we coclude F x = F xθx + ϕxdx. Thereby the proof of the theorem is completed. Corollary 3. [0], Theorem.. Let be ay xed iteger ad R be a +!-torsio free ay rig with idetity elemet. If F : R R ad D : R R are additive mappigs such that F x + = F xx + i= xi Dxx i for all x R, the D is a Jorda -derivatio ad F is a geeralized Jorda -derivatio. Proof. Take θ = ϕ = I, where I is the idetity map o R. Theorem 3.3. Let be ay xed iteger, R be a +!-torsio free ay rig with idetity elemet ad θ, ϕ be two automorphisms o R. If F : R R ad D : R R are additive mappigs such that F x + = θx F x + i= θx i ϕx i Dx for all x R, the D is a Jorda left θ, ϕ -derivatio ad F is a geeralized Jorda left θ, ϕ -derivatio. Proof. We have the idetity F x + = θx F x + θx i ϕx i Dx 3.8 for all x R. We replace x by e i 3.. Clearly e = e so that θe = ϕe = e. Hece, by -torsio freeess of R, De = 0 implies De = 0. Agai replacig x by x + le i 3.8, where l is ay positive iteger, we obtai i= F x + le + = θx + le F x + le + θx + le i ϕx + le i Dx i= = θx + le F x + lf e + θx + le i ϕx + le i Dx i= 3.9 for all x R. By expadig the powers of x + le, we get F x + + = + + x l + θx l + i θx + x l l + e + θx i + θx i l + i= i l i e ϕx i + ϕx i l + θx l l e F x + lf e i θx i l i ϕx i l l i e Dx 3.0

7 44 Chirag Garg ad R. K. Sharma for all x R. 3.0 ca be rewritte as + + F x + + F x l + x l l + e = θx F x + lf e + θx l + θx l l e F x + lf e i i + θx i + θx i l + θx i l i= i l i e ϕx i Dx + θx i + i= i i + θx i l l i e ϕx i l l i e Dx θx i l i ϕx i l 3. for all x R. Usig 3.8, we have + + F x l + x l l + e = θx lf e + θx l + θx l l e F x + lf e i i + θx i l + θx i l l i e ϕx i Dx i= i i + θx i + θx i l + i= i l i e ϕx i l + i ϕx i l l i e θx i l Dx 3. for all x R, where we deote k = 0 for k < 0 ad for k >. The above relatio ca be writte as lf θx, ϕx, e + l f θx, ϕx, e +...l f θx, ϕx, e = for all x R. We proceed i the similar way as i the proof of Theorem., we get f i θx, ϕx, e = 0, i =,,...,. Now, f θx, ϕx, e = 0 implies that + F x = F x + θx F e + Dx implies that Sice R is -torsio free, we obtai + F x = F x + θx F e + Dx 3.5 F x = θx F e + Dx 3.6 Agai f θx, ϕx, e = 0 implies that + F x = θx F x + θx F e + + θx Dx + ϕxdx 3.7

8 ALGEBRAIC IDENTITIES IN RINGS 45 for all x R. 3.7 ca be rewritte as +F x = θx F x+ θx F e++ϕxdx+ θx Dx 3.8 for all x R. Sice R is -torsio free, we get + F x = θx F x + θx F e + + ϕxdx + θx Dx 3.9 Usig 3.6, 3.9 becomes + F x = + θx F e + + ϕxdx + + θx Dx 3.30 for all x R. Sice R is + -torsio free, so we have Replacig x by x i 3.6, we obtai Comparig 3.3 ad 3.3, we d that for all x R. Usig 3.33 i 3.3, we get F x = θx F e + ϕxdx + θx Dx 3.3 F x = θx F e + Dx 3.3 Dx = θx Dx + ϕxdx 3.33 F x = θx F e + θx Dx + ϕxdx = θx {θx F e + Dx} + ϕxdx 3.34 for all x R. Agai, usig 3.6 i 3.34, we coclude F x = θx F x + ϕxdx. Thereby the proof of the theorem is completed. Corollary 3.4. Let be ay xed iteger, R be a +!-torsio free ay rig with idetity elemet ad ϕ be a automorphism o R. If F : R R ad D : R R are additive mappigs such that F x + = x F x + i= x i ϕx i Dx for all x R, the D is a Jorda skew left -derivatio ad F is a geeralized Jorda skew left -derivatio. Proof. Take θ = I, where I is the idetity map o R. Refereces [] S. Ali ad A. Foser, O Jorda α, β -derivatios i semiprime -rigs, It. J. Algebra 4, [] A. Asari ad F. Shujat, Additive mappigs satisfyig algebraic coditios i rigs, Red. Circ. Mat. Palermo 63, [3] M. Ashraf, N. Rehma ad A.Z. Asari, O additive mappigs satisfyig a algebraic coditios i rigs with idetity, J. Adv. Pure Math. 5, [4] M. Bre sar ad J. Vukma, O some additive mappigs i rig with ivolutio, Aequatioes Math. 38, [5] M. Bre sar, O the distace of the compositio of two derivatios to the geeralized derivatio, Glasgow Math. 33, [6] J.M. Cusack, Jorda derivatios o rigs, Proc. Amer. Math. Soc., [7] B. Dhara ad R.K. Sharma, O additive mappigs i semi prime rig with left idetity, Algebra Group ad Geom. 5, [8] B. Dhara ad R.K. Sharma, O additive mappigs i rigs with idetity, Iter Math. Forum 5, [9] I.N. Herstei, Jorda derivatios of prime rigs, Proc. Amer. Math. Soc. 8, [0] N. Rehma, A. Asari ad T. Bao, O geeralized Jorda -derivatio i rigs, J. Egy. Math. Soc., [] J. Vukma ad I. Kosi-Ulbl, Equatio related to cetralizers i semiprime rigs, Glasik Matematicki 38,

9 46 Chirag Garg ad R. K. Sharma [] J. Vukma, A ote o Jorda -derivatio i semiprime rigs with ivolutio, It. Math. Forum 3, Author iformatio Chirag Garg ad R. K. Sharma, Departmet of Mathematics, Idia Istitute of Techology Delhi, Hauz Khas, New Delhi-006, INDIA. garg88chirag@gmail.com Received: Jue 9, 05. Accepted: February 6, 06.

Mean cordiality of some snake graphs

Mean cordiality of some snake graphs Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Strong Complementary Acyclic Domination of a Graph

Strong Complementary Acyclic Domination of a Graph Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha

More information

A study on Interior Domination in Graphs

A study on Interior Domination in Graphs IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

INTERSECTION CORDIAL LABELING OF GRAPHS

INTERSECTION CORDIAL LABELING OF GRAPHS INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

4-Prime cordiality of some cycle related graphs

4-Prime cordiality of some cycle related graphs Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 1, Issue 1 (Jue 017), pp. 30 40 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) 4-Prime cordiality of some cycle related

More information

A Note on Chromatic Transversal Weak Domination in Graphs

A Note on Chromatic Transversal Weak Domination in Graphs Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

Combination Labelings Of Graphs

Combination Labelings Of Graphs Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is

More information

On Characteristic Polynomial of Directed Divisor Graphs

On Characteristic Polynomial of Directed Divisor Graphs Iter. J. Fuzzy Mathematical Archive Vol. 4, No., 04, 47-5 ISSN: 30 34 (P), 30 350 (olie) Published o April 04 www.researchmathsci.org Iteratioal Joural of V. Maimozhi a ad V. Kaladevi b a Departmet of

More information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk

More information

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH

A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex

More information

Counting the Number of Minimum Roman Dominating Functions of a Graph

Counting the Number of Minimum Roman Dominating Functions of a Graph Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph

More information

found that now considerable work has been done in this started with some example, which motivates the later results.

found that now considerable work has been done in this started with some example, which motivates the later results. 8 Iteratioal Joural of Comuter Sciece & Emergig Techologies (E-ISSN: 44-64) Volume, Issue 4, December A Study o Adjacecy Matrix for Zero-Divisor Grahs over Fiite Rig of Gaussia Iteger Prajali, Amit Sharma

More information

Integration: Reduction Formulas Any positive integer power of sin x can be integrated by using a reduction formula.

Integration: Reduction Formulas Any positive integer power of sin x can be integrated by using a reduction formula. Itegratio: Reductio Formulas Ay positive iteger power of si x ca be itegrated by usig a reductio formula. Prove that for ay iteger 2, si xdx = 1 si 1 x cos x + 1 si Solutio. Weuseitegratiobyparts. Let

More information

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:

More information

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More information

ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY

ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY ON A PROBLEM OF C. E. SHANNON IN GRAPH THEORY m. rosefeld1 1. Itroductio. We cosider i this paper oly fiite odirected graphs without multiple edges ad we assume that o each vertex of the graph there is

More information

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets

On Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya

More information

A Comparative Study of Positive and Negative Factorials

A Comparative Study of Positive and Negative Factorials A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

Some cycle and path related strongly -graphs

Some cycle and path related strongly -graphs Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i

More information

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a

n n B. How many subsets of C are there of cardinality n. We are selecting elements for such a 4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset

More information

Some non-existence results on Leech trees

Some non-existence results on Leech trees Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Relationship between augmented eccentric connectivity index and some other graph invariants

Relationship between augmented eccentric connectivity index and some other graph invariants Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats

More information

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com) wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed

More information

IJESMR International Journal OF Engineering Sciences & Management Research

IJESMR International Journal OF Engineering Sciences & Management Research [Geetha, (10): October, 015] ISSN 39-6193 Impact Factor (PIF):.3 Iteratioal Joural OF Egieerig Scieces & Maagemet Research CONSTRUCTION OF DIOPHANTINE QUADRUPLES WITH PROPERTY D(A PERFECT SQUARE) V.Geetha

More information

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

More information

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures

University of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

ON MATHIEU-BERG S INEQUALITY

ON MATHIEU-BERG S INEQUALITY ON MATHIEU-BERG S INEQUALITY BICHENG YANG DEPARTMENT OF MATHEMATICS, GUANGDONG EDUCATION COLLEGE, GUANGZHOU, GUANGDONG 533, PEOPLE S REPUBLIC OF CHINA. bcyag@pub.guagzhou.gd.c ABSTRACT. I this paper, by

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Prime Cordial Labeling on Graphs

Prime Cordial Labeling on Graphs World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Mathematical ad Computatioal Scieces Vol:7, No:5, 013 Prime Cordial Labelig o Graphs S. Babitha ad J. Baskar Babujee, Iteratioal Sciece

More information

1.2 Binomial Coefficients and Subsets

1.2 Binomial Coefficients and Subsets 1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =

More information

Convergence results for conditional expectations

Convergence results for conditional expectations Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,

More information

Super Vertex Magic and E-Super Vertex Magic. Total Labelling

Super Vertex Magic and E-Super Vertex Magic. Total Labelling Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a

More information

THE COMPETITION NUMBERS OF JOHNSON GRAPHS

THE COMPETITION NUMBERS OF JOHNSON GRAPHS Discussioes Mathematicae Graph Theory 30 (2010 ) 449 459 THE COMPETITION NUMBERS OF JOHNSON GRAPHS Suh-Ryug Kim, Boram Park Departmet of Mathematics Educatio Seoul Natioal Uiversity, Seoul 151 742, Korea

More information

4-PRIME CORDIAL LABELING OF SOME DEGREE SPLITTING GRAPHS

4-PRIME CORDIAL LABELING OF SOME DEGREE SPLITTING GRAPHS Iteratioal Joural of Maagemet, IT & Egieerig Vol. 8 Issue 7, July 018, ISSN: 49-0558 Impact Factor: 7.119 Joural Homepage: Double-Blid Peer Reviewed Refereed Ope Access Iteratioal Joural - Icluded i the

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics

More information

Mathematical Stat I: solutions of homework 1

Mathematical Stat I: solutions of homework 1 Mathematical Stat I: solutios of homework Name: Studet Id N:. Suppose we tur over cards simultaeously from two well shuffled decks of ordiary playig cards. We say we obtai a exact match o a particular

More information

Planar graphs. Definition. A graph is planar if it can be drawn on the plane in such a way that no two edges cross each other.

Planar graphs. Definition. A graph is planar if it can be drawn on the plane in such a way that no two edges cross each other. Plaar graphs Defiitio. A graph is plaar if it ca be draw o the plae i such a way that o two edges cross each other. Example: Face 1 Face 2 Exercise: Which of the followig graphs are plaar? K, P, C, K,m,

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

Compactness of Fuzzy Sets

Compactness of Fuzzy Sets Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

PRIMITIVE σ-spaces. by Rick E. Ruth

PRIMITIVE σ-spaces. by Rick E. Ruth Volume 8, 1983 Pages 315 328 http://topology.aubur.edu/tp/ PRIMITIVE σ-spaces by Rick E. Ruth Topology Proceedigs Web: http://topology.aubur.edu/tp/ Mail: Topology Proceedigs Departmet of Mathematics &

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

International Journal of Pure and Applied Sciences and Technology

International Journal of Pure and Applied Sciences and Technology It J Pure App Sci Techo 6( (0 pp7-79 Iteratioa Joura of Pure ad Appied Scieces ad Techoogy ISS 9-607 Avaiabe oie at wwwijopaasati Research Paper Reatioship Amog the Compact Subspaces of Rea Lie ad their

More information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information

Some New Results on Prime Graphs

Some New Results on Prime Graphs Ope Joural of Discrete Mathematics, 202, 2, 99-04 http://dxdoiorg/0426/ojdm202209 Published Olie July 202 (http://wwwscirporg/joural/ojdm) Some New Results o Prime Graphs Samir Vaidya, Udaya M Prajapati

More information

ABOUT A CONSTRUCTION PROBLEM

ABOUT A CONSTRUCTION PROBLEM INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Computing Vertex PI, Omega and Sadhana Polynomials of F 12(2n+1) Fullerenes

Computing Vertex PI, Omega and Sadhana Polynomials of F 12(2n+1) Fullerenes Iraia Joural of Mathematical Chemistry, Vol. 1, No. 1, April 010, pp. 105 110 IJMC Computig Vertex PI, Omega ad Sadhaa Polyomials of F 1(+1) Fullerees MODJTABA GHORBANI Departmet of Mathematics, Faculty

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS

EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS Kragujevac Joural of Matheatics Volue 43(3) (019), Pages 47 441. EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS A. LOURDUSAMY 1 AND F. PATRICK 1 Abstract. Let G be a graph with p vertices

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System

Mapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c

More information

UNIT 1 RECURRENCE RELATIONS

UNIT 1 RECURRENCE RELATIONS UNIT RECURRENCE RELATIONS Structure Page No.. Itroductio 7. Objectives 7. Three Recurret Problems 8.3 More Recurreces.4 Defiitios 4.5 Divide ad Coquer 7.6 Summary 9.7 Solutios/Aswers. INTRODUCTION I the

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Australian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN On tvs of Subdivision of Star S n

Australian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN On tvs of Subdivision of Star S n Australia Joural of Basic ad Applied Scieces 5(11): 16-156 011 ISSN 1991-8178 O tvs of Subdivisio of Star S 1 Muhaad Kara Siddiqui ad Deeba Afzal 1 Abdus Sala School of Matheatical Scieces G.C. Uiversity

More information

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

ON A GENERALIZED EULERIAN DISTRIBUTION

ON A GENERALIZED EULERIAN DISTRIBUTION A. Ist. Statist. Math. Vol. 43, No. 1, 197-206 (1991) ON A GENERALIZED EULERIAN DISTRIBUTION CH. A. CHARALAMBIDES Statistical Uit, Uiversity of Athes, Paepisteraiopolis, Athes 157 84, Greece (Received

More information

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions

A Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms

More information

5.3 Recursive definitions and structural induction

5.3 Recursive definitions and structural induction /8/05 5.3 Recursive defiitios ad structural iductio CSE03 Discrete Computatioal Structures Lecture 6 A recursively defied picture Recursive defiitios e sequece of powers of is give by a = for =0,,, Ca

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

MINIMUM COVERING SEIDEL ENERGY OF A GRAPH

MINIMUM COVERING SEIDEL ENERGY OF A GRAPH J. Idoes. Math. Soc. Vol., No. 1 (016, pp. 71 8. MINIMUM COVERING SEIDEL ENERGY OF A GRAPH M. R. Rajesh Kaa 1, R. Jagadeesh, Mohammad Reza Farahai 3 1 Post Graduate Departmet of Mathematics, Maharai s

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

On (K t e)-saturated Graphs

On (K t e)-saturated Graphs Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph

More information

Journal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones

Journal of Mathematical Nanoscience. Sanskruti Index of Bridge Graph and Some Nanocones Joural of Mathematical Naoscieese 7 2) 2017) 85 95 Joural of Mathematical Naosciece Available Olie at: http://jmathaosrttuedu Saskruti Idex of Bridge Graph ad Some Naocoes K Pattabirama * Departmet of

More information

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics

More information

Spatially-Variant Morphological Restoration and Skeleton Representation

Spatially-Variant Morphological Restoration and Skeleton Representation IEEE TRANSACTIONS ON IMAGE PROCESSING 1 Spatially-Variat Morphological Restoratio ad Skeleto Represetatio Nidhal Bouayaya, Studet Member, IEEE, Mohammed Charif-Chefchaoui ad Da Schofeld, Seior Member,

More information

The Exact number of squares and distinct in Fibonacci word using Graph Grammar 1 M.Saravanavadivu, 2 D.Subha

The Exact number of squares and distinct in Fibonacci word using Graph Grammar 1 M.Saravanavadivu, 2 D.Subha America Iteratioal Joural o esearch i ciece, Techology, Egieerig & Mathematics Available olie at http://wwwiasiret IN Prit: 8-9, IN Olie: 8-8, IN C-OM: 8-9 AIJTEM a reereed, idexed, peer-reviewed, multidcipliary

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

Average Connectivity and Average Edge-connectivity in Graphs

Average Connectivity and Average Edge-connectivity in Graphs Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete

More information

3. b. Present a combinatorial argument that for all positive integers n : : 2 n

3. b. Present a combinatorial argument that for all positive integers n : : 2 n . b. Preset a combiatorial argumet that for all positive itegers : : Cosider two distict sets A ad B each of size. Sice they are distict, the cardiality of A B is. The umber of ways of choosig a pair of

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

A Very Simple Approach for 3-D to 2-D Mapping

A Very Simple Approach for 3-D to 2-D Mapping A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics

More information

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree 1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:

More information