UPPER AND LOWER BOUNDS OF THE BASIS NUMBER OF KRONECKER PRODUCT OF A WHEEL WITH A PATH AND A CYCLE
|
|
- Beverly Walters
- 5 years ago
- Views:
Transcription
1 J.Edu. Sci, Vol. (9) No.(2) 2007 UPPER AND LOWER BOUNDS OF THE BASIS NUMBER OF KRONECKER PRODUCT OF A WHEEL WITH A PATH AND A CYCLE Ghassa T. Marougi Ayha A. Khalil Dept. Math./College of Computers & Mathematics Scieces/ Mosul Uiversity Received 27/7/2006 Accepted 3/0/2006 الملخص يعرف العدد الا ساس b(g) لبيان G عل ى ان ه اص غر ع دد ص حيح موج ب k بحي ث ان لG قاعدة ذات ثني ة k لف ضاء دارات ه. ف ي ه ذا البح ث س وف ن درس القي د الاعل ى والاص غرللعدد الا ساس لجداء Kroecker للعجلة مع الدرب والدارة حيث توصلنا إلى النتاي ج الا تية: 3 b( P ) 4, m 4 ad 3, 3 b ( C ) 5, m 4, 3. ABSTRACT The basis umber, b(g),of a graph G is defied to be the smallest positive iteger k such that G has a k-fold basis for its cycle space. We ivestigate upper ad lower bouds of the basis umber of Kroecker product of a wheel with a path ad a cycle. It is proved that 3 b( ) 4, m 4 ad 3, ad 3 b ( C ) 5, m 4, 3. 64
2 UPPER AND LOWER BOUNDS OF THE BASIS. INTRODUCTION. Throughout this paper, we cosider oly fiite, udirected ad simple graphs. Our termiology ad otatios will be stadard except as idicated. For udefied terms, see [3]. Let G be a coected graph, ad let e, e 2,, e q be a orderig of the edges. The ay subset S of edges correspods to a (0,)-vector (a, a 2,.., a q ) i the usual way, with a i = if e i S ad a i =0 otherwise, for i=,2,..q. These vectors form a q-dimesioal vector space, deoted by (Z 2 ) q over the field Z 2. The vectors i (Z 2 ) q which correspod to the cycles i G geerate a subspace called the cycle space of G, ad deoted by ξ(g). It is well kow that dim ξ(g)= γ (G)=q-p+k, where p is the umber of vertices, k is the umber of coected compoets ad γ(g) is the cyclomatic umber of G. A basis for ξ(g) is called h-fold if each edge of G occurs i at most h of the cycles i the basis. The basis umber of G, deoted by b(g), is the smallest positive iteger h such that ξ(g) has a h-fold basis, ad such a basis is called a required basis of G ad deoted by B r (G). If B is a basis for ξ(g) ad e is a edge of G, the the fold of e i B, deoted by f B (e) is defied to be the umber of cycles i B cotaiig e. Defiitio: Let G=(V,E) be a simple graph with order ad vertex set V={p,p 2,..., p }. the adacecy matrix of G, deoted by A(G) is the matrix defied by : A(G)=[a i ] where a i = 0,if the edge p i, p i E,, otherwise a i is called the adacecy umber of the pair (v i, v ) of vertices. Defiitio: Let the vertex sets of the graphs G ad H be {p i i=,2,,m} ad {q =,2,,} resp.,the the Kroecker product [8], G H,is the graph with vertex set {(p i, q ): for i=,2,,m ad =,2,,} such that the adacecy umber of the pair (p i, q ), (p k, q l ) is the product of the adacecy umbers of (p i,p k )i G ad (q,q l ) i H. G H is also called direct product(teser product) of G ad H,ad may be deoted by G.H []. G H is also defied as V( G H )=V(G )xv( H ) E( G H )={(p i, q ) (p k, q l ) p i p k E(G) ad q q l E(H)}. The Kroecker product is commutative (up to isomorphism) ad associative [7]. 65
3 Ghassa T. Marougi & Ayha A. Khalil The first importat result of the basis umber occured i 937 whe MacLae [5] proved that a graph G is plaar if ad oly if b(g) 2. I 98, Schmeichel [6] proved that for 5,b(K )=3, ad for m, 5, b(k m, )=4 except for K 6,0, K 5, ad K 6, i which =5,6,7 ad 8. Moreover, i 982, Baks ad Schmeichel [2] proved that for 7, b(q )=4, where Q is the -cube. The purpose of this paper is to determie upper ad lower bouds of the basis umber of Kroecker product of a wheel with a path ad a cycle. 2.. O the Basis Number Of Wm. I this sectio, we obtai upper ad lower bouds for the basis umber of kroecker product of a wheel with a path.let the vertex sets of C m ad P be Z m ad Z respectively, where Z deotes the additive group of residues modulo. Let the cycle C m be 0,,2,,m-,0. The followig lemma is eeded i the proof of the followig theorem which is due to Weichsel [8]. Lemma:If G ad H are coected graphs the the Kroecker product G H is coected if ad oly if either G or H cotais a odd cycle. Let be the oi of a cycle 0 2 L( m 2) 0 with the vertex α ad let P = 0 2L ( ).( See Fig.) α (m-2) Fig P Theorem 2. For m 4 ad 3, 3 b ( ) 4. Proof: Oe ca easily observe from Fig.2, that P3 cotais a subgraph H homeomorphic to K 3,3. Thus by Kuratowskis theorem [3], P 3 is o plaar, sice P3 is a subgraph of Wm for 3 ; the by MacLaes theorem [5], b ( P ) 3. 66
4 UPPER AND LOWER BOUNDS OF THE BASIS α (m-3)0 (m-2)0 α 0 (m-3) α 0 (m-3) (m-2) 00 (m-2) α (m-3)2 (m-2)2 α2 (m-2)2 (m-2)0 P 3 H Fig.2: P3 To complete the proof we fid a 4-fold basis ) for ξ ( Wm We have two cases: Case (): m is eve. Let B = Cm ) N P M,. where C m ) is the basis for ξ ( Cm ) discussed i Theorem 2.2.[4] i which m- is odd, that is, Cm ) = { i,( i )( + ), i( + 2),( i + )( + ), i : i Z m ad = 0,,..., 3} { S}, where S = 00,,20,3,..., ( m 2)0,0,0,2,30,..., ( m 2),00, N = { i,( i + )( + ), α, i( + ),( i + ), + ), i : i = 0,,2,..., m 3 ad = 0,,2,..., 2}, P = {( m 2),0( + ), α,( m 2)( + ),0, + ),( m 2) : = 0,,..., 3} ad M = { α, i( + ), ( i + ), ( i + 2)( + ), α ad + ), i, ( i + )( + ), ( i + 2), + ): i = 0,2,4,..., m 4 ad = 0,,..., 2}. It is clear that B = ( m )( 2) + + ( m 2)( ) + ( 2) + ( m 2)( ) = 3m 4m = γ ( P We shall prove that B is idepedet. First, the cycles of N P ad M are idepedet for each = 0,,..., 2 sice ay liear combiatio of cycles i N P or M for some i = 0,,..., m 2 cotais edges of the form, i,( i + )( + ) or i( + ),( i + ). That is, ay liear combiatio of cycles i N P ad M is ot equal to zero modulo (2). Moreover, for all = 0,,..., 2, every cycle of N P cotais a edge of the form α, i( + ) or + ), i for some 67
5 Ghassa T. Marougi & Ayha A. Khalil i =,3,5,..., m 2 which is ot preset i ay cycle of M. Also the cycles i N P M satisfy N P M ) ( N P M ) = Φ for all k where ( k k k N is defied as follows: It is clear that the vertex set of Wm ca be partitioed ito V 0, V,..., V, where V = {( i, ) : i = α,0,,2,..., m 2}. Notice that V ( Wm ) = { α,0,,2,..., m 2}. Now, N is the cycle of N that oi a vertex of V to a vertex of V +, for each = 0,,..., 2. By a similar method, we defie P ad M. Moreover, for every ocosective itegers ad k i {0,,,-2}, every cycle i N P M is edge-disoit with every cycle i N k Pk M k. Furthermore, if C i is ay cycle i N P M, = 0,,..., 3 the C i cotais the edge i,( i + )( + ) which is ot cotaied i ay cycle i N + P+ M +. This shows that N P M is idepedet. Moreover, the cycles of N P M for all = 0,,..., 2 are idepedet from the cycle of C m ) because if C is i ay cycle geerated from cycles i N P M, the C cotais i a edge of the form α, i( + ) or + ), i for some i = 0,,..., m 2 which is ot preset i ay cycle of C m ). Thus ) is idepedet set of cycles ad so it is a basis for ξ ( Wm We ow cosider the fold of ). Partitio, the edge set of Wm P ito i,( i + )( + ) or i( + ),( i + ) ad α, i( + ) or + ), i i which i Z m ad = 0,,..., 2. Thus if e is ay edge i Wm of the form i,( i + )( + ) or i( + ),( i + ), the 2,, C m P ) N P M ad so 4. P ) While, if e is ay edge i Wm of the form α, i( + ) or + ), i,the = 0, C m P ad so ) N P 2, 2 M 68
6 UPPER AND LOWER BOUNDS OF THE BASIS f ( e) 4. P ) Therefore, ) is a 4-fold basis. Case (2): m is odd. Let Wm ) = B ( Cm ) M N. Where B ( C m P ) is a basis for ξ ( Cm ) discussed i[,theorem, case(2)] amely, B ( C P ) = { i, ( i + )( ),( i + 2), ( i + )( + ), i m : i Z m, =,2,..., 2 ad ( i) is { i, ( i + )( ),( i + 2), ( i + )( + ), i : i Z m, =,2,..., 2 ad ( i) is eve} odd}, M = { α, i( + ), ( i + ), ( i + 2)( + ), α ad + ), i, ( i + )( + ), ( i + 2), + ) : i = 0,2,4,... m 3 mod( m ) ad = 0,,2,..., 2} ad N is same as Case (). It is clear that Wm ) = ( m )( 2) + ( m )( ) + ( m 2)( ) = m 2m m m + + m m = 3m 4m = γ ( Wm As i the proof of Case (), we ca show that ) is idepedet set of cycles ad so it is a basis for ξ ( Wm ) of fold 4,that is B = P Note that if m is eve ad m 4,the P2 is plaar graph,(see Fig.3). 69
7 Ghassa T. Marougi & Ayha A. Khalil (m-2) α0 3 α (m-2)0 (m-3) Fig.3 Hece b( Wm P2 ) = 2 for eve m 4. While, if m is odd ad m 5, the P2 cotais a subgraph K homeomorphic to K 3, 3. Therefore by MacLaes theorem [5],the graph is oplaar (see Fig.4). P 2 70
8 UPPER AND LOWER BOUNDS OF THE BASIS α (m-4)0 (m-3)0 (m-2)0 α 0 2 (m-4) (m-3) (m-2) K α0 0 (m-2) (m-4)0 α 0 (m-3) Fig.4: P2 Hece b( Wm P2 ) = 3 for eve m 5. We coclude the followig table m b P ) ( m 4, m is eve 2 2 m 4, m is eve 3 3 or 4 m 5, mis odd 2 3 m 5, mis odd 3 3 or 4 7
9 Ghassa T. Marougi & Ayha A. Khalil 2.2. O the Basis Number Of Wm. I this sectio, we obtai upper ad lower bouds for the basis umber of kroecker product of a wheel with a cycle. Theorem 3. For m 4, 3, we have 3 b ( ) 5. Proof: Sice Wm is a subgraph of Wm for all m 4,ad 3, the by Theorem 2, we have Wm is oplaar ad so by MacLaes theorem [5], we have b ( C ) 3.For m=4 ad =3,( see Fig.5). α α 0 2 α Fig.5: W4 P3 To complete the theorem we establish a 5-fold basis ) for ξ ( Wm We have two possibilities for m. () m is eve. The cosider the followig set of cycles i Wm : Wm ) = Cm ) N M. Where C m ) is a basis for ξ ( Cm ) discussed i Theorem 2.3.[4], where m- is odd, that is, Cm ) = Cm ) B { S, S 2}, where Cm ) = { i,( i )( + ), i( + 2),( i + )( + ) : i Z m ad = 0,,..., 3} { S}, S = 00,,20,3,...,( m 2)0,0,0,2,30,...,( m 2),00 B = { i, ( i )( + ), i( + 2), ( i + )( + ), i : i = 0,,..., m 3 mod( m ) ad = 2, (mod )}, S = ( m 2)( 2),( m 3)( ),( m 2)0, 0( ),( m 2)( 2) S = 00,( m 2)( ),( m 3)0,( m 4)( ),...,0,0( ),( m 2)0,( m 3)( ),...,20,( N = { i,( i + )( + ), α, i( + ),( i + ), + ), i : i Z m ad Z }. ad 2 ),00. 72
10 UPPER AND LOWER BOUNDS OF THE BASIS M = { α, i( + ),( i + ),( i + 2)( + ), α ad + ), i,( i + )( + ),( i + 2), + ) : i = 0,2,4,..., m 4 ad It is clear that W m Z }. ) = m + + ( m ) + ( m 2) = 3m 4 + = γ ( W C ) m We will prove that B C ) is idepedet. It is clear that 2 ( N = ( N P ) { N } ad = ( M ) { M } = 0 2 M, where N P M for = 0 = 0,,..., 2 are as metioed i the proof of Theorem 2. As i the proof of Theorem 2, N M is idepedet. Moreover for all i Z m, N M cotais the edge i ( ),( i + ) 0, which is ot cotaied i 2 ( = 0 N P M Thus N M is idepedet set of cycles. Furthermore N M is idepedet from the cycles of C m C ) sice for all Z, if Ci is ay cycle geerated from cycles of N M, the C i cotais the edge of the from α, i( + ) or + ), i for some i Z m which is ot preset i ay cycle of C m Thus Wm ) = Cm ) N M, is idepedet ad so it is a basis. We ow cosider the fold of Partitio the edge-set of Wm C ito i,( i + )( + ) or i( + ),( i + ) ad α, i( + ) or + ), i for i Z m ad Z. Therefore if e is ay edge i Wm of the form i,( i + )( + ) or i( + ),( i + ), the 3,, C m C ) N M ad so 5. C ) While if e is ay edge of the form α, i( + ) or + ), i the = 0, 2, 2 C m C ) N M ad so 4. C ) Thus, the basis B C ) is of fold 5. ( 73
11 Ghassa T. Marougi & Ayha A. Khalil (2) m is odd, the cosider the followig set of cycles i Wm : Wm ) = B ( C P ) { F, F m i i : i Z m } N M, where B ( C m P ) is a basis for ξ ( Cm ) metioed i [, Theorem, case (2)] ad F i, F i are idepedet cycles [, Theorem 2, case ()]. That is, B ( C m P ) = { i, ( i + )( ), ( i + 2), ( i + )( + ), i : i Z ad ( i) eve } { i, ( i + )( ), ( i + 2), ( i + )( + ), i : F m i Z =,2,..., 2 ad ( i) odd } {00,,20,3,..., ( m 3)0, ( m 2),00}, i = {0i,( i ),2i,...,( m 2)( i ),0 i}, F = {0i,( i + ),2i,...,( m 2)( i + ),0 i}, N i ad M, =,2,..., 2 m { i,( i + )( + ), α, i( + ),( i + ), + ), i : i = 0,,..., m ad } = 3 = { α, i( + ),( i + ), ( i + 2)( + ), α ad + ), i, ( i + )( + ),( i + 2), + ) : i = 0,2,4,... m 3 mod( m ) ad Z }. is clear that W C ) = ( m )( 2) + + 2( m ) + ( m 2) + ( m ) m = m 2m m 2 + m 2 + m = 3m 4 + = γ ( Wm ). As i possibility (), we ca prove that ) is a 5-fold basis for ξ ( Wm Remark. I cotrast to upper bouds of the basis umbers of Wm ad Wm C give i Theorem 2 ad Theorem 3, oe ca coecture that the upper boud for the basis umber of kroecker product of two wheels ad W is b ( W ) 0. Coecture: (i) What is b( K m K )? where ad W are subgraphs of K m ad K. resp. (ii) What did you coecture about b G G )? ( 2, Z It 74
12 UPPER AND LOWER BOUNDS OF THE BASIS REFERENCES. [] A.A.Ali, The basis umber of the direct product of paths ad cycles, Ars combiatoria, Vol.27 (989), pp [2] J.A.Baks ad E.F.Schmeichel, The basis umber of the -cube, J.Comb.Theory, Ser.B, Vol.33, No.2, (982), pp [3] F.Harary, Graph Theory, 3 rd. pritig, Addiso-Wesely, Readig, Massachusetts, (972). [4] A.A.Khaleel, O the basis umber of Kroecker product of some special graphs,m.sc.thesis,mosul Uiversity,(2004). [5] S.MacLae, A combiatorial coditio for plaar graphs, Fud. Math., Vol.28, (937), pp [6] E.F.Schmeichel, The basis umber of a graph,j.comb.theory, Ser.B, Vol.30,No.2 (98), pp [7] H.H.Teh, ad H.P., Yap, Some costructio problems of homogeous graphs, Bull. Math. Soc., Nayag Uiv., (964), pp [8] P.M.Weichsel, The kroecker product of graphs, Proc,Amer. Math.Soc., Vol.3, (962), pp
CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS
22 CHAPTER 2 NEIGHBORHOOD CONNECTED PERFECT DOMINATION IN GRAPHS 2.1 INTRODUCTION Various types of domiatio have bee studied by several authors ad more tha 75 models of domiatio are listed i the appedix
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationLONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES
J Lodo Math Soc (2 50, (1994, 465 476 LONG SNAKES IN POWERS OF THE COMPLETE GRAPH WITH AN ODD NUMBER OF VERTICES Jerzy Wojciechowski Abstract I [5] Abbott ad Katchalski ask if there exists a costat c >
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationIt is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.
Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationUniversity of Twente The Netherlands
Faculty of Mathematical Scieces t Uiversity of Twete The Netherlads P.O. Box 7 7500 AE Eschede The Netherlads Phoe: +3-53-4893400 Fax: +3-53-48934 Email: memo@math.utwete.l www.math.utwete.l/publicatios
More informationRiesz-Fischer Sequences and Lower Frame Bounds
Zeitschrift für Aalysis ud ihre Aweduge Joural for Aalysis ad its Applicatios Volume 1 (00), No., 305 314 Riesz-Fischer Sequeces ad Lower Frame Bouds P. Casazza, O. Christese, S. Li ad A. Lider Abstract.
More informationAlgebra of Least Squares
October 19, 2018 Algebra of Least Squares Geometry of Least Squares Recall that out data is like a table [Y X] where Y collects observatios o the depedet variable Y ad X collects observatios o the k-dimesioal
More informationBinary codes from graphs on triples and permutation decoding
Biary codes from graphs o triples ad permutatio decodig J. D. Key Departmet of Mathematical Scieces Clemso Uiversity Clemso SC 29634 U.S.A. J. Moori ad B. G. Rodrigues School of Mathematics Statistics
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationLinearly Independent Sets, Bases. Review. Remarks. A set of vectors,,, in a vector space is said to be linearly independent if the vector equation
Liearly Idepedet Sets Bases p p c c p Review { v v vp} A set of vectors i a vector space is said to be liearly idepedet if the vector equatio cv + c v + + c has oly the trivial solutio = = { v v vp} The
More informationMath F215: Induction April 7, 2013
Math F25: Iductio April 7, 203 Iductio is used to prove that a collectio of statemets P(k) depedig o k N are all true. A statemet is simply a mathematical phrase that must be either true or false. Here
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationOnline hypergraph matching: hiring teams of secretaries
Olie hypergraph matchig: hirig teams of secretaries Rafael M. Frogillo Advisor: Robert Kleiberg May 29, 2008 Itroductio The goal of this paper is to fid a competitive algorithm for the followig problem.
More informationIn number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.
Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers
More informationLecture Notes for Analysis Class
Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios
More informationSome remarks for codes and lattices over imaginary quadratic
Some remarks for codes ad lattices over imagiary quadratic fields Toy Shaska Oaklad Uiversity, Rochester, MI, USA. Caleb Shor Wester New Eglad Uiversity, Sprigfield, MA, USA. shaska@oaklad.edu Abstract
More information, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)
Cosider the differetial equatio y '' k y 0 has particular solutios y1 si( kx) ad y cos( kx) I geeral, ay liear combiatio of y1 ad y, cy 1 1 cy where c1, c is also a solutio to the equatio above The reaso
More informationBI-INDUCED SUBGRAPHS AND STABILITY NUMBER *
Yugoslav Joural of Operatios Research 14 (2004), Number 1, 27-32 BI-INDUCED SUBGRAPHS AND STABILITY NUMBER * I E ZVEROVICH, O I ZVEROVICH RUTCOR Rutgers Ceter for Operatios Research, Rutgers Uiversity,
More informationLargest families without an r-fork
Largest families without a r-for Aalisa De Bois Uiversity of Salero Salero, Italy debois@math.it Gyula O.H. Katoa Réyi Istitute Budapest, Hugary ohatoa@reyi.hu Itroductio Let [] = {,,..., } be a fiite
More informationONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS
ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS A.Maheswari 1, P.Padiaraj 2 1,2 Departet of Matheatics,Kaaraj College of Egieerig ad Techology, Virudhuagar (Idia) ABSTRACT A graph G
More informationThe log-behavior of n p(n) and n p(n)/n
Ramauja J. 44 017, 81-99 The log-behavior of p ad p/ William Y.C. Che 1 ad Ke Y. Zheg 1 Ceter for Applied Mathematics Tiaji Uiversity Tiaji 0007, P. R. Chia Ceter for Combiatorics, LPMC Nakai Uivercity
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS
ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary
More informationChapter 2. Periodic points of toral. automorphisms. 2.1 General introduction
Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationLarge holes in quasi-random graphs
Large holes i quasi-radom graphs Joaa Polcy Departmet of Discrete Mathematics Adam Mickiewicz Uiversity Pozań, Polad joaska@amuedupl Submitted: Nov 23, 2006; Accepted: Apr 10, 2008; Published: Apr 18,
More informationIntegrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number
MATH 532 Itegrable Fuctios Dr. Neal, WKU We ow shall defie what it meas for a measurable fuctio to be itegrable, show that all itegral properties of simple fuctios still hold, ad the give some coditios
More informationThe Local Harmonious Chromatic Problem
The 7th Workshop o Combiatorial Mathematics ad Computatio Theory The Local Harmoious Chromatic Problem Yue Li Wag 1,, Tsog Wuu Li ad Li Yua Wag 1 Departmet of Iformatio Maagemet, Natioal Taiwa Uiversity
More informationWeakly Connected Closed Geodetic Numbers of Graphs
Iteratioal Joural of Mathematical Aalysis Vol 10, 016, o 6, 57-70 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/101988/ijma01651193 Weakly Coected Closed Geodetic Numbers of Graphs Rachel M Pataga 1, Imelda
More informationChapter 6 Infinite Series
Chapter 6 Ifiite Series I the previous chapter we cosidered itegrals which were improper i the sese that the iterval of itegratio was ubouded. I this chapter we are goig to discuss a topic which is somewhat
More informationThe Forcing Domination Number of Hamiltonian Cubic Graphs
Iteratioal J.Math. Combi. Vol.2 2009), 53-57 The Forcig Domiatio Number of Hamiltoia Cubic Graphs H.Abdollahzadeh Ahagar Departmet of Mathematics, Uiversity of Mysore, Maasagagotri, Mysore- 570006 Pushpalatha
More informationINFINITE SEQUENCES AND SERIES
11 INFINITE SEQUENCES AND SERIES INFINITE SEQUENCES AND SERIES 11.4 The Compariso Tests I this sectio, we will lear: How to fid the value of a series by comparig it with a kow series. COMPARISON TESTS
More informationSquare-Congruence Modulo n
Square-Cogruece Modulo Abstract This paper is a ivestigatio of a equivalece relatio o the itegers that was itroduced as a exercise i our Discrete Math class. Part I - Itro Defiitio Two itegers are Square-Cogruet
More informationCongruence Modulo a. Since,
Cogruece Modulo - 03 The [ ] equivalece classes refer to the Differece of quares relatio ab if a -b o defied as Theorem 3 - Phi is Periodic, a, [ a ] [ a] The period is Let ad a We must show ( a ) a ice,
More informationγ-max Labelings of Graphs
γ-max Labeligs of Graphs Supapor Saduakdee 1 & Varaoot Khemmai 1 Departmet of Mathematics, Sriakhariwirot Uiversity, Bagkok, Thailad Joural of Mathematics Research; Vol. 9, No. 1; February 017 ISSN 1916-9795
More informationOn size multipartite Ramsey numbers for stars versus paths and cycles
Electroic Joural of Graph Theory ad Applicatios 5 (1) (2017), 4 50 O size multipartite Ramsey umbers for stars versus paths ad cycles Aie Lusiai 1, Edy Tri Baskoro, Suhadi Wido Saputro Combiatorial Mathematics
More informationGroup divisible designs GDD(n, n, n, 1; λ 1,λ 2 )
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 69(1) (2017), Pages 18 28 Group divisible desigs GDD(,,, 1; λ 1,λ 2 ) Atthakor Sakda Chariya Uiyyasathia Departmet of Mathematics ad Computer Sciece Faculty
More informationMAT1026 Calculus II Basic Convergence Tests for Series
MAT026 Calculus II Basic Covergece Tests for Series Egi MERMUT 202.03.08 Dokuz Eylül Uiversity Faculty of Sciece Departmet of Mathematics İzmir/TURKEY Cotets Mootoe Covergece Theorem 2 2 Series of Real
More informationREGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS
REGULARIZATION OF CERTAIN DIVERGENT SERIES OF POLYNOMIALS LIVIU I. NICOLAESCU ABSTRACT. We ivestigate the geeralized covergece ad sums of series of the form P at P (x, where P R[x], a R,, ad T : R[x] R[x]
More informationChapter Vectors
Chapter 4. Vectors fter readig this chapter you should be able to:. defie a vector. add ad subtract vectors. fid liear combiatios of vectors ad their relatioship to a set of equatios 4. explai what it
More informationThe Random Walk For Dummies
The Radom Walk For Dummies Richard A Mote Abstract We look at the priciples goverig the oe-dimesioal discrete radom walk First we review five basic cocepts of probability theory The we cosider the Beroulli
More informationAdjacent vertex distinguishing total coloring of tensor product of graphs
America Iteratioal Joural of Available olie at http://wwwiasiret Research i Sciece Techology Egieerig & Mathematics ISSN Prit): 38-3491 ISSN Olie): 38-3580 ISSN CD-ROM): 38-369 AIJRSTEM is a refereed idexed
More informationGeometry of LS. LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT
OCTOBER 7, 2016 LECTURE 3 GEOMETRY OF LS, PROPERTIES OF σ 2, PARTITIONED REGRESSION, GOODNESS OF FIT Geometry of LS We ca thik of y ad the colums of X as members of the -dimesioal Euclidea space R Oe ca
More informationChain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1
CHAINS 1.1 Chai coditios 1. Artiia ad oetheria modules. (1.1) Defiitio. Let A be a rig ad M a A-module. The module M is oetheria if every ascedig chai!!m 1 M 2 of submodules M of M is stable, that is,
More informationTopological Folding of Locally Flat Banach Spaces
It. Joural of Math. Aalysis, Vol. 6, 0, o. 4, 007-06 Topological Foldig of Locally Flat aach Spaces E. M. El-Kholy *, El-Said R. Lashi ** ad Salama N. aoud ** *epartmet of Mathematics, Faculty of Sciece,
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationJournal of Ramanujan Mathematical Society, Vol. 24, No. 2 (2009)
Joural of Ramaua Mathematical Society, Vol. 4, No. (009) 199-09. IWASAWA λ-invariants AND Γ-TRANSFORMS Aupam Saikia 1 ad Rupam Barma Abstract. I this paper we study a relatio betwee the λ-ivariats of a
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationAn exact result for hypergraphs and upper bounds for the Turán density of K r r+1
A exact result for hypergraphs ad upper bouds for the Turá desity of K r r+1 Liyua Lu Departmet of Mathematics Uiversity of outh Carolia Columbia, C 908 Yi Zhao Departmet of Mathematics ad tatistics Georgia
More informationMath 778S Spectral Graph Theory Handout #3: Eigenvalues of Adjacency Matrix
Math 778S Spectral Graph Theory Hadout #3: Eigevalues of Adjacecy Matrix The Cartesia product (deoted by G H) of two simple graphs G ad H has the vertex-set V (G) V (H). For ay u, v V (G) ad x, y V (H),
More informationOn the Number of 1-factors of Bipartite Graphs
Math Sci Lett 2 No 3 181-187 (2013) 181 Mathematical Scieces Letters A Iteratioal Joural http://dxdoiorg/1012785/msl/020306 O the Number of 1-factors of Bipartite Graphs Mehmet Akbulak 1 ad Ahmet Öteleş
More information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationMath778P Homework 2 Solution
Math778P Homework Solutio Choose ay 5 problems to solve. 1. Let S = X i where X 1,..., X are idepedet uiform { 1, 1} radom variables. Prove that E( S = 1 ( 1 1 Proof by Day Rorabaugh: Let S = X i where
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationk-equitable mean labeling
Joural of Algorithms ad Comutatio joural homeage: htt://jac.ut.ac.ir k-euitable mea labelig P.Jeyathi 1 1 Deartmet of Mathematics, Govidammal Aditaar College for Wome, Tiruchedur- 628 215,Idia ABSTRACT
More informationCHAPTER 5. Theory and Solution Using Matrix Techniques
A SERIES OF CLASS NOTES FOR 2005-2006 TO INTRODUCE LINEAR AND NONLINEAR PROBLEMS TO ENGINEERS, SCIENTISTS, AND APPLIED MATHEMATICIANS DE CLASS NOTES 3 A COLLECTION OF HANDOUTS ON SYSTEMS OF ORDINARY DIFFERENTIAL
More informationBeurling Integers: Part 2
Beurlig Itegers: Part 2 Isomorphisms Devi Platt July 11, 2015 1 Prime Factorizatio Sequeces I the last article we itroduced the Beurlig geeralized itegers, which ca be represeted as a sequece of real umbers
More informationMa/CS 6b Class 19: Extremal Graph Theory
/9/05 Ma/CS 6b Class 9: Extremal Graph Theory Paul Turá By Adam Sheffer Extremal Graph Theory The subfield of extremal graph theory deals with questios of the form: What is the maximum umber of edges that
More informationDisjoint Systems. Abstract
Disjoit Systems Noga Alo ad Bey Sudaov Departmet of Mathematics Raymod ad Beverly Sacler Faculty of Exact Scieces Tel Aviv Uiversity, Tel Aviv, Israel Abstract A disjoit system of type (,,, ) is a collectio
More informationFormulas for the Number of Spanning Trees in a Maximal Planar Map
Applied Mathematical Scieces Vol. 5 011 o. 64 3147-3159 Formulas for the Number of Spaig Trees i a Maximal Plaar Map A. Modabish D. Lotfi ad M. El Marraki Departmet of Computer Scieces Faculty of Scieces
More informationEQUITABLE DOMINATING CHROMATIC SETS IN GRAPHS. Sethu Institute of Technology Kariapatti, Tamilnadu, INDIA 2 Department of Mathematics
Iteratioal Joural of Pure ad Applied Mathematics Volume 104 No. 2 2015, 193-202 ISSN: 1311-8080 (prited versio); ISSN: 1314-3395 (o-lie versio) url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v104i2.4
More information6. Uniform distribution mod 1
6. Uiform distributio mod 1 6.1 Uiform distributio ad Weyl s criterio Let x be a seuece of real umbers. We may decompose x as the sum of its iteger part [x ] = sup{m Z m x } (i.e. the largest iteger which
More informationProblem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More informationSymmetric Division Deg Energy of a Graph
Turkish Joural of Aalysis ad Number Theory, 7, Vol, No 6, -9 Available olie at http://pubssciepubcom/tat//6/ Sciece ad Educatio Publishig DOI:69/tat--6- Symmetric Divisio Deg Eergy of a Graph K N Prakasha,
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationDIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS
DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163
More informationBroadhurst s Dimensions
Broadhurst s Dimesios May 10, 2010 Abstract Broadhurst cojectured a dimesio for the graded pieces of the Q vector space of multiple zeta values based o large scale experimetal computatios. I this talk,
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationMath 451: Euclidean and Non-Euclidean Geometry MWF 3pm, Gasson 204 Homework 3 Solutions
Math 451: Euclidea ad No-Euclidea Geometry MWF 3pm, Gasso 204 Homework 3 Solutios Exercises from 1.4 ad 1.5 of the otes: 4.3, 4.10, 4.12, 4.14, 4.15, 5.3, 5.4, 5.5 Exercise 4.3. Explai why Hp, q) = {x
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationDominating Sets and Domination Polynomials of Square Of Cycles
IOSR Joural of Mathematics IOSR-JM) ISSN: 78-78. Volume 3, Issue 4 Sep-Oct. 01), PP 04-14 www.iosrjourals.org Domiatig Sets ad Domiatio Polyomials of Square Of Cycles A. Vijaya 1, K. Lal Gipso 1 Assistat
More informationON POINTWISE BINOMIAL APPROXIMATION
Iteratioal Joural of Pure ad Applied Mathematics Volume 71 No. 1 2011, 57-66 ON POINTWISE BINOMIAL APPROXIMATION BY w-functions K. Teerapabolar 1, P. Wogkasem 2 Departmet of Mathematics Faculty of Sciece
More informationJournal of Multivariate Analysis. Superefficient estimation of the marginals by exploiting knowledge on the copula
Joural of Multivariate Aalysis 102 (2011) 1315 1319 Cotets lists available at ScieceDirect Joural of Multivariate Aalysis joural homepage: www.elsevier.com/locate/jmva Superefficiet estimatio of the margials
More informationOn groups of diffeomorphisms of the interval with finitely many fixed points II. Azer Akhmedov
O groups of diffeomorphisms of the iterval with fiitely may fixed poits II Azer Akhmedov Abstract: I [6], it is proved that ay subgroup of Diff ω +(I) (the group of orietatio preservig aalytic diffeomorphisms
More informationOn Topologically Finite Spaces
saqartvelos mecierebata erovuli aademiis moambe, t 9, #, 05 BULLETIN OF THE GEORGIAN NATIONAL ACADEMY OF SCIENCES, vol 9, o, 05 Mathematics O Topologically Fiite Spaces Giorgi Vardosaidze St Adrew the
More informationAN INTRODUCTION TO SPECTRAL GRAPH THEORY
AN INTRODUCTION TO SPECTRAL GRAPH THEORY JIAQI JIANG Abstract. Spectral graph theory is the study of properties of the Laplacia matrix or adjacecy matrix associated with a graph. I this paper, we focus
More informationMath Solutions to homework 6
Math 175 - Solutios to homework 6 Cédric De Groote November 16, 2017 Problem 1 (8.11 i the book): Let K be a compact Hermitia operator o a Hilbert space H ad let the kerel of K be {0}. Show that there
More informationPairs of disjoint q-element subsets far from each other
Pairs of disjoit q-elemet subsets far from each other Hikoe Eomoto Departmet of Mathematics, Keio Uiversity 3-14-1 Hiyoshi, Kohoku-Ku, Yokohama, 223 Japa, eomoto@math.keio.ac.jp Gyula O.H. Katoa Alfréd
More informationLecture 4: Grassmannians, Finite and Affine Morphisms
18.725 Algebraic Geometry I Lecture 4 Lecture 4: Grassmaias, Fiite ad Affie Morphisms Remarks o last time 1. Last time, we proved the Noether ormalizatio lemma: If A is a fiitely geerated k-algebra, the,
More informationMath 116 Practice for Exam 3
Math 6 Practice for Eam 3 Geerated April 4, 26 Name: SOLUTIONS Istructor: Sectio Number:. This eam has questios. Note that the problems are ot of equal difficulty, so you may wat to skip over ad retur
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More information11. FINITE FIELDS. Example 1: The following tables define addition and multiplication for a field of order 4.
11. FINITE FIELDS 11.1. A Field With 4 Elemets Probably the oly fiite fields which you ll kow about at this stage are the fields of itegers modulo a prime p, deoted by Z p. But there are others. Now although
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationEmpirical Process Theory and Oracle Inequalities
Stat 928: Statistical Learig Theory Lecture: 10 Empirical Process Theory ad Oracle Iequalities Istructor: Sham Kakade 1 Risk vs Risk See Lecture 0 for a discussio o termiology. 2 The Uio Boud / Boferoi
More informationLecture 14: Graph Entropy
15-859: Iformatio Theory ad Applicatios i TCS Sprig 2013 Lecture 14: Graph Etropy March 19, 2013 Lecturer: Mahdi Cheraghchi Scribe: Euiwoog Lee 1 Recap Bergma s boud o the permaet Shearer s Lemma Number
More informationIntermediate Math Circles November 4, 2009 Counting II
Uiversity of Waterloo Faculty of Mathematics Cetre for Educatio i Mathematics ad Computig Itermediate Math Circles November 4, 009 Coutig II Last time, after lookig at the product rule ad sum rule, we
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationFundamental Theorem of Algebra. Yvonne Lai March 2010
Fudametal Theorem of Algebra Yvoe Lai March 010 We prove the Fudametal Theorem of Algebra: Fudametal Theorem of Algebra. Let f be a o-costat polyomial with real coefficiets. The f has at least oe complex
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More information