DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
|
|
- Lester Webster
- 5 years ago
- Views:
Transcription
1 DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete -uiform hypergraph o vertices has a decompositio ito Hamilto Berge cycles. Here a Berge cycle cosists of a alteratig sequece v 1, e 1, v,..., v, e of distict vertices v i ad distict edges e i so that each e i cotais v i ad v i+1. So the divisibility coditio is clearly ecessary. I this ote, we prove that the cojecture holds wheever 4 ad 30. Our argumet is based o the Krusal-Katoa theorem. The case whe = 3 was already solved by Verrall, buildig o results of Bermod. 1. Itroductio A classical result of Waleci [1] states that the complete graph K o vertices has a Hamilto decompositio if ad oly if is odd. (A Hamilto decompositio of a graph G is a set of edge-disjoit Hamilto cycles cotaiig all edges of G. Aalogues of this result were proved for complete digraphs by Tillso [14] ad more recetly for (large touramets i [9]. Clearly, it is also atural to as for a hypergraph geeralisatio of Waleci s theorem. There are several otios of a hypergraph cycle, the earliest oe is due to Berge: A Berge cycle cosists of a alteratig sequece v 1, e 1, v,..., v, e of distict vertices v i ad distict edges e i so that each e i cotais v i ad v i+1. (Here v +1 := v 1 ad the edges e i are also allowed to cotai vertices outside {v 1,..., v }. A Berge cycle is a Hamilto (Berge cycle of a hypergraph G if {v 1,..., v } is the vertex set of G ad each e i is a edge of G. So a Hamilto Berge cycle has edges. Let K ( deote the complete -uiform hypergraph o vertices. Clearly, a ecessary coditio for the existece of a decompositio of K ( ito Hamilto Berge cycles is that divides (. Bermod, Germa, Heydema ad Sotteau [5] cojectured that this coditio is also sufficiet. For = 3, this cojecture follows by combiig the results of Bermod [4] ad Verrall [16]. We show that as log as is ot too small, the cojecture holds for 4 as well. Date: April 9, 014. The research leadig to these results was partially supported by the Europea Research Coucil uder the Europea Uio s Seveth Framewor Programme (FP/ / ERC Grat Agreemets o (D. Küh ad (D. Osthus. 1
2 DANIELA KÜHN AND DERYK OSTHUS Theorem 1. Suppose that 4 <, that 30 ad that divides (. The the complete -uiform hypergraph K ( o vertices has a decompositio ito Hamilto Berge cycles. Recetly, Peteci [13] cosidered a restricted type of decompositio ito Hamilto Berge cycles ad determied those for which K ( has such a restricted decompositio. Waleci s theorem has a atural extesio to the case whe is eve: i this case, oe ca show that K M has a Hamilto decompositio, wheever M is a perfect matchig. Similarly, the results of Bermod [4] ad Verrall [16] together imply that for all, either K (3 or K (3 M have a decompositio ito Hamilto Berge cycles. We prove a aalogue of this for 4. Note that Theorem immediately implies Theorem 1. Theorem. Let, N be such that 3 <. (i Suppose that 5 ad 0 or that = 4 ad 30. Let M be ay set cosistig of less tha edges of K ( such that divides E(K ( \ M. The K ( M has a decompositio ito Hamilto Berge cycles. (ii Suppose that = 3 ad 100. If ( 3 is ot divisible by, let M be ay perfect matchig i K (3, otherwise let M :=. The K (3 M has a decompositio ito Hamilto Berge cycles. Note that if is a prime ad ( is ot divisible by, the divides ad so i this case oe ca tae the set M i (i to be a uio of perfect matchigs. Also ote that (ii follows from the results of [4, 16]. However, our proof is far simpler, so we also iclude it i our argumet. Aother popular otio of a hypergraph cycle is the followig: a -uiform hypergraph C is a l-cycle if there exists a cyclic orderig of the vertices of C such that every edge of C cosists of cosecutive vertices ad such that every pair of cosecutive edges (i the atural orderig of the edges itersects i precisely l vertices. If l = 1, the C is called a tight cycle ad if l = 1, the C is called a loose cycle. We cojecture a aalogue of Theorem 1 for Hamilto l-cycles. Cojecture 3. For all, l N with l < there exists a iteger 0 such that the followig holds for all 0. Suppose that l divides ad that /( l divides ( (. The K has a decompositio ito Hamilto l-cycles. To see that the divisibility coditios are ecessary, ote that every Hamilto l-cycle cotais exactly /( l edges. Moreover, it is also worth otig the followig: cosider the umber N := l ( of cycles we require i the decompositio. The divisibility coditios esure that N is ot oly a iteger but also a multiple of f := ( l/h, where h is the highest commo factor of ad l. This is relevat as oe ca costruct a regular hypergraph from the edge-disjoit uio of t edge-disjoit Hamilto l-cycles if ad oly if t is a multiple of f.
3 DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO BERGE CYCLES 3 The tight case l = 1 of Cojecture 3 was already formulated by Bailey ad Steves [1]. I fact, if ad are coprime, the case l = 1 already correspods to a cojecture made idepedetly by Barayai [3] ad Katoa o so-called wreath decompositios. A -partite aalogue of the tight case of Cojecture 3 was recetly proved by Schroeder [15]. Cojecture 3 is ow to hold approximately (with some additioal divisibility coditios o, i.e. oe ca fid a set of edge-disjoit Hamilto l-cycles which together cover almost all the edges of K (. This is a very special case of results i [, 6, 7] which guaratee approximate decompositios of quasi-radom uiform hypergraphs ito Hamilto l-cycles (agai, the proofs eed to satisfy additioal divisibility costraits.. Proof of Theorem Before we ca prove Theorem we eed to itroduce some otatio. Give itegers 0, we will write [] ( for the set cosistig of all -elemet subsets of [] := {1,..., }. The colexicographic order o [] ( is the order i which A < B if ad oly if the largest elemet of (A B \ (A B lies i B (for all distict A, B [] (. The lexicographic order o [] ( is the order i which A < B if ad oly if the smallest elemet of (A B \ (A B lies i A. Give l N with l ad a set S [] (, the lth lower shadow of S is the set l (S cosistig of all those t []( l for which there exists s S with t s. Similarly, give l N with + l ad a set S [] (, the lth upper shadow of S is the set + l (S cosistig of all those t [](+l for which there exists s S with s t. Give s R ad N, we write ( s := s(s 1 (s +1!. We eed the followig cosequece of the Krusal-Katoa theorem [8, 10]. Lemma 4. (i Let, N be such that 3. Give a oempty S [] (, defie s R by S = ( s. The (S ( s. (ii Suppose that S [] ( ad let c, d N {0} be such that c <, d < (c + 1 ad S = c ( c+1 + d. If 100 ad c 8 the + 1 (S c ( c + d/5. (iii If S [] ( ad S 1 the + (S S ( ( S 1 + S ( S 1. Proof. The Krusal-Katoa theorem states that the size of the lower shadow of a set S [] ( is miimized if S is a iitial segmet of [] ( i the colexicographic order. (i is a special case of a weaer (quatitative versio of this due to Lovász [11]. I order to prove (ii ad (iii, ote that wheever A, B [] ( the A < B i the colexicographic order if ad oly if [] \ A < [] \ B i the lexicographic order o [] ( with the order of the groud set reversed. Thus, by cosiderig complemets, it follows from the Krusal-Katoa theorem that the size of the upper shadow of a set S [] ( is miimized if S is a iitial segmet of [] ( i the lexicographic order. This immediately implies (iii. Moreover, if
4 4 DANIELA KÜHN AND DERYK OSTHUS S, c ad d are as i (ii, the ( ( ( 1 c 1 + S ( c c + 5 d, as required. + d( c ( d We will also use the followig result of Tillso [14] o Hamilto decompositios of complete digraphs. (The complete digraph DK o vertices has a directed edge xy betwee every ordered pair x y of vertices. So E(DK = ( 1. Theorem 5. The complete digraph DK o vertices has a Hamilto decompositio if ad oly if 4, 6. We are ow ready to prove Theorem. The strategy of the proof is as follows. Suppose for simplicity that l := ( /(( 1 is a iteger. (So i particular, the set M i Theorem is empty. Defie a auxiliary bipartite graph G with vertex classes A ad B of size ( ( as follows. Let A := E(K. Let B cosist of the edges of l copies D 1,..., D l of the complete digraph DK o vertices. G cotais a edge betwee z A ad xy B if ad oly if {x, y} z. It is easy to see that if G has a perfect matchig F, the K ( has a decompositio ito Hamilto Berge cycles. Ideed, for each i [l], choose a Hamilto decompositio Hi 1,..., H 1 i of D i (which exists by Theorem 5. The for all i [l] ad j [ 1], the set of all those edges of K ( which are mapped via F to the edges of H j i forms a Hamilto Berge cycle, ad all these cycles are edge-disjoit, as required. To prove the existece of the perfect matchig F, we use the Krusal-Katoa theorem to show that G satisfies Hall s coditio. Proof of Theorem. The first part of the proof for (i ad (ii is idetical. So let M be as i (i,(ii. (For (ii ote that if ( 3 is ot divisible by, the 3 divides ad divides ( 3 3. Let ( ( M M l( 1 l := ad m :=. ( 1 Note that m < 1 ad m N {0} sice divides ( M. Defie a auxiliary (balaced bipartite graph G with vertex classes A ad B of size ( M as follows. Let A := E(K ( ad A := A \ M. Let D 1,..., D l be copies of the complete digraph DK o vertices. For each i [l] let B i, B i be a partitio of E(D i such that for every pair xy, yx of opposite directed edges, B i cotais precisely oe of xy, yx. Apply Theorem 5 to fid m edge-disjoit Hamilto cycles H 1,..., H m i DK. We view the sets B 1,..., B l, B 1,..., B l ad E(H 1,..., E(H m as beig pairwise disjoit ad let B deote the uio of these sets. So B = A. Our auxiliary bipartite graph G cotais a edge betwee z A ad xy B if ad oly if {x, y} z.
5 DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO BERGE CYCLES 5 We claim that G cotais a perfect matchig F. Before we prove this claim, let us show how it implies Theorem. For each i [l], apply Theorem 5 to obtai a Hamilto decompositio Hi 1,..., H 1 i of D i. For each i [l] ad each j [ 1] let A j i A be the eighbourhood of E(H j i i F. Note that each A j i is the edge set of a Hamilto Berge cycle of K ( M. Similarly, for each i [m] the eighbourhood A i of E(H i i F is the edge set of a Hamilto Berge cycle of K ( M. Sice all the sets A j i ad A i are pairwise disjoit, this gives a decompositio of K ( M ito Hamilto Berge cycles. Thus it remais to show that G satisfies Hall s coditio. So cosider ay oempty set S A ad defie s, a R with s ad 0 < a 1 by S = a ( ( = s. Defie b by NG (S B 1 = b (. Note that NG (S B 1 ( s by Lemma 4(i. But ( b s ( ( a s(s 1 (s + 1 ( ( ( s ( ( 1 ( + 1 s = 1, ad so b a /. Thus ( N G (S l N G (S B 1 la / = a / ( B E(H 1 E(H m a / ( A (. Let g := ( A + ( (. So if (1 a 1 / A ( ( ( = 1 g, the N G (S S. We ow distiguish three cases. Case Sice (( ( ( A ( 1 A A ( = (1 g (1 g, i this case (1 implies that N G (S S if S A ( 1. So suppose that S > A ( 1. Note that if 5 the every b B satisfies ( ( 5 6 N G (b M ( ( 1 sice + 3 ad 0. Hece N G (S = B.
6 6 DANIELA KÜHN AND DERYK OSTHUS So we may assume that = 4 ad S := B \N G (S. Thus S 1 := S B 1 ad l S (l + S 1. Note that N G(S 1 A \ S < ( 1. First suppose S 1 7. The ( 8 N G (S ( 8 M 7 ( > ( 1 by Lemma 4(iii ad our assumptio that 30. So we may assume that S 1 6. Apply Lemma 4(iii agai to see that ( ( 7 7 N G (S S 1 6( 7( 8 M l + S ( ( S S > S. (Here we use that 30 implies S l ( ( 3/4 4 > ad 6( 7( 8 ( (( ( 3/4. Thus N G (S S, as required. Case. = 3 Sice (( ( ( A 3( 1 A A 3( = (1 3g (1 g 3, i this case (1 implies that N G (S S if S A 3( 1. So suppose that S > A 3( 1 ad that S := B \ N G (S. Thus S 1 := S B 1 ad S (l + S 1 (( /3 + S 1. Let c, d N {0} be such that c <, d < (c+1 ad S 1 = c ( c+1 +d. Note that NG (S 1 A \S < 3( 1. Thus c < 8 sice otherwise ( ( 8 8 N G (S 1 8 M 8 3 > 3 ( > 3( 1 5 by Lemma 4(ii ad our assumptio that 100. (Here we use that ( 8 ( = ( ( Let M(S 1 deote the set of all those edges e M for which there is a pair xy S 1 with {x, y} e. Thus M(S 1 = + 1 (S 1 M. Recall that M is a matchig i the case whe = 3. Thus M(S 1 S 1. I particular M(S 1 d if c = 0. Apply Lemma 4(ii agai to see that ( c N G (S N G (S 1 c + 5 d M(S 1 4c ( { d /3 if c 1 d if c = 0 (c + d ( S S, 3
7 DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO BERGE CYCLES 7 where we use that 100. (To see the fourth iequality, ote that if c 1 the ( 4c 5 3 4c ( 5 c 5 = 1c ( 10 3, whereas if c = 0 the d 5 d 11d Thus N G (S S, as required. Case 3. 1 If = 1 the K ( itself is a Hamilto Berge cycle, so there is othig to show. So suppose that =. I this case, it helps to be more careful with the choice of the Hamilto cycles H 1,..., H m : istead of applyig Theorem 5 to fid m edge-disjoit Hamilto cycles H 1,..., H m i DK, we proceed slightly differetly. Note first that l = 0. Suppose that is odd. The M = ad m = ( 1/. If is eve, the M = / ad m = / 1. I both cases we ca choose H 1,..., H m to be m edge-disjoit Hamilto cycles of K. The a perfect matchig i our auxiliary graph G still correspods to a decompositio of K ( M ito Hamilto Berge cycles. Also, i both cases E(H 1 E(H m cotais all but at most / distict elemets of [] (. Note that ( ( ( ( = ( ( 1 5 ( sice 0. Cosider ay b B. The ( ( N G (b M = Now cosider ay a A. The ( N G (a ( = M ( 3 ( 3 A. ( ( 3 3 B. So Hall s coditio is satisfied ad so G has a perfect matchig, as required. The lower bouds o have bee chose so as to streamlie the calculatios, ad could be improved by more careful calculatios. Refereces [1] R. Bailey ad B. Steves, Hamiltoia decompositios of complete -uiform hypergraphs, Discrete Math. 310 (010, [] D. Bal ad A. Frieze, Pacig tight Hamilto cycles i uiform hypergraphs, SIAM J. Discrete Math. 6 (01, [3] Zs. Barayai, The edge-colorig of complete hypergraphs I, J. Combi. Theory B 6 (1979, [4] J.C. Bermod. Hamiltoia decompositios of graphs, directed graphs ad hypergraphs, A. Discrete Math. 3 (1978, 1 8. [5] J.C. Bermod, A. Germa, M.C. Heydema, ad D. Sotteau, Hypergraphes hamiltoies, i Problèmes combiatoires et théorie des graphes (Colloq. Iterat. CNRS, Uiv. Orsay, Orsay, 1976, vol 60 of Colloq. Iterat. CNRS, Paris (1973, [6] A. Frieze ad M. Krivelevich, Pacig Hamilto cycles i radom ad pseudo-radom hypergraphs. Radom Structures ad Algorithms 41 (01, 1. [7] A. Frieze, M. Krivelevich ad P.-S. Loh, Pacig tight Hamilto cycles i 3-uiform hypergraphs, Radom Structures ad Algorithms 40 (01,
8 8 DANIELA KÜHN AND DERYK OSTHUS [8] G.O.H. Katoa, A theorem of fiite sets, i: Theory of Graphs, P. Erdős, G.O.H. Katoa Eds., Academic Press, New Yor, [9] D. Küh ad D. Osthus, Hamilto decompositios of regular expaders: a proof of Kelly s cojecture for large touramets, Adv. i Math. 37 (013, [10] J.B. Krusal, The umber of simplices i a complex, i: Mathematical Optimizatio Techiques, R. Bellma Ed., Uiversity of Califoria Press, Bereley, [11] L. Lovász, Combiatorial Problems ad Exercises, North-Hollad, Amsterdam, [1] E. Lucas, Récréatios Mathématiques, Vol., Gautheir-Villars, 189. [13] P. Peteci, O cyclic Hamiltoia decompositios of complete -uiform hypergraphs, Discrete Math. 35 (014, [14] T.W. Tillso, A Hamiltoia decompositio of K m, m 8, J. Combi. Theory B 9 (1980, [15] M.W. Schroeder, O Hamilto cycle decompositios of r-uiform r-partite hypergraphs, Discrete Math (014, 1 8. [16] H. Verrall, Hamilto decompositios of complete 3-uiform hypergraphs, Discrete Math. 13 (1994, Daiela Küh, Dery Osthus School of Mathematics Uiversity of Birmigham Edgbasto Birmigham B15 TT UK addresses: {d.uh,d.osthus}@bham.ac.u
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES
DECOMPOSITIONS OF COMPLETE UNIFORM HYPERGRAPHS INTO HAMILTON BERGE CYCLES DANIELA KÜHN AND DERYK OSTHUS Abstract. I 1973 Bermod, Germa, Heydema ad Sotteau cojectured that if divides (, the the complete
More information# fixed points of g. Tree to string. Repeatedly select the leaf with the smallest label, write down the label of its neighbour and remove the leaf.
Combiatorics Graph Theory Coutig labelled ad ulabelled graphs There are 2 ( 2) labelled graphs of order. The ulabelled graphs of order correspod to orbits of the actio of S o the set of labelled graphs.
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 informationarxiv: v3 [math.co] 6 Aug 2014
NEAR PERFECT MATCHINGS IN -UNIFORM HYPERGRAPHS arxiv:1404.1136v3 [math.co] 6 Aug 2014 JIE HAN Abstract. Let H be a -uiform hypergraph o vertices where is a sufficietly large iteger ot divisible by. We
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 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 informationEdge Disjoint Hamilton Cycles
Edge Disjoit Hamilto Cycles April 26, 2015 1 Itroductio l +l l +c I the late 70s, it was show by Komlós ad Szemerédi ([7]) that for p =, the limit probability for G(, p) to cotai a Hamilto cycle equals
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 informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
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 informationProduct measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.
Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset 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 4400/6400 Homework #7 solutions
MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH
More informationDense H-free graphs are almost (χ(h) 1)-partite
Dese H-free graphs are almost χh) 1)-partite Peter Alle arxiv:0907.815v1 [math.co] 22 Jul 2009 July 22, 2009 Abstract By usig the Szemerédi Regularity Lemma [9], Alo ad Sudakov [1] recetly exteded the
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
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 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 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 informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
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 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 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 informationw (1) ˆx w (1) x (1) /ρ and w (2) ˆx w (2) x (2) /ρ.
2 5. Weighted umber of late jobs 5.1. Release dates ad due dates: maximimizig the weight of o-time jobs Oce we add release dates, miimizig the umber of late jobs becomes a sigificatly harder problem. For
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationAlmost intersecting families of sets
Almost itersectig families of sets Dáiel Gerber a Natha Lemos b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hugaria Academy of Scieces, Alfréd Réyi Istitute of Mathematics, P.O.B. 17, Budapest H-1364,
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 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 informationBertrand s Postulate
Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a
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 informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
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 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 informationMathematical Induction
Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a
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 informationThe poset on connected graphs is Sperner
The poset o coected graphs is Sperer Stephe GZ Smith Istvá Tomo February 9, 017 Abstract Let C be the set of all coected graphs o vertex set [] The C is edowed with the followig atural partial orderig:
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
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 informationA Hypergraph Extension. Bipartite Turán Problem
A Hypergraph Extesio of the Bipartite Turá Problem Dhruv Mubayi 1 Jacques Verstraëte Abstract. Let t, be itegers with t. For t, we prove that i ay family of at least t 4( ) triples from a -elemet set X,
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationThe Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.
Lecture 7: Measure ad Category The Borel hierarchy classifies subsets of the reals by their topological complexity. Aother approach is to classify them by size. Filters ad Ideals The most commo measure
More informationLet us consider the following problem to warm up towards a more general statement.
Lecture 4: Sequeces with repetitios, distributig idetical objects amog distict parties, the biomial theorem, ad some properties of biomial coefficiets Refereces: Relevat parts of chapter 15 of the Math
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 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 informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
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 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 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 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 informationConnected Balanced Subgraphs in Random Regular Multigraphs Under the Configuration Model
Coected Balaced Subgraphs i Radom Regular Multigraphs Uder the Cofiguratio Model Liyua Lu Austi Mohr László Székely Departmet of Mathematics Uiversity of South Carolia 1523 Greee Street, Columbia, SC 29208
More information6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.
6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio
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 informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
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 informationFast Strategies In Maker-Breaker Games Played on Random Boards
Fast Strategies I Maker-Breaker Games Played o Radom Boards Deis Clemes Asaf Ferber Michael Krivelevich Aita Liebeau March 15, 2012 Abstract I this paper we aalyze classical Maker-Breaker games played
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationSolution. 1 Solutions of Homework 1. Sangchul Lee. October 27, Problem 1.1
Solutio Sagchul Lee October 7, 017 1 Solutios of Homework 1 Problem 1.1 Let Ω,F,P) be a probability space. Show that if {A : N} F such that A := lim A exists, the PA) = lim PA ). Proof. Usig the cotiuity
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 information2.4 Sequences, Sequences of Sets
72 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.4 Sequeces, Sequeces of Sets 2.4.1 Sequeces Defiitio 2.4.1 (sequece Let S R. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For each
More informationOn Algorithm for the Minimum Spanning Trees Problem with Diameter Bounded Below
O Algorithm for the Miimum Spaig Trees Problem with Diameter Bouded Below Edward Kh. Gimadi 1,2, Alexey M. Istomi 1, ad Ekateria Yu. Shi 2 1 Sobolev Istitute of Mathematics, 4 Acad. Koptyug aveue, 630090
More informationLecture 2 Long paths in random graphs
Lecture Log paths i radom graphs 1 Itroductio I this lecture we treat the appearace of log paths ad cycles i sparse radom graphs. will wor with the probability space G(, p) of biomial radom graphs, aalogous
More informationDavenport-Schinzel Sequences and their Geometric Applications
Advaced Computatioal Geometry Sprig 2004 Daveport-Schizel Sequeces ad their Geometric Applicatios Prof. Joseph Mitchell Scribe: Mohit Gupta 1 Overview I this lecture, we itroduce the cocept of Daveport-Schizel
More informationIndependence number of graphs with a prescribed number of cliques
Idepedece umber of graphs with a prescribed umber of cliques Tom Bohma Dhruv Mubayi Abstract We cosider the followig problem posed by Erdős i 1962. Suppose that G is a -vertex graph where the umber of
More informationsin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =
60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece
More informationA note on log-concave random graphs
A ote o log-cocave radom graphs Ala Frieze ad Tomasz Tocz Departmet of Mathematical Scieces, Caregie Mello Uiversity, Pittsburgh PA53, USA Jue, 08 Abstract We establish a threshold for the coectivity of
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 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 informationOn Some Properties of Digital Roots
Advaces i Pure Mathematics, 04, 4, 95-30 Published Olie Jue 04 i SciRes. http://www.scirp.org/joural/apm http://dx.doi.org/0.436/apm.04.46039 O Some Properties of Digital Roots Ilha M. Izmirli Departmet
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationBiased Games On Random Boards
Biased Games O Radom Boards Asaf Ferber Roma Glebov Michael Krivelevich Alo Naor September 6, 2013 Abstract I this paper we aalyze biased Maker-Breaker games ad Avoider-Eforcer games, both played o the
More informationREAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS
REAL ANALYSIS II: PROBLEM SET 1 - SOLUTIONS 18th Feb, 016 Defiitio (Lipschitz fuctio). A fuctio f : R R is said to be Lipschitz if there exists a positive real umber c such that for ay x, y i the domai
More informationAlliance Partition Number in Graphs
Alliace Partitio Number i Graphs Lida Eroh Departmet of Mathematics Uiversity of Wiscosi Oshkosh, Oshkosh, WI email: eroh@uwoshedu, phoe: (90)44-7343 ad Ralucca Gera Departmet of Applied Mathematics Naval
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
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 informationMaximal sets of integers not containing k + 1 pairwise coprimes and having divisors from a specified set of primes
EuroComb 2005 DMTCS proc. AE, 2005, 335 340 Maximal sets of itegers ot cotaiig k + 1 pairwise coprimes ad havig divisors from a specified set of primes Vladimir Bliovsky 1 Bielefeld Uiversity, Math. Dept.,
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More informationWeight Distribution in Matching Games
Faculty of Electrical Egieerig, Mathematics & Computer Sciece Weight Distributio i Matchig Games Frits Hof Idividual research assigmet for course program Oderzoek va wiskude i master Sciece Educatio ad
More informationTHE LONELY RUNNER PROBLEM FOR MANY RUNNERS. Artūras Dubickas Vilnius University, Lithuania
GLASNIK MATEMATIČKI Vol. 46(66)(2011), 25 30 THE LONELY RUNNER PROBLEM FOR MANY RUNNERS Artūras Dubickas Vilius Uiversity, Lithuaia Abstract. The loely ruer cojecture asserts that for ay positive iteger
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 informationPacking, Counting and Covering Hamilton cycles in random directed graphs
Packig, Coutig ad Coverig Hamilto cycles i radom directed graphs Asaf Ferber Gal Kroeberg Eoi Log Jue 1, 2015 Abstract A Hamilto cycle i a digraph is a cycle passes through all the vertices, where all
More informationEDGE-COLORINGS AVOIDING RAINBOW STARS
EDGE-COLORINGS AVOIDING RAINBOW STARS CARLOS HOPPEN, HANNO LEFMANN, KNUT ODERMANN, AND JULIANA SANCHES Abstract. We cosider a extremal problem motivated by a paper of Balogh [J. Balogh, A remark o the
More informationGeneralized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices
Geeralized Reed-Solomo Codes with Sparsest ad Balaced Geerator Matrices Wetu Sog ad Kui Cai Sigapore Uiversity of Techology ad Desig, Sigapore Email: {wetu sog, cai kui}@sutd.edu.sg arxiv:1801.02315v1
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 informationHoggatt and King [lo] defined a complete sequence of natural numbers
REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies
More informationAnother diametric theorem in Hamming spaces: optimal group anticodes
Aother diametric theorem i Hammig spaces: optimal group aticodes Rudolf Ahlswede Departmet of Mathematics Uiversity of Bielefeld POB 003, D-3350 Bielefeld, Germay Email: ahlswede@math.ui-bielefeld.de Abstract
More informationChapter IV Integration Theory
Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where
More informationRademacher Complexity
EECS 598: Statistical Learig Theory, Witer 204 Topic 0 Rademacher Complexity Lecturer: Clayto Scott Scribe: Ya Deg, Kevi Moo Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved for
More informationCitation for the original published paper (version of record): N.B. When citing this work, cite the original published paper.
http://www.diva-portal.org This is the published versio of a paper published i The Electroic Joural of Combiatorics. Citatio for the origial published paper (versio of record: Falgas-Ravry, V., Lo, A.
More informationResolution Proofs of Generalized Pigeonhole Principles
Resolutio Proofs of Geeralized Pigeohole Priciples Samuel R. Buss Departmet of Mathematics Uiversity of Califoria, Berkeley Győrgy Turá Departmet of Mathematics, Statistics, ad Computer Sciece Uiversity
More informationSimple Polygons of Maximum Perimeter Contained in a Unit Disk
Discrete Comput Geom (009) 1: 08 15 DOI 10.1007/s005-008-9093-7 Simple Polygos of Maximum Perimeter Cotaied i a Uit Disk Charles Audet Pierre Hase Frédéric Messie Received: 18 September 007 / Revised:
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationMath 104: Homework 2 solutions
Math 04: Homework solutios. A (0, ): Sice this is a ope iterval, the miimum is udefied, ad sice the set is ot bouded above, the maximum is also udefied. if A 0 ad sup A. B { m + : m, N}: This set does
More information