Packing of graphs with small product of sizes
|
|
- Lesley Atkinson
- 5 years ago
- Views:
Transcription
1 Joural of Combatoral Theory, Seres B 98 (008) Note Packg of graphs wth small product of szes Alexadr V. Kostochka a,b,,gexyu c, a Departmet of Mathematcs, Uversty of Illos, Urbaa, IL 680, USA b Sobolev Isttute of Mathematcs, Novosbrsk , Russa c Departmet of Mathematcs, Vaderblt Uversty, Nashvlle, TN 3740, USA Receved 6 August 007 Avalable ole 8 March 008 Abstract We show that for every ɛ>0, there exsts 0 = 0 (ɛ) such that for every > 0,two-vertex graphs G ad G wth e(g )e(g ) ( ɛ) pack, uless they belog to a well-defed famly of exceptos. Ths exteds a well-kow result by Sauer ad Specer. 008 Elsever Ic. All rghts reserved. Keywords: Graph packg. Itroducto How may edges should a -vertex graph have to cota every graph wth at most vertces ad at most m edges? Erdős ad Stoe [7] proved that for every postve teger d ad postve c ad suffcetly large, every graph G of order wth at least ( /)( /d) + c edges cotas a complete (d + )-partte graph wth t vertces each part, where t teds to fty wth. It follows that ths G cotas every d-colorable graph o t vertces, ad, partcular, that G cotas every graph wth less tha ( d+) edges. Later Bollobás, Erdős, ad Smoovts [] showed that t a log /(d log(/c)) for some postve costat a ad cojectured that ths ca be mproved as follows: t b log / log(/c). Chvátal ad Szemeréd [6] verfed ths cojecture by provg the followg theorem. E-mal addresses: kostochk@math.uuc.edu (A.V. Kostochka), gex.yu@vaderblt.edu (G. Yu). Research supported part by NSF grat DMS ad RFBR grat Research supported part by NSF grat DMS /$ see frot matter 008 Elsever Ic. All rghts reserved. do:0.06/j.jctb
2 4 A.V. Kostochka, G. Yu / Joural of Combatoral Theory, Seres B 98 (008) 4 45 Theorem. (See Chvátal ad Szemeréd [6].) For each postve teger d ad each c>0, there s a 0 = 0 (d, c) such that for each 0, every graph of order wth at least ( /)( /d) + c edges cotas a complete (d + )-partte graph wth at least (log )/(500 log(/c)) vertces each part. Bollobás ad Eldrdge [] cosdered also Turá-type codtos guarateeg that a -vertex graph cotas every subgraph wth α edges for α</. They proved a boud ths drecto the laguage of packg ad posed a cojecture whch was proved by Bradt [5]. Recall that two graphs pack f oe of the graphs s cotaed the complemet of the other. The ext theorem s a somewhat smplfed verso of Bradt s result. Theorem. (See Bradt [5].) For every 0 <α</, there exsts 0 = 0 (α) such that f > 0, e(g ) α, ad e(g ) 3 α 3/, the G ad G pack. Bollobás, Kostochka, ad Nakprast [3] exteded Theorem to the case α. A smplfed verso of t s as follows. Theorem 3. (See Bollobás, Kostochka ad Nakprast [3].) Let / α<. Let G ad G be graphs of order >( 40 α )6 such that e(g ) α, e(g ) 3 3/, ad Δ(G )<. The G α( α) ad G pack. Sauer ad Specer [8] proved the followg boud terms of the product of the szes of graphs. Theorem 4. (See Sauer ad Specer [8].) Two -vertex graphs G ad G pack, f ( ) e(g )e(g )<. The followg examples of graphs that do ot pack show that the codto e(g )e(g )< ( ) caot be weakeed wthout troducg other restrctos. Example. G = K ad G = K K. Example. G = K, ad G has o solated vertces. Note that Example, f s eve ad G s a perfect matchg, the e(g )e(g ) = ( ). Also ote that e(g ) + e(g ) ca be aroud 3/. Bollobás ad Eldrdge [] proved that ths may happe oly f oe of the graphs has a all-adjacet vertex or s small. I a bt smplfed form, ther result s as follows. Theorem 5. (See Bollobás ad Eldrdge [].) Let G ad G be graphs of order >0 such that Δ(G ), Δ(G ) ad e(g ) + e(g ) 3. The G ad G pack. Ths boud s also sharp as the followg examples show. Example 3. G = G = K 3 K, 4.
3 A.V. Kostochka, G. Yu / Joural of Combatoral Theory, Seres B 98 (008) Example 4. G = K, K ad G s -regular. Example 5. G = K, 3 K, s dvsble by 3, ad G = K 3 K 3. Teo ad Yap [9] showed that for 3, Examples 3 5 are the oly pars (G,G ) of -vertex graphs wth e(g ) + e(g ) = that do ot pack. I ths paper we stregthe Theorem 4 by descrbg (for large ) the pars (G,G ) of -vertex graphs wth e(g )e(g ) ( ɛ) that do ot pack. Theorem 6. For every ɛ>0, there exsts N, such that for all >N,ftwo-vertex graphs G ad G wth e(g )e(g ) ( ɛ) () do ot pack, the oe of the followg holds: () oe of the graphs s K ad the other has exactly oe edge; or () oe of the graphs has maxmum degree ad the other has mmum degree at least oe; or () oe of the graphs s a tragle, ad the other has depedece umber two. Observe that there are expoetally may pars (G,G ) of -vertex graphs satsfyg () or () wth e(g )e(g ) 0.9. Although -vertex graphs wth depedece umber two ad fewer tha ( ɛ) /3 edges may have a complcated structure, we ca polyomal tme check ay graph whether t possesses ths property. We beleve that t wll be suffcetly harder to descrbe the pars (G,G ) of -vertex graphs wth e(g )e(g ) ( + ɛ) that do ot pack eve for small postve ɛ. Note that Examples 3 5 fall to ths category. Yet aother example s as follows. Example 6. G = K 4, s dvsble by 3, ad G = K /3 K /3 K /3. I the proof of Theorem 6 we wll make use of the followg fact. Theorem 7. (See Bollobás, Kostochka ad Nakprast [4].) Let d. Let G be a d-degeerate graph of order ad maxmum degree Δ ad G a graph of order ad maxmum degree at most Δ.If40Δ l Δ <ad 40dΔ <, the G ad G pack. Recall that a graph s d-degeerate f every subgraph of t cotas a vertex of degree at most d.. Proof of Theorem 6 Fx a 0 <ɛ<0.. Let be large. Suppose that Theorem 6 does ot hold for ɛ ad,.e. that there are -vertex graphs G ad G satsfyg () that do ot pack ad do ot belog to the famles descrbed by () (). We may assume that e(g ) e(g ). So, by (), e(g )< ɛ < ( ɛ/). Letα = e(g )/. By above, 0 <α< ɛ/. ()
4 44 A.V. Kostochka, G. Yu / Joural of Combatoral Theory, Seres B 98 (008) 4 45 Let Δ, =,, deote the maxmum degree of G. By Theorems ad 3, f e(g )< 3 3 ad Δ < α, the G ad G pack. So we cosder the followg two cases: () Δ α ad e(g )< 3 3, ad () e(g ) 3 3. Case. Δ α ad e(g )< 3 3.Letw V(G ) be a vertex of maxmum degree Δ G. If e(g )<( ɛ/)/, the sce s large ad e(g )< 3 3, G ad G pack by Theorem. So we assume that e(g ) ( ɛ/)/. Note that the by (), e(g ) ( ɛ). If G has a solated vertex, say w, the let G = G w, ad G = G w. Wehave e(g ) = e(g ) ad e ( G ) = e(g ) Δ(G ) ( ɛ) + <( ɛ/) (3) α for >( ɛ( α) ). By () ad (3), for such ad {, },wehave Δ ( G ( ) ) e G <( ɛ/) ( ). By Theorem 5, G ad G pack. Thus G ad G pack as well (by placg w at w). Assume ow that G has o solated vertces. Sce () does ot hold, G has o vertex of degree. Sce every coected graph H cotag a cycle has E(H) V(H) ad e(g )<( ɛ/), G has at least ɛ tree compoets. So there s a tree compoet T of G wth at most ɛ/ = ɛ vertces. We wll frst place o the vertces of G the vertces of T, ad the fd a placemet of the remag vertces. Let t = V(T) ad let the vertces of T be ordered u,u,...,u t such a way that u s a leaf ad for every =,...,t,vertexu has exactly oe eghbor {u,u,...,u }. Place u at w. Sce d G (w) <, we may place u at a o-eghbor w of w G.Let G = G u ad G = G w. Suppose ow that t ad we have already placed u,...,u o vertces w,...,w of G. By the orderg of V(T), u + has exactly oe eghbor u j {u,u,...,u }. Observe that e ( G ) e(g ) Δ <( ɛ/). (4) Therefore, w has at least ( ɛ/) o-eghbors G.Atmost t ɛ of these vertces are already occuped by u,...,u. Thus for large, there s a o-eghbor w + of w ot yet occuped. Place there u +. Ths way, we place all vertces V(T) o vertces of G wthout coflcts. Let G = G V(T)ad G = G {w,w,...,w t }. If we fd a packg of G wth G, the we obta a packg of G wth G, a cotradcto. By (4), for large, e ( G ) ( ( ) + e G ) ( ɛ/) (t ) + ( ɛ/) ( t) 3. By () ad (4), for =,, Δ(G ) e(g )<( ɛ/) (G ), ad hece ether G or G has a all-adjacet vertex. Thus by Theorem 5, G ad G pack. Case. e(g ) 3 3. The ( ) e(g ) ( ɛ) / 3 3 = 3( ɛ). (5) Sce e(g )<3, G has at least 6 >/ solated vertces. Let v,v,...,v be a orderg of V(G ) such that v has maxmum degree G [v,...,v ].LetG =
5 A.V. Kostochka, G. Yu / Joural of Combatoral Theory, Seres B 98 (008) G [v / +,...,v ] ad Δ be the maxmum degree of G. The 0 e(g ) Δ e(g ) Δ ( + )/, ad thus Δ e(g )/. LetG be the graph obtaed after removg / solated vertces from G.Let = /. If G s a forest, the let d =. Otherwse, let d be the maxmum postve teger such that G s d-degeerate. Sce e(g ) d(d + )/, d e(g ). (6) By (5), 40Δ l Δ < 40e(G ) l <. Sce G ad G do ot pack, Theorem 7 yelds 40dΔ.So / 40dΔ 40 e(g ) e(g ) 80 e(g ) ( ɛ) e(g ) = 80 ( ɛ). e(g ) That s, e(g ) (60 ( ɛ)) < 0 5.Letc 0 = e(g ).Ifc 0 = ad G ad G do ot pack, the G = K ad hece () holds. If c 0 = ad G ad G do ot pack, the the complemet G of G s cotaed ether a matchg (f G s a -path), or K, or K 3 (f G has two solated edges). I all cases, G has at least ( ) edges. Therefore, e(g )e(g ) 3, a cotradcto to (). The case G = K 3 ad G ad G do ot pack s the other way to express (). So, we have 3 c ad G K 3. Hece the sze of the complemet G of G s at least ( ) ) ( ɛ) = ( c0 + ɛc0 c 0 ) ( c0 + ɛ. c 0 By Theorem, G cotas complete ( 0.5c log 0 +)-partte graph wth t 500 log(c 0 /ɛ) > 05 vertces each part. Thus, f χ ( G ) + 0.5c0, (7) the G cotas G,.e., G ad G pack ad hece G ad G pack. Ths s certaly the case f c 0 = 3 ad G K 3.Ifc 0 {4, 5}, the χ(g ) 3 ad + 0.5c 0 =3. Smlarly, f c 0 {6, 7}, the χ(g ) 4 ad + 0.5c 0 =4. Let c 0 8 ad k = χ(g ). Sce G s d-degeerate, (6) yelds k + d + c 0.But for each real c 0 8, we have c 0 0.5c 0 ad so (7) holds. Ths proves the theorem. Refereces [] B. Bollobás, S.E. Eldrdge, Packgs of graphs ad applcatos to computatoal complexty, J. Comb. Theory Ser. B 5 (978) [] B. Bollobás, P. Erdős, M. Smoovts, O the structure of edge graphs. II, J. Lodo Math. Soc. () (975/976) 9 4. [3] B. Bollobás, A.V. Kostochka, K. Nakprast, O two cojectures o packg of graphs, Comb. Probab. Comput. 4 (005) [4] B. Bollobás, A.V. Kostochka, K. Nakprast, Packg d-degeerate graphs, J. Comb. Theory Ser. B 98 (008) [5] S. Bradt, A extremal result for subgraphs wth few edges, J. Comb. Theory Ser. B 64 (995) [6] V. Chvátal, E. Szemeréd, O the Erdős Stoe theorem, J. Lodo Math. Soc. () 3 (98) [7] P. Erdős, A.H. Stoe, O the structure of lear graphs, Bull. Amer. Math. Soc. 5 (946) [8] N. Sauer, J. Specer, Edge dsjot placemet of graphs, J. Comb. Theory Ser. B 5 (978) [9] S.K. Teo, H.P. Yap, Packg two graphs of order havg total sze at most, Graphs Comb. 6 (990)
Non-uniform Turán-type problems
Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at
More informationBounds for the Connective Eccentric Index
It. J. Cotemp. Math. Sceces, Vol. 7, 0, o. 44, 6-66 Bouds for the Coectve Eccetrc Idex Nlaja De Departmet of Basc Scece, Humates ad Socal Scece (Mathematcs Calcutta Isttute of Egeerg ad Maagemet Kolkata,
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More information18.413: Error Correcting Codes Lab March 2, Lecture 8
18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse
More informationFurther Results on Pair Sum Labeling of Trees
Appled Mathematcs 0 70-7 do:046/am0077 Publshed Ole October 0 (http://wwwscrporg/joural/am) Further Results o Par Sum Labelg of Trees Abstract Raja Poraj Jeyaraj Vjaya Xaver Parthpa Departmet of Mathematcs
More informationv 1 -periodic 2-exponents of SU(2 e ) and SU(2 e + 1)
Joural of Pure ad Appled Algebra 216 (2012) 1268 1272 Cotets lsts avalable at ScVerse SceceDrect Joural of Pure ad Appled Algebra joural homepage: www.elsever.com/locate/jpaa v 1 -perodc 2-expoets of SU(2
More informationExercises for Square-Congruence Modulo n ver 11
Exercses for Square-Cogruece Modulo ver Let ad ab,.. Mark True or False. a. 3S 30 b. 3S 90 c. 3S 3 d. 3S 4 e. 4S f. 5S g. 0S 55 h. 8S 57. 9S 58 j. S 76 k. 6S 304 l. 47S 5347. Fd the equvalece classes duced
More informationIdeal multigrades with trigonometric coefficients
Ideal multgrades wth trgoometrc coeffcets Zarathustra Brady December 13, 010 1 The problem A (, k) multgrade s defed as a par of dstct sets of tegers such that (a 1,..., a ; b 1,..., b ) a j = =1 for all
More informationResearch Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings
Hdaw Publshg Corporato Iteratoal Joural of Mathematcs ad Mathematcal Sceces Volume 009, Artcle ID 391839, 9 pages do:10.1155/009/391839 Research Artcle A New Iteratve Method for Commo Fxed Pots of a Fte
More informationDouble Dominating Energy of Some Graphs
Iter. J. Fuzzy Mathematcal Archve Vol. 4, No., 04, -7 ISSN: 30 34 (P), 30 350 (ole) Publshed o 5 March 04 www.researchmathsc.org Iteratoal Joural of V.Kaladev ad G.Sharmla Dev P.G & Research Departmet
More informationAN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET
AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET Abstract. The Permaet versus Determat problem s the followg: Gve a matrx X of determates over a feld of characterstc dfferet from
More informationStrong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity
BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY Bull. Malays. Math. Sc. Soc. () 7 (004), 5 35 Strog Covergece of Weghted Averaged Appromats of Asymptotcally Noepasve Mappgs Baach Spaces wthout
More informationMean Cordial Labeling of Certain Graphs
J Comp & Math Sc Vol4 (4), 74-8 (03) Mea Cordal Labelg o Certa Graphs ALBERT WILLIAM, INDRA RAJASINGH ad S ROY Departmet o Mathematcs, Loyola College, Chea, INDIA School o Advaced Sceces, VIT Uversty,
More information5 Short Proofs of Simplified Stirling s Approximation
5 Short Proofs of Smplfed Strlg s Approxmato Ofr Gorodetsky, drtymaths.wordpress.com Jue, 20 0 Itroducto Strlg s approxmato s the followg (somewhat surprsg) approxmato of the factoral,, usg elemetary fuctos:
More informationQ-analogue of a Linear Transformation Preserving Log-concavity
Iteratoal Joural of Algebra, Vol. 1, 2007, o. 2, 87-94 Q-aalogue of a Lear Trasformato Preservg Log-cocavty Daozhog Luo Departmet of Mathematcs, Huaqao Uversty Quazhou, Fua 362021, P. R. Cha ldzblue@163.com
More informationOn Complementary Edge Magic Labeling of Certain Graphs
Amerca Joural of Mathematcs ad Statstcs 0, (3: -6 DOI: 0.593/j.ajms.0003.0 O Complemetary Edge Magc Labelg of Certa Graphs Sajay Roy,*, D.G. Akka Research Scholar, Ida Academc Dea, HMS sttute of Techology,
More informationON THE CHROMATIC NUMBER OF GENERALIZED STABLE KNESER GRAPHS
ON THE CHROMATIC NUMBER OF GENERALIZED STABLE KNESER GRAPHS JAKOB JONSSON Abstract. For each teger trple (, k, s) such that k 2, s 2, a ks, efe a graph the followg maer. The vertex set cossts of all k-subsets
More informationThe Mathematical Appendix
The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.
More informationLecture 9: Tolerant Testing
Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationLebesgue Measure of Generalized Cantor Set
Aals of Pure ad Appled Mathematcs Vol., No.,, -8 ISSN: -8X P), -888ole) Publshed o 8 May www.researchmathsc.org Aals of Lebesgue Measure of Geeralzed ator Set Md. Jahurul Islam ad Md. Shahdul Islam Departmet
More informationA Study on Generalized Generalized Quasi hyperbolic Kac Moody algebra QHGGH of rank 10
Global Joural of Mathematcal Sceces: Theory ad Practcal. ISSN 974-3 Volume 9, Number 3 (7), pp. 43-4 Iteratoal Research Publcato House http://www.rphouse.com A Study o Geeralzed Geeralzed Quas (9) hyperbolc
More informationMA 524 Homework 6 Solutions
MA 524 Homework 6 Solutos. Sce S(, s the umber of ways to partto [] to k oempty blocks, ad c(, s the umber of ways to partto to k oempty blocks ad also the arrage each block to a cycle, we must have S(,
More informationAbout k-perfect numbers
DOI: 0.47/auom-04-0005 A. Şt. Uv. Ovdus Costaţa Vol.,04, 45 50 About k-perfect umbers Mhály Becze Abstract ABSTRACT. I ths paper we preset some results about k-perfect umbers, ad geeralze two equaltes
More informationA tighter lower bound on the circuit size of the hardest Boolean functions
Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the
More informationOn the construction of symmetric nonnegative matrix with prescribed Ritz values
Joural of Lear ad Topologcal Algebra Vol. 3, No., 14, 61-66 O the costructo of symmetrc oegatve matrx wth prescrbed Rtz values A. M. Nazar a, E. Afshar b a Departmet of Mathematcs, Arak Uversty, P.O. Box
More informationSquare Difference Labeling Of Some Path, Fan and Gear Graphs
Iteratoal Joural of Scetfc & Egeerg Research Volume 4, Issue3, March-03 ISSN 9-558 Square Dfferece Labelg Of Some Path, Fa ad Gear Graphs J.Shama Assstat Professor Departmet of Mathematcs CMS College of
More informationIncreasing Kolmogorov Complexity
Icreasg Kolmogorov Complexty Harry Buhrma Lace Fortow Ila Newma Nkola Vereshchag September 7, 2004 classfcato: Kolmogorov complexty, computatoal complexty 1 Itroducto How much do we have to chage a strg
More informationOn Signed Product Cordial Labeling
Appled Mathematcs 55-53 do:.436/am..6 Publshed Ole December (http://www.scrp.or/joural/am) O Sed Product Cordal Label Abstract Jayapal Baskar Babujee Shobaa Loaatha Departmet o Mathematcs Aa Uversty Chea
More informationANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK
Far East Joural of Appled Mathematcs Volume, Number, 2008, Pages Ths paper s avalable ole at http://www.pphm.com 2008 Pushpa Publshg House ANALYSIS ON THE NATURE OF THE ASI EQUATIONS IN SYNERGETI INTER-REPRESENTATION
More informationSome identities involving the partial sum of q-binomial coefficients
Some dettes volvg the partal sum of -bomal coeffcets Bg He Departmet of Mathematcs, Shagha Key Laboratory of PMMP East Cha Normal Uversty 500 Dogchua Road, Shagha 20024, People s Republc of Cha yuhe00@foxmal.com
More informationMATH 371 Homework assignment 1 August 29, 2013
MATH 371 Homework assgmet 1 August 29, 2013 1. Prove that f a subset S Z has a smallest elemet the t s uque ( other words, f x s a smallest elemet of S ad y s also a smallest elemet of S the x y). We kow
More information. The set of these sums. be a partition of [ ab, ]. Consider the sum f( x) f( x 1)
Chapter 7 Fuctos o Bouded Varato. Subject: Real Aalyss Level: M.Sc. Source: Syed Gul Shah (Charma, Departmet o Mathematcs, US Sargodha Collected & Composed by: Atq ur Rehma (atq@mathcty.org, http://www.mathcty.org
More informationSTRONG CONSISTENCY OF LEAST SQUARES ESTIMATE IN MULTIPLE REGRESSION WHEN THE ERROR VARIANCE IS INFINITE
Statstca Sca 9(1999), 289-296 STRONG CONSISTENCY OF LEAST SQUARES ESTIMATE IN MULTIPLE REGRESSION WHEN THE ERROR VARIANCE IS INFINITE J Mgzhog ad Che Xru GuZhou Natoal College ad Graduate School, Chese
More informationCan we take the Mysticism Out of the Pearson Coefficient of Linear Correlation?
Ca we tae the Mstcsm Out of the Pearso Coeffcet of Lear Correlato? Itroducto As the ttle of ths tutoral dcates, our purpose s to egeder a clear uderstadg of the Pearso coeffcet of lear correlato studets
More informationLower Bounds of the Kirchhoff and Degree Kirchhoff Indices
SCIENTIFIC PUBLICATIONS OF THE STATE UNIVERSITY OF NOVI PAZAR SER. A: APPL. MATH. INFORM. AND MECH. vol. 7, (205), 25-3. Lower Bouds of the Krchhoff ad Degree Krchhoff Idces I. Ž. Mlovaovć, E. I. Mlovaovć,
More informationComplete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables
Joural of Sceces, Islamc Republc of Ira 8(4): -6 (007) Uversty of Tehra, ISSN 06-04 http://sceces.ut.ac.r Complete Covergece ad Some Maxmal Iequaltes for Weghted Sums of Radom Varables M. Am,,* H.R. Nl
More informationON THE LOGARITHMIC INTEGRAL
Hacettepe Joural of Mathematcs ad Statstcs Volume 39(3) (21), 393 41 ON THE LOGARITHMIC INTEGRAL Bra Fsher ad Bljaa Jolevska-Tueska Receved 29:9 :29 : Accepted 2 :3 :21 Abstract The logarthmc tegral l(x)
More informationPROJECTION PROBLEM FOR REGULAR POLYGONS
Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c
More informationAssignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)
Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form
More informationMaps on Triangular Matrix Algebras
Maps o ragular Matrx lgebras HMED RMZI SOUROUR Departmet of Mathematcs ad Statstcs Uversty of Vctora Vctora, BC V8W 3P4 CND sourour@mathuvcca bstract We surveys results about somorphsms, Jorda somorphsms,
More informationSolving Constrained Flow-Shop Scheduling. Problems with Three Machines
It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632
More informationCS286.2 Lecture 4: Dinur s Proof of the PCP Theorem
CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat
More informationCHAPTER 4 RADICAL EXPRESSIONS
6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube
More informationJournal of Mathematical Analysis and Applications
J. Math. Aal. Appl. 365 200) 358 362 Cotets lsts avalable at SceceDrect Joural of Mathematcal Aalyss ad Applcatos www.elsever.com/locate/maa Asymptotc behavor of termedate pots the dfferetal mea value
More informationTHE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i
ENUMERATON OF FNTE GROUPS OF THE FORM R ( 2 = (RfR^'u =1. 21 THE COMPLETE ENUMERATON OF FNTE GROUPS OF THE FORM R 2 ={R R j ) k -= H. S. M. COXETER*. ths paper, we vestgate the abstract group defed by
More informationBounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy
Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled
More information(b) By independence, the probability that the string 1011 is received correctly is
Soluto to Problem 1.31. (a) Let A be the evet that a 0 s trasmtted. Usg the total probablty theorem, the desred probablty s P(A)(1 ɛ ( 0)+ 1 P(A) ) (1 ɛ 1)=p(1 ɛ 0)+(1 p)(1 ɛ 1). (b) By depedece, the probablty
More informationF. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties
進佳數學團隊 Dr. Herbert Lam 林康榮博士 HKAL Pure Mathematcs F. Ieualtes. Basc propertes Theorem Let a, b, c be real umbers. () If a b ad b c, the a c. () If a b ad c 0, the ac bc, but f a b ad c 0, the ac bc. Theorem
More informationMinimizing Total Completion Time in a Flow-shop Scheduling Problems with a Single Server
Joural of Aled Mathematcs & Boformatcs vol. o.3 0 33-38 SSN: 79-660 (rt) 79-6939 (ole) Sceress Ltd 0 Mmzg Total omleto Tme a Flow-sho Schedulg Problems wth a Sgle Server Sh lg ad heg xue-guag Abstract
More information{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:
Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed
More informationOn Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph
Aals of Pure ad Appled Mathematcs Vol. 3, No., 7, -3 ISSN: 79-87X (P, 79-888(ole Publshed o 3 March 7 www.researchmathsc.org DOI: http://dx.do.org/.7/apam.3a Aals of O Eccetrcty Sum Egealue ad Eccetrcty
More informationThe Arithmetic-Geometric mean inequality in an external formula. Yuki Seo. October 23, 2012
Sc. Math. Japocae Vol. 00, No. 0 0000, 000 000 1 The Arthmetc-Geometrc mea equalty a exteral formula Yuk Seo October 23, 2012 Abstract. The classcal Jese equalty ad ts reverse are dscussed by meas of terally
More informationNeville Robbins Mathematics Department, San Francisco State University, San Francisco, CA (Submitted August 2002-Final Revision December 2002)
Nevlle Robbs Mathematcs Departmet, Sa Fracsco State Uversty, Sa Fracsco, CA 943 (Submtted August -Fal Revso December ) INTRODUCTION The Lucas tragle s a fte tragular array of atural umbers that s a varat
More informationOn matchings in hypergraphs
O matchigs i hypergraphs Peter Frakl Tokyo, Japa peter.frakl@gmail.com Tomasz Luczak Adam Mickiewicz Uiversity Faculty of Mathematics ad CS Pozań, Polad ad Emory Uiversity Departmet of Mathematics ad CS
More information10.1 Approximation Algorithms
290 0. Approxmato Algorthms Let us exame a problem, where we are gve A groud set U wth m elemets A collecto of subsets of the groud set = {,, } s.t. t s a cover of U: = U The am s to fd a subcover, = U,
More informationInternational Journal of Mathematical Archive-5(8), 2014, Available online through ISSN
Iteratoal Joural of Mathematcal Archve-5(8) 204 25-29 Avalable ole through www.jma.fo ISSN 2229 5046 COMMON FIXED POINT OF GENERALIZED CONTRACTION MAPPING IN FUZZY METRIC SPACES Hamd Mottagh Golsha* ad
More informationFactorization of Finite Abelian Groups
Iteratoal Joural of Algebra, Vol 6, 0, o 3, 0-07 Factorzato of Fte Abela Grous Khald Am Uversty of Bahra Deartmet of Mathematcs PO Box 3038 Sakhr, Bahra kamee@uobedubh Abstract If G s a fte abela grou
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b
CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package
More informationChapter 5 Properties of a Random Sample
Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample
More informationSpecial Instructions / Useful Data
JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth
More information1 Edge Magic Labeling for Special Class of Graphs
S.Srram et. al. / Iteratoal Joural of Moder Sceces ad Egeerg Techology (IJMSET) ISSN 349-3755; Avalable at https://www.jmset.com Volume, Issue 0, 05, pp.60-67 Edge Magc Labelg for Specal Class of Graphs
More informationNP!= P. By Liu Ran. Table of Contents. The P versus NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Prelmary theorem 3. Proof 4. Expla 5. Cocluso. Itroduce The P versus NP problem s a major usolved problem computer scece. Iformally, t asks whether a computer
More informationEQUIENERGETIC COMPLEMENT GRAPHS
67 Kragujevac J. Sc. 7 005) 67-74. EQUIENERGETIC COMPLEMENT GRAPHS Harshchadra S. Ramae a, Iva Gutma b, Haumappa B. Walkar c ad Sabeea B. Halkar c a Departmet of Mathematcs, Gogte Isttute of Techology,
More information1. Overview of basic probability
13.42 Desg Prcples for Ocea Vehcles Prof. A.H. Techet Sprg 2005 1. Overvew of basc probablty Emprcally, probablty ca be defed as the umber of favorable outcomes dvded by the total umber of outcomes, other
More informationOn Face Bimagic Labeling of Graphs
IOSR Joural of Mathematcs (IOSR-JM) e-issn: 78-578, p-issn: 319-765X Volume 1, Issue 6 Ver VI (Nov - Dec016), PP 01-07 wwwosrouralsor O Face Bmac Label of Graphs Mohammed Al Ahmed 1,, J Baskar Babuee 1
More informationThe Primitive Idempotents in
Iteratoal Joural of Algebra, Vol, 00, o 5, 3 - The Prmtve Idempotets FC - I Kulvr gh Departmet of Mathematcs, H College r Jwa Nagar (rsa)-5075, Ida kulvrsheora@yahoocom K Arora Departmet of Mathematcs,
More informationMaximum Walk Entropy Implies Walk Regularity
Maxmum Walk Etropy Imples Walk Regularty Eresto Estraa, a José. e la Peña Departmet of Mathematcs a Statstcs, Uversty of Strathclye, Glasgow G XH, U.K., CIMT, Guaajuato, Mexco BSTRCT: The oto of walk etropy
More informationSTRONG CONSISTENCY FOR SIMPLE LINEAR EV MODEL WITH v/ -MIXING
Joural of tatstcs: Advaces Theory ad Alcatos Volume 5, Number, 6, Pages 3- Avalable at htt://scetfcadvaces.co. DOI: htt://d.do.org/.864/jsata_7678 TRONG CONITENCY FOR IMPLE LINEAR EV MODEL WITH v/ -MIXING
More informationChapter 9 Jordan Block Matrices
Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.
More informationHard Core Predicates: How to encrypt? Recap
Hard Core Predcates: How to ecrypt? Debdeep Mukhopadhyay IIT Kharagpur Recap A ecrypto scheme s secured f for every probablstc adversary A carryg out some specfed kd of attack ad for every polyomal p(.),
More information#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES
#A27 INTEGERS 3 (203) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES Emrah Kılıç Mathematcs Departmet, TOBB Uversty of Ecoomcs ad Techology, Akara, Turkey eklc@etu.edu.tr Neşe Ömür Mathematcs Departmet,
More information2. Independence and Bernoulli Trials
. Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,
More informationNP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer
NP!= P By Lu Ra Table of Cotets. Itroduce 2. Strategy 3. Prelmary theorem 4. Proof 5. Expla 6. Cocluso. Itroduce The P vs. NP problem s a major usolved problem computer scece. Iformally, t asks whether
More informationUNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS
Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method
More informationPart 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))
art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the
More informationRuntime analysis RLS on OneMax. Heuristic Optimization
Lecture 6 Rutme aalyss RLS o OeMax trals of {,, },, l ( + ɛ) l ( ɛ)( ) l Algorthm Egeerg Group Hasso Platter Isttute, Uversty of Potsdam 9 May T, We wat to rgorously uderstad ths behavor 9 May / Rutme
More information1 Convergence of the Arnoldi method for eigenvalue problems
Lecture otes umercal lear algebra Arold method covergece Covergece of the Arold method for egevalue problems Recall that, uless t breaks dow, k steps of the Arold method geerates a orthogoal bass of a
More informationCHAPTER 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 informationFibonacci Identities as Binomial Sums
It. J. Cotemp. Math. Sceces, Vol. 7, 1, o. 38, 1871-1876 Fboacc Idettes as Bomal Sums Mohammad K. Azara Departmet of Mathematcs, Uversty of Evasvlle 18 Lcol Aveue, Evasvlle, IN 477, USA E-mal: azara@evasvlle.edu
More informationLINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 2006, #A12 LINEAR RECURRENT SEQUENCES AND POWERS OF A SQUARE MATRIX Hacèe Belbachr 1 USTHB, Departmet of Mathematcs, POBox 32 El Ala, 16111,
More information8.1 Hashing Algorithms
CS787: Advaced Algorthms Scrbe: Mayak Maheshwar, Chrs Hrchs Lecturer: Shuch Chawla Topc: Hashg ad NP-Completeess Date: September 21 2007 Prevously we looked at applcatos of radomzed algorthms, ad bega
More informationC-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory
ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?
More informationELEMENTARY PROBLEMS AND SOLUTIONS
ELEMENTARY PROBLEMS AND SOLUTIONS EDITED BY So L. BASIN, SYLVANIA ELECTRONIC SYSTEMS, MT. VIEW, CALIF. Sed all commucatos regardg Elemetary Problems Solutos to S e L 8 Bas, 946 Rose Ave., Redwood Cty,
More informationComputational Geometry
Problem efto omputatoal eometry hapter 6 Pot Locato Preprocess a plaar map S. ve a query pot p, report the face of S cotag p. oal: O()-sze data structure that eables O(log ) query tme. pplcato: Whch state
More information1 Onto functions and bijections Applications to Counting
1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of
More informationTHE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION
Joural of Scece ad Arts Year 12, No. 3(2), pp. 297-32, 212 ORIGINAL AER THE ROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION DOREL MIHET 1, CLAUDIA ZAHARIA 1 Mauscrpt receved: 3.6.212; Accepted
More informationLecture 07: Poles and Zeros
Lecture 07: Poles ad Zeros Defto of poles ad zeros The trasfer fucto provdes a bass for determg mportat system respose characterstcs wthout solvg the complete dfferetal equato. As defed, the trasfer fucto
More informationIntroduction to local (nonparametric) density estimation. methods
Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest
More informationChapter 4 Multiple Random Variables
Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:
More informationMu Sequences/Series Solutions National Convention 2014
Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed
More informationRademacher Complexity. Examples
Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed
More informationResearch Article Gauss-Lobatto Formulae and Extremal Problems
Hdaw Publshg Corporato Joural of Iequaltes ad Applcatos Volume 2008 Artcle ID 624989 0 pages do:055/2008/624989 Research Artcle Gauss-Lobatto Formulae ad Extremal Problems wth Polyomals Aa Mara Acu ad
More informationBayes (Naïve or not) Classifiers: Generative Approach
Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg
More informationComparison of Dual to Ratio-Cum-Product Estimators of Population Mean
Research Joural of Mathematcal ad Statstcal Sceces ISS 30 6047 Vol. 1(), 5-1, ovember (013) Res. J. Mathematcal ad Statstcal Sc. Comparso of Dual to Rato-Cum-Product Estmators of Populato Mea Abstract
More informationarxiv:math/ v1 [math.gm] 8 Dec 2005
arxv:math/05272v [math.gm] 8 Dec 2005 A GENERALIZATION OF AN INEQUALITY FROM IMO 2005 NIKOLAI NIKOLOV The preset paper was spred by the thrd problem from the IMO 2005. A specal award was gve to Yure Boreko
More information= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n
.. Soluto of Problem. M s obvously cotuous o ], [ ad ], [. Observe that M x,..., x ) M x,..., x ) )..) We ext show that M s odecreasg o ], [. Of course.) mles that M s odecreasg o ], [ as well. To show
More informationThe Occupancy and Coupon Collector problems
Chapter 4 The Occupacy ad Coupo Collector problems By Sarel Har-Peled, Jauary 9, 08 4 Prelmares [ Defto 4 Varace ad Stadard Devato For a radom varable X, let V E [ X [ µ X deote the varace of X, where
More informationBeam Warming Second-Order Upwind Method
Beam Warmg Secod-Order Upwd Method Petr Valeta Jauary 6, 015 Ths documet s a part of the assessmet work for the subject 1DRP Dfferetal Equatos o Computer lectured o FNSPE CTU Prague. Abstract Ths documet
More informationMarcinkiewicz strong laws for linear statistics of ρ -mixing sequences of random variables
Aas da Academa Braslera de Cêcas 2006 784: 65-62 Aals of the Brazla Academy of Sceces ISSN 000-3765 www.scelo.br/aabc Marckewcz strog laws for lear statstcs of ρ -mxg sequeces of radom varables GUANG-HUI
More information