THE METRIC DIMENSION OF AMALGAMATION OF CYCLES
|
|
- Derick Bryan
- 5 years ago
- Views:
Transcription
1 Far East Journa of Mathematca Scences (FJMS) Voume 4 Number 00 Pages 9- Ths paper s avaabe onne at 00 Pushpa Pubshng House THE METRIC DIMENSION OF AMALGAMATION OF CYCLES H. ISWADI E. T. BASKORO A. N. M. SALMAN and R. SIMANJUNTAK Combnatora Mathematcs Research Dvson Facuty of Mathematcs and Natura Scence Insttut Teknoog Bandung Jaan Ganesha 0 Bandung 40 Indonesa e-ma: hazru_swad@yahoo.com ebaskoro@math.tb.ac.d msaman@math.tb.ac.d rno@math.tb.ac.d Department of MIPA Gedung TG anta 6 Unverstas Surabaya Jaan Raya Karungkut Surabaya 609 Indonesa 00 Mathematcs Subect Cassfcaton: 05C. Keywords and phrases: resovng set bass metrc dmenson amagamaton. Partay supported by ITB Research Grant 008. Receved March 7 00 Abstract For an ordered set W = { w w... w k } of vertces and a vertex v n a connected graph G the representaton of v wth respect to W s the ordered k-tupe r ( v W ) = ( d( v w ) d( v w )... d ( v wk )) where d ( x y) represents the dstance between the vertces x and y. The set W s caed a resovng set for G f every vertex of G has a dstnct representaton. A resovng set contanng a mnmum number of vertces s caed a bass for G. The dmenson of G denoted by dm( G ) s the number of vertces
2 0 ISWADI BASKORO SALMAN and SIMANJUNTAK n a bass of G. Let { G } be a fnte coecton of graphs and each G has a fxed vertex v o caed a termna. The amagamaton Ama{ G v o } s formed by takng a of the G s and dentfyng ther termnas. In ths paper we determne the metrc dmenson of amagamaton of cyces.. Introducton In ths paper we consder fnte smpe and connected graphs. The vertex and edge sets of a graph G are denoted by V ( G) and E ( G) respectvey. For a further reference pease see Chartrand and Lesnak []. The dstance d ( u v) between two vertces u and v n a connected graph G s the ength of the shortest u v path n G. For an ordered set W = { w w... w k } V ( G) of vertces we refer to the ordered k-tupe r ( v W ) = ( d( v w ) d( v ) w... d ( v w k )) as the (metrc) representaton of v wth respect to W. The set W s caed a resovng set for G f r ( u W ) = r( v W ) mpes u = v for a u v G. A resovng set wth mnmum cardnaty s caed a mnmum resovng set or a bass. The metrc dmenson of a graph G dm( G ) s the number of vertces n a bass for G. To determne whether W s a resovng set for G we ony need to nvestgate the representatons of the vertces n V ( G) \W snce the representaton of each w W has 0 n the th-ordnate; and so t s aways unque. The nta papers dscussng the noton of a (mnmum) resovng set were wrtten by Sater n [5] and [6]. Sater ntroduced the concept of a resovng set for a connected graph G under the term ocaton set. He caed the cardnaty of a mnmum resovng set by the ocaton number of G. Independenty Harary and Meter [7] ntroduced the same concept but used the term metrc dmenson nstead. The probem of fndng a resovng set for a gven graph can be found n many dverse areas ncudng robotc navgaton [] chemstry [] or computer scence []. As descrbed n [] the navgatng agent (a pont robot) moves from node to node n a partcuar graph space. The robot can ocate tsef by the presence of dstnctvey abeed andmark nodes n the graph. Ths suggests the probem: for a gven graph what s the smaest number of andmarks needed and where shoud they be ocated so that the dstances to the andmarks unquey determne the robot s poston n the graph?
3 THE METRIC DIMENSION OF AMALGAMATION OF CYCLES In genera fndng a resovng set for arbtrary graph s a dffcut probem. In [6] t s proved that the probem of computng the metrc dmenson for genera graphs s NP-compete. Thus researchers n ths area often studed the metrc dmenson for partcuar casses of graphs or characterzed graphs havng certan metrc dmenson. Some resuts on the ont graph and cartesan product graph have been obtaned by Caceres et a. [] Khuer et a. [] and Chartrand et a. [4]. Iswad et a. obtaned some resuts on the corona product of graphs [8 9]. Saputro et a. obtaned some resuts on the decomposton product of graphs [9]. Iswad et a. determned the metrc dmenson of antpoda and pendant free graph [0]. Further Saputro et a. found some resuts on the metrc dmenson of some type of reguar graphs [7 8]. Chartrand et a. [4] have characterzed a graphs havng metrc dmensons n and n. They aso determned the metrc dmensons of some we known fames of graphs such as paths cyces compete graphs and trees. Chartrand et a. resuts are wrtten as foows: Theorem A [4]. Let G be a connected graph of order n. () dm ( G ) = f and ony f G =. () dm( G ) = n f and ony f G =. P n () For n 4 dm( G) = n f and ony f G = Kr s ( r s ) G = Kr + K s ( r s ) or G = Kr + ( K Ks ) ( r s ). (v) For n dm( G ) =. n (v) If T s a tree other than a path then dm( T ) = σ( T ) ex( T ) where σ ( T ) denotes the sum of the termna degrees of the maor vertces of T and ex ( T ) denotes the number of the exteror maor vertces of T. The foowng dentfcaton graph G = G[ G G v v] defnton s from [4]. Defnton B. Let G and G be the nontrva connected graphs where v G and v G. An dentfcaton graph G = G[ G G v v] s obtaned from G and G by dentfyng v and v such that v = v n G. K n Posson and Zhang [4] determned the ower and upper bounds of metrc
4 ISWADI BASKORO SALMAN and SIMANJUNTAK dmenson of G [ G G v v] n terms of dm( G ) and dm( G ) as stated n the foowng theorems: Theorem C. Let G and G be the nontrva connected graphs wth v G and v G and et G = G[ G G v v]. Then dm( G ) dm( G ) + dm( G ). For the upper bound we defne an equvaence cass and bnary functon frst. For a set W of vertces of G defne a reaton on V ( G) wth respect to W by urv f there exsts a Z such that r ( v W ) = r( u W ) + ( a a... a). It s easy to check that R s an equvaence reaton on V ( G). Let [ u ] W denote the equvaence cass of u wth respect to W. Then v [] v W f and ony f r ( v W ) = r( u W ) + ( a a... a) for some a Z. For a nontrva connected graph G defne a bnary functon f G : V ( G) Z wth f G dm( G) ( v) = dm( G) f v s not a otherwse. bass vertex of G Theorem D. Let G and G be the nontrva connected graphs wth v G and v G and et G = G[ G G v v]. Suppose that G contans a resovng set W such that [ v ] W = { v}. Then dm( G) W + f ( v ) G = W W + dm( G ) + dm( G ) f v s not otherwse. a bass vertex of G In partcuar f W s a bass for G then dm( G ) + dm( G ) dm( G ) dm( G ) + dm( G ) f v s not otherwse. a bass vertex of G The foowng defnton of amagamaton of graphs s taken from []. Defnton E. Let { G } be a fnte coecton of graphs and each G has a fxed
5 THE METRIC DIMENSION OF AMALGAMATION OF CYCLES vertex v o caed a termna. The amagamaton Ama{ G v o } s formed by takng of a the G s and dentfyng ther termnas. We can consder Defnton E as the dentfcaton process for a of the members n the coecton { G } consecutvey on one dentfcaton vertex. In ths paper we determne the metrc dmenson of amagamaton of cyces.. Resuts We coud consder amagamaton of cyces on n; that s Ama{ G v } where o G = C n for a. In ths partcuar amagamaton the choce of vertex v o s rreevant. So for smpfcaton we can denote ths amagamaton by ( C n ) t where t denotes the number of cyces C n. For t = the graphs ( C n ) are the cyces C n. For n = the graphs ( C ) t are caed the frendshp graphs or the Dutch t- wndms [5]. In ths paper we consder a generazaton of ( C ) where the cyces under consderaton may be of dfferent engths. We denote ths amagamaton by Ama{ Cn } t t. We ca every C n (ncudng the termna) n Ama{ C n } as a eaf and a path P n obtaned from C n by deetng the termna as a nontermna path. Throughout ths paper we w foow the foowng notatons and abes for cyces nontermna path and vertces n Ama{ C n }. For odd n n = k + k and x the termna vertex we abe a vertces n each eaf C n such that C n = xv ths w gve the nontermna path P n = v v w w w x k k k v v v k w k w k n w For even n n = k + k and x the termna vertex we defne the abes of a vertces n each eaf C n as foows: C n = xv t. v v u w w w x k k k
6 4 ISWADI BASKORO SALMAN and SIMANJUNTAK whch eads to the foowng abeng of the nontermna path P n = v v v k u w k w k w The foowng four emmas gve us some propertes of the members of a resovng set of amagamaton of cyces. Lemma. Let S be a resovng set of Ama{ C n }. Then Pn S for each. n Proof. If S has no vertex n P for some then the vertces v n. w n S P w have the same dstances to S namey d( v v) = d( w v) v. S Therefore r( v S) = r( w ) a contradcton. ~ Lemma. Let S be a resovng set of Ama{ C n }. If n s even n 4 and n S = then n S { u }. P P Proof. Suppose u S for some. Snce the remanng vertces of S w not be n P d( v v) = d( w v) v S. Therefore we have r( v S ) = r( w S ) n k k a contradcton wth S beng a resovng set. ~ Lemma. Let S be a resovng set of Ama{ C n }. For any even n n 4 ( P P ) S. n n Proof. Let n = k + n = k + and k k. By Lemma ( P Pn ) S. Suppose ( Pn P ) S =. n By consderng Lemma k k n and the symmetry property we have (( P P ) S ) = { v v } wth r k n n and s k. Then d( w v) = d( w v) v. Therefore r( w S) = S r( w S ) a contradcton; whch gves ( Pn P ) S n. ~ Now we w determne the metrc dmenson of amagamaton of cyces Ama{ C n }. r s
7 THE METRIC DIMENSION OF AMALGAMATION OF CYCLES 5 Theorem. If Ama{ C n } s an amagamaton of t cyces that conssts of t number of odd cyces and t number of even cyces then t dm( Ama{ Cn }) = t + t t = 0 otherwse. Proof. Let B be a bass of Ama{ C n }. We abe the eafs n n such a way that C wth odd engths are abeed by =... t and n even engths are abeed by = t +... t + t =. t C s of Ama{ C } n C n wth Case. For t = 0. Thus a n s t are odd et n = k + k. By usng Lemma for every resovng set S of Ama{ C n } we w have S t. Hence for every bass B of Ama{ C n } B t. Choose a set t S = S = wth k S = { v }. We w show that S s a resovng set of Ama{ C }. The representatons of vertces of Ama{ C n } that s not n S wth respect to S are r ( x S) = ( k... k ) t n r( vr S ) = ( k + r... k r... + r) coord. of S wth r k and r( wr S ) = ( k + r... k r r) wth r k. coord. of S Snce the r s are a dstnct a of these representatons are dstnct. Hence S s a resovng set of amagamaton Ama{ C n }. Snce a bass B s a mnmum resovng set B t. Therefore B = t. Case. For t. Consder an arbtrary resovng set of Ama{ C }. By Lemma every nontermna path P n wth n odd has at east one vertex of S; and by Lemma every nontermna path P n wth n even has at east two vertces of S except for one of them whom can ony contan one vertex of S. These ead to S t + t for every resovng set S; and so B t + t. n
8 6 ISWADI BASKORO SALMAN and SIMANJUNTAK Next we w show that B t + t. Choose a set S = t S wth k S = { v } wth t n = k + and k = and t + + S = { v } wth n k + and k S t + k t + = t + t + = { v u } wth t t n = k and k. + + The representatons of the other vertces of Ama{ C n } wth respect to S are r ( x S) = ( k... k k k k +... k k + ) t t + t + t + t t r( vr S ) = ( k + r... k r... + r k r t coord. of S + + r r + r + ) wth t + and r k s t + t + t + s r( v S) = ( k + s... k + s k + s k k s k s +... coord. of S + s + s + ) wth t + t and s k r( wr S ) = ( k + r... k r r k r t coord. of S + + r r + r + ) wth t + and r k s t + t + t + s r( w S) = ( k + s... k + s k + s k k s k s +... coord. of S + s + s + ) wth t + t and s k
9 THE METRIC DIMENSION OF AMALGAMATION OF CYCLES 7 and t + k t t t t + t + r( w S) = ( k + k +... k + k + k + k + t k t... ) k t k t By drect nspecton a of these representatons are dstnct. Therefore S s a resovng set. Snce a bass B s a mnmum resovng set S B t + t. ~ We ustrate both of Cases and n Fgures and. For Case we consder Ama{ C n } wth = n = n = 5 and n = 5. By choosng a bass B = { v v w } we have the coordnates of a vertces other than the bass vertces as foows: = r ( x B) = ( ) r( w B) = ( ) r( w B) ( ) = r ( v B) = ( ) r( v B) = ( ) r( v B) ( 4 ) = r ( w B) = ( ) r( w B) ( 4 ). For Case we consder Ama{ C n } wth = n = 5 n = 6 and n = 8. By choosng a bass B = { v v v w } we have the coordnates of a vertces other than the bass vertces n Ama{ C n } as beow: Fgure. The coordnates of amagamaton Ama{ C n } wth t = 0 t = t = n = n = 5 and n = 5. = r ( v B) = ( 4) r( w B) = ( 4) r( w B) ( 4 4 5) = r ( x B) = ( ) r( v B) = ( 4) r( u B) ( 5 5 6) = r ( w B) = ( 4) r( w B) = ( 4 4 5) r( v B) ( 4)
10 8 ISWADI BASKORO SALMAN and SIMANJUNTAK = r ( v B) = ( 5 5 ) r( u B) = ( 6 6 ) r( w B) ( ) = r ( w B) ( ). Fgure. The amagamaton Ama{ C n } wth t t = t = n = 5 n = 6 and n = 8. One of the natura questons we coud pose after provng Theorem s: Are there any bass other than the bass we constructed n the proof of Theorem? We w answer the queston by dentfyng a bases of Ama{ C n }. The foowng emmas are needed to fnd such bases: Lemma 4. Let B be a bass of Ama{ C n }. If Pn B = and Pn B = for some then P n { } B = v or { k w } k or { P } n B = v or k { w }. k Proof. By Lemma both B {}. v Assume that Pn = n and n cannot be even. Let n B = {} u and v a P u = wth a k and v = v b wth b k. Then d( w z) = d( w z) z B; a contradcton wth B beng a bass. The resut foows by usng symmetry property. ~ Lemma 5. Let Ama{ C n } be an amagamaton of t cyces that conssts of t number of odd cyces and t number of even cyces and B be a bass of Ama{ C n }. If n s odd and t then P n B = { v } or { w }. k k Proof. Snce n s odd by usng Lemma and Theorem B. Pn =
11 THE METRIC DIMENSION OF AMALGAMATION OF CYCLES 9 Snce t there s at east one eaf C wth even vertces such that B n Pn =. Let n B = {} u and n B = { v}. Assume that P P v a u = wth a k and v = v b wth b k. We have d( w z) = d( w z) z B. By symmetry property the resut foows. ~ Lemma 6. Let B be a bass of Ama{ C n }. If n s even and Pn B = { a b} then nether { a b} { v v... v } nor { a b} { w... }. k w w k Proof. By Theorem there s at east one eaf C n wth n even and such that n B =. Let n B = { u}. For the contrary assume that { a b} P k P k { v v... v } and u { v v... v }. Then d( w z) = d( w ) z B; a z contradcton wth B beng a bass. By usng symmetry property the resut foows. ~ Now we are ready to dentfy a bases of Ama{ C n }. We w consder exacty two cases; frst t = 0 and second t. Theorem. If Ama{ C n } s an amagamaton of t cyces that conssts of t number of odd cyces and t number of even cyces then t t ( ) n t = 0 { } = Ama C = n t t ( nt + ) ( ( ) ( )) C n C k otherwse = t + where C ( b a) s the tota number of combnatons of b obects taken a. Proof. Let t be a number of odd cyces and t be number of even cyces of Ama{ C n }. Case. t = 0. By usng Lemma and Theorem every nontermna path P n w contan ony one bass vertex. By usng Lemma 4 for every par of odd eaves P n and P n one of them say P n contans a bass vertex v or k w. Then for t k = we can dentfy the bass B of Ama{ Cn } B = { a b} where
12 0 ISWADI BASKORO SALMAN and SIMANJUNTAK a { v k w } k and b V ( Pn ) or a V ( Pn ) and b { v k w }. k Hence the number of dfferent bases of Ama{ C n } s ( n ) + ( n ) 4. By usng smar reason we can generaze for t = t > and we have the number of t t dfferent bases of Ama{ C n } s ( n ). = Case. t. By usng Lemma Lemma and Theorem every nontermna path wth even vertces w have one bass vertex and every nontermna path wth odd vertces w have two bass vertces except one ony have one bass vertex. We abe the nontermna path P n s of Ama{ C n } n such a way that P n wth even engths are abeed by =... t P n wth odd engths and contans two bass vertces are abeed by = t +... t + t = t and P n wth odd ength and contans one bass vertex are abeed by = t +. By usng Lemma 5 the bass vertces of nontermna paths wth even vertces havng ether s or w s. A nontermna path P wth odd vertces havng one bass vertex v k k n can have every z V ( P n )\{ u } as ts bass vertex. By usng Lemma 6 every nontermna path P n wth odd vertces havng two bass vertces cannot have both ther bass vertces n ether { v v... v } or { w w... w }. Hence we can count the number of dfferent bases of Ama{ C n } as foows: k t t ( nt + ) ( C( n ) C( k )) = t + where C ( b a) s the tota number of combnatons of b obects taken a. ~ References [] J. Caceres C. Hernando M. Mora M. L. Puertas I. M. Peayo and C. Seara On the metrc dmenson of some fames of graphs Eectronc Notes n Dscrete Math. (005) 9-. [] K. Carson Generazed books and Cm -snakes are prme graphs Ars. Combn. 80 (006) 5-. [] G. Chartrand and L. Lesnak Graphs and Dgraphs rd ed. Chapman and Ha/CRC 000. k
13 THE METRIC DIMENSION OF AMALGAMATION OF CYCLES [4] G. Chartrand L. Eroh M. A. Johnson and O. R. Oeermann Resovabty n graphs and the metrc dmenson of a graph Dscrete App. Math. 05 (000) 99-. [5] J. A. Gaan A dynamc survey of graph abeng Dynamc Survey 9th ed [6] M. R. Garey and D. S. Johnson Computers and Intractabty: A Gude to the Theory of NP-competeness W. H. Freeman Caforna 979. [7] F. Harary and R. A. Meter On the metrc dmenson of a graph Ars. Combn. (976) [8] H. Iswad E. T. Baskoro R. Smanuntak and A. N. M. Saman The metrc dmensons of graphs wth pendant edges J. Combn. Math. Combn. Comput. 65 (008) [9] H. Iswad H. Assyatun E. T. Baskoro and R. Smanuntak On the metrc dmenson of corona product of graphs preprnt. [0] H. Iswad H. Assyatun E. T. Baskoro and R. Smanuntak Metrc dmenson of antpoda and pendant-free bock-cactus graphs preprnt. [] M. A. Johnson Structure-actvty maps for vsuazng the graph varabes arsng n drug desgn J. Bopharm. Statst. (99) 0-6. [] S. Khuer B. Raghavachar and A. Rosenfed Landmarks n graphs Dscrete App. Math. 70 (996) 7-9. [] P. Manue B. Raan I. Raasngh and C. M. Mohan On mnmum metrc dmenson of honeycomb networks Proceedngs of the Sxteenth Austraan Workshop on Combnatora Agorthms Baarat Austraa 005 pp [4] C. Posson and P. Zhang The metrc dmenson of uncycc graphs J. Combn. Math. Combn. Comput. 40 (00) 7-. [5] P. J. Sater Leaves of trees Congr. Numer. 4 (975) [6] P. J. Sater Domnatng and reference sets n graphs J. Math. Phys. Sc. (988) [7] S. W. Saputro E. T. Baskoro A. N. M. Saman D. Supranto and M. Bača The metrc dmenson of ( μ; σ) -reguar graph preprnt. [8] S. W. Saputro E. T. Baskoro A. N. M. Saman D. Supranto and M. Bača The metrc dmenson of reguar bpartte graphs Dscrete Mathematcs and Theoretca Computer Scence submtted. [9] S. W. Saputro H. Assyatun R. Smanuntak S. Uttunggadewa E. T. Baskoro A. N. M. Saman and M. Bača The metrc dmenson of the composton product of graphs preprnt.
L-Edge Chromatic Number Of A Graph
IJISET - Internatona Journa of Innovatve Scence Engneerng & Technoogy Vo. 3 Issue 3 March 06. ISSN 348 7968 L-Edge Chromatc Number Of A Graph Dr.R.B.Gnana Joth Assocate Professor of Mathematcs V.V.Vannaperuma
More informationON AUTOMATIC CONTINUITY OF DERIVATIONS FOR BANACH ALGEBRAS WITH INVOLUTION
European Journa of Mathematcs and Computer Scence Vo. No. 1, 2017 ON AUTOMATC CONTNUTY OF DERVATONS FOR BANACH ALGEBRAS WTH NVOLUTON Mohamed BELAM & Youssef T DL MATC Laboratory Hassan Unversty MORO CCO
More informationLower bounds for the Crossing Number of the Cartesian Product of a Vertex-transitive Graph with a Cycle
Lower bounds for the Crossng Number of the Cartesan Product of a Vertex-transtve Graph wth a Cyce Junho Won MIT-PRIMES December 4, 013 Abstract. The mnmum number of crossngs for a drawngs of a gven graph
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 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 informationCyclic Codes BCH Codes
Cycc Codes BCH Codes Gaos Feds GF m A Gaos fed of m eements can be obtaned usng the symbos 0,, á, and the eements beng 0,, á, á, á 3 m,... so that fed F* s cosed under mutpcaton wth m eements. The operator
More informationAn algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups
Proc. Indan Acad. Sc. (Math. Sc.) Vo. 6, No., November 06, pp. 69 65. DOI 0.007/s0-06-00-7 An agorthmc approach to construct crystazatons of -manfods from presentatons of fundamenta groups BIPLAB BASAK
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
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 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 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 informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
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 informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationGeometric drawings of K n with few crossings
Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva Fernández-Merchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationThe metric dimension of regular bipartite graphs
Bull. Math. Soc. Sci. Math. Roumanie Tome 54(10) No. 1, 011, 15 8 The metric dimension of regular bipartite graphs by M. Bača, E.T. Baskoro, A.N.M. Salman, S.W. Saputro, D. Suprijanto Abstract A set of
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationOn the Power Function of the Likelihood Ratio Test for MANOVA
Journa of Mutvarate Anayss 8, 416 41 (00) do:10.1006/jmva.001.036 On the Power Functon of the Lkehood Rato Test for MANOVA Dua Kumar Bhaumk Unversty of South Aabama and Unversty of Inos at Chcago and Sanat
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More informationMARKOV CHAIN AND HIDDEN MARKOV MODEL
MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More information3. Stress-strain relationships of a composite layer
OM PO I O U P U N I V I Y O F W N ompostes ourse 8-9 Unversty of wente ng. &ech... tress-stran reatonshps of a composte ayer - Laurent Warnet & emo Aerman.. tress-stran reatonshps of a composte ayer Introducton
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 informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationPAijpam.eu SOME NEW SUM PERFECT SQUARE GRAPHS S.G. Sonchhatra 1, G.V. Ghodasara 2
Internatonal Journal of Pure and Appled Mathematcs Volume 113 No. 3 2017, 489-499 ISSN: 1311-8080 (prnted verson); ISSN: 1314-3395 (on-lne verson) url: http://www.jpam.eu do: 10.12732/jpam.v1133.11 PAjpam.eu
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
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 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 informationGraph Reconstruction by Permutations
Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer
More informationCommentationes Mathematicae Universitatis Carolinae
Commentatones Mathematcae Unverstats Carolnae Uzma Ahmad; Syed Husnne Characterzaton of power dgraphs modulo n Commentatones Mathematcae Unverstats Carolnae, Vol. 52 (2011), No. 3, 359--367 Persstent URL:
More informationA finite difference method for heat equation in the unbounded domain
Internatona Conerence on Advanced ectronc Scence and Technoogy (AST 6) A nte derence method or heat equaton n the unbounded doman a Quan Zheng and Xn Zhao Coege o Scence North Chna nversty o Technoogy
More informationMonica Purcaru and Nicoleta Aldea. Abstract
FILOMAT (Nš) 16 (22), 7 17 GENERAL CONFORMAL ALMOST SYMPLECTIC N-LINEAR CONNECTIONS IN THE BUNDLE OF ACCELERATIONS Monca Purcaru and Ncoeta Adea Abstract The am of ths paper 1 s to fnd the transformaton
More informationK-Total Product Cordial Labelling of Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 93-9466 Vol. 7, Issue (December ), pp. 78-76 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) K-Total Product Cordal Labellng o Graphs
More informationand decompose in cycles of length two
Permutaton of Proceedng of the Natona Conference On Undergraduate Reearch (NCUR) 006 Domncan Unverty of Caforna San Rafae, Caforna Apr - 4, 007 that are gven by bnoma and decompoe n cyce of ength two Yeena
More informationCHAPTER 4. Vector Spaces
man 2007/2/16 page 234 CHAPTER 4 Vector Spaces To crtcze mathematcs for ts abstracton s to mss the pont entrel. Abstracton s what makes mathematcs work. Ian Stewart The man am of ths tet s to stud lnear
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationHMMT February 2016 February 20, 2016
HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,
More informationT-structures and torsion pairs in a 2 Calabi-Yau triangulated category 1
T-structures and torson pars n a 2 Caab-Yau tranguated category 1 Yu Zhou and Bn Zhu Department of Mathematca Scences Department of Mathematca Scences Tsnghua Unversty Tsnghua Unversty 100084 Bejng, P.
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 informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017
More informationOn quasiperfect numbers
Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng
More informationLower Bounding Procedures for the Single Allocation Hub Location Problem
Lower Boundng Procedures for the Snge Aocaton Hub Locaton Probem Borzou Rostam 1,2 Chrstoph Buchhem 1,4 Fautät für Mathemat, TU Dortmund, Germany J. Faban Meer 1,3 Uwe Causen 1 Insttute of Transport Logstcs,
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationAmusing Properties of Odd Numbers Derived From Valuated Binary Tree
IOSR Journal of Mathematcs (IOSR-JM) e-iss: 78-578, p-iss: 19-765X. Volume 1, Issue 6 Ver. V (ov. - Dec.016), PP 5-57 www.osrjournals.org Amusng Propertes of Odd umbers Derved From Valuated Bnary Tree
More informationAround Context-Free Grammars - a Normal Form, a Representation Theorem, and a Regular Approximation arxiv: v1 [cs.
Around Context-Free Grammars - a Norma Form, a Representaton Theorem, and a Reguar Approxmaton arxv:1512.09207v1 [cs.fl] 31 Dec 2015 Lana Coocaru Schoo of Informaton Scences, Computer Scence Unversty of
More informationIntersection Matrices Associated With Non Trivial Suborbit Corresponding To The Action Of Rank 3 Groups On The Set Of Unordered Pairs
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUE 3, ISSUE, DECEBER 4 ISSN 77-866 Intersecton atrces Assocated Wth Non Trva Suborbt Correspondng To The Acton Of Rank 3 Groups On The Set Of
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationRadio Geometric Mean Number of Splitting Of Star and Bistar
Rado Geometrc Mean Number of Splttng Of Star and Bstar V. Hemalatha 1 Dr. V. Mohanasel 2 and Dr. K. Amuthaall 3 1 Department of Mathematcs Vekanandha College of Technology for Women Truchengode Namakkal.
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
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 informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
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 informationZ 4p - Magic labeling for some special graphs
Internatonal Journal of Mathematcs and Soft Computng Vol., No. (0, 6-70. ISSN Prnt : 49-8 Z 4p - Magc labelng for some specal graphs ISSN Onlne: 9-55 V.L. Stella Arputha Mary Department of Mathematcs,
More informationn ). This is tight for all admissible values of t, k and n. k t + + n t
MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what
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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationSPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION
SPECTRAL PROPERTIES OF IMAGE MEASURES UNDER THE INFINITE CONFLICT INTERACTION SERGIO ALBEVERIO 1,2,3,4, VOLODYMYR KOSHMANENKO 5, MYKOLA PRATSIOVYTYI 6, GRYGORIY TORBIN 7 Abstract. We ntroduce the conflct
More informationBeyond Zudilin s Conjectured q-analog of Schmidt s problem
Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
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 informationAnalysis of Bipartite Graph Codes on the Binary Erasure Channel
Anayss of Bpartte Graph Codes on the Bnary Erasure Channe Arya Mazumdar Department of ECE Unversty of Maryand, Coege Par ema: arya@umdedu Abstract We derve densty evouton equatons for codes on bpartte
More informationarxiv: v1 [math.co] 7 Apr 2015
Ranbow connecton n some dgraphs Jesús Alva-Samos 1 Juan José Montellano-Ballesteros Abstract arxv:1504.0171v1 [math.co] 7 Apr 015 An edge-coloured graph G s ranbow connected f any two vertces are connected
More informationProblem Set 6: Trees Spring 2018
Problem Set 6: Trees 1-29 Sprng 2018 A Average dstance Gven a tree, calculate the average dstance between two vertces n the tree. For example, the average dstance between two vertces n the followng tree
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 information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationCCO Commun. Comb. Optim.
Communcatons n Combnatorcs and Optmzaton Vol. 2 No. 2, 2017 pp.87-98 DOI: 10.22049/CCO.2017.13630 CCO Commun. Comb. Optm. Reformulated F-ndex of graph operatons Hamdeh Aram 1 and Nasrn Dehgard 2 1 Department
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationFor all questions, answer choice E) NOTA" means none of the above answers is correct.
0 MA Natonal Conventon For all questons, answer choce " means none of the above answers s correct.. In calculus, one learns of functon representatons that are nfnte seres called power 3 4 5 seres. For
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationQuantum Runge-Lenz Vector and the Hydrogen Atom, the hidden SO(4) symmetry
Quantum Runge-Lenz ector and the Hydrogen Atom, the hdden SO(4) symmetry Pasca Szrftgser and Edgardo S. Cheb-Terrab () Laboratore PhLAM, UMR CNRS 85, Unversté Le, F-59655, France () Mapesoft Let's consder
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 informationBayesian epistemology II: Arguments for Probabilism
Bayesan epstemology II: Arguments for Probablsm Rchard Pettgrew May 9, 2012 1 The model Represent an agent s credal state at a gven tme t by a credence functon c t : F [0, 1]. where F s the algebra of
More informationLECTURE 21 Mohr s Method for Calculation of General Displacements. 1 The Reciprocal Theorem
V. DEMENKO MECHANICS OF MATERIALS 05 LECTURE Mohr s Method for Cacuaton of Genera Dspacements The Recproca Theorem The recproca theorem s one of the genera theorems of strength of materas. It foows drect
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
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 informationMultispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory
Proceedngs of the 2009 IEEE Internatona Conference on Systems Man and Cybernetcs San Antono TX USA - October 2009 Mutspectra Remote Sensng Image Cassfcaton Agorthm Based on Rough Set Theory Yng Wang Xaoyun
More informationAffine and Riemannian Connections
Affne and Remannan Connectons Semnar Remannan Geometry Summer Term 2015 Prof Dr Anna Wenhard and Dr Gye-Seon Lee Jakob Ullmann Notaton: X(M) space of smooth vector felds on M D(M) space of smooth functons
More informationNote 2. Ling fong Li. 1 Klein Gordon Equation Probablity interpretation Solutions to Klein-Gordon Equation... 2
Note 2 Lng fong L Contents Ken Gordon Equaton. Probabty nterpretaton......................................2 Soutons to Ken-Gordon Equaton............................... 2 2 Drac Equaton 3 2. Probabty nterpretaton.....................................
More informationGeneral Results of Local Metric Dimensions of. Edge-Corona of Graphs
Internatonal Matheatcal Foru, Vol 11, 016, no 16, 793-799 HIKARI Ltd, www-hkarco htt://dxdoorg/101988/f0166710 General Results of Local Metrc Densons of Edge-Corona of Grahs Rnurwat Deartent of Matheatcs,
More informationAssociative Memories
Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationResearch on Complex Networks Control Based on Fuzzy Integral Sliding Theory
Advanced Scence and Technoogy Letters Vo.83 (ISA 205), pp.60-65 http://dx.do.org/0.4257/ast.205.83.2 Research on Compex etworks Contro Based on Fuzzy Integra Sdng Theory Dongsheng Yang, Bngqng L, 2, He
More informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationValuated Binary Tree: A New Approach in Study of Integers
Internatonal Journal of Scentfc Innovatve Mathematcal Research (IJSIMR) Volume 4, Issue 3, March 6, PP 63-67 ISS 347-37X (Prnt) & ISS 347-34 (Onlne) wwwarcournalsorg Valuated Bnary Tree: A ew Approach
More informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
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 informationOn Graphs with Same Distance Distribution
Appled Mathematcs, 07, 8, 799-807 http://wwwscrporg/journal/am ISSN Onlne: 5-7393 ISSN Prnt: 5-7385 On Graphs wth Same Dstance Dstrbuton Xulang Qu, Xaofeng Guo,3 Chengy Unversty College, Jme Unversty,
More informationThe Jacobsthal and Jacobsthal-Lucas Numbers via Square Roots of Matrices
Internatonal Mathematcal Forum, Vol 11, 2016, no 11, 513-520 HIKARI Ltd, wwwm-hkarcom http://dxdoorg/1012988/mf20166442 The Jacobsthal and Jacobsthal-Lucas Numbers va Square Roots of Matrces Saadet Arslan
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More information