INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
|
|
- Dortha Kelley
- 5 years ago
- Views:
Transcription
1 INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS By P. ERD0S, CHAO KO (Szechuan), and R. RADO {Reading) [Received 13 August 1961] 1. Introduction E. SPEBJOBIB (1) has proved that every system of subsets a v of a set of finite cardinal m, such that a^ < a y for p. ^ v contains at most I I elements, where p = [$ro]. This note concerns analogues of this result. We shall impose an upper limitation on the cardinals of the a v and a lower limitation on the cardinals of the intersection of any two sets a v, and we shall deduce upper estimates, in many cases best-possible, for the number of elements of such a system of sets a v. 2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. Iffc^ I, then [k, I) denotes the set {k,k+l,k+2,...,l-l} = {*:fc < «< Q. The obliteration operator " serves to remove from any system of elements the element above which it is placed. Thus [k,i) = {k,k-{-l,...,fy. The cardinal of o is \a\\ inclusion (in the wide sense), union, difference, and intersection of sets are denoted by o c b, a-\-b, a b, ab respectively, and a b = a ab for all a, b. By 8(k,l,m) we denote the set of all systems (a o,a v...,d n ) such that a v c[0,m); \a v \ ^1 (v <»), 3. Results THEOBEM 1. // 1 < I < \m; (a o,...,d n ) e S(l,l,m), If, in addition, \a v \ < I for some v, then n < I I. THBOBBM 2. Let k < I < m, n > 2, (a o,...,d n ) e S{k, I, m). Suppose that either o» ^-? i i 7 / ^ - \ /i\ 21 ^ fc+m, \a v \ = I (v < n) (1) orf 21 «g 1+m, \a v \^l (v <»). (2) t The condition \ay\ sg I ia in fact implied by (a,,..., A K ) 6 S{k, I, m). Quart. J. Math. Oxford (3), 12 (1961),
2 314 P. ERDOS, CHAO KO, AND R. RADO Then (a) either (i) \a o...d n \ >k, n ( * ) or (ii) a o...tf n < k < I < TO, n then n fc. Obviously, if a v = I for v < ra, then the upper estimates for n in Theorem 1 and in Theorem 2 (a) (i) and (6) are best-possible. For, if k ^ I <C m and if a 0,..., d n are the distinct sets a such that then [O,i)coc[0,m), (a o,...,d n )e8(k,l,m), o =Z, (m-k\ 4. The following lemma i8 due to Spemer (1). We give the proof since it is extremely short. LEMMA. // n 0 Js 1, a v c [0, m), o,, = l 0 (v < n 0 ), ia«7i iaere are oftow<n o (m l o ){l o + l)~ l sets b such that, for some v, v<n 0, a v cbc[0,m), 6 = Z 0 +l. (3) Proof. Let 74 be the number of sets b denned above. Then, by counting in two different ways the number of pairs (v, b) satisfying (3), we obtain ^(m 1 0 ) ^ n^-fl), which proves the lemma. 5. Proof of Theorem 1 Case 1. Let \a v \ = I (v < n). We have m ^ 2. If m = 2, then 1=1; n = 1 ^ I I. Now let m ^ 3 and use induction over m. Choose, for fixed I, m, n, the a, in such a way that the hypothesis holds and, in addition, the number f(a o,...,d n ) = s Q +...+S n is minimal, where 8 V is the sum of the elements of a v. Put A = {a v : v < n}. If 21 =TO, then [0, m) a v $ A and, hence Now let 21 < TO.. 1/TO\ /TO-1\
3 ON INTERSECTION THEOREMS 316 Case 1 o. Suppose that whenever m leaea, Ae[0,m) o, then a {TO 1}+{A} 6 A. We may assume that, for some n 0 < n, ffl-leo, (v<n 0 ), TO l^a, (n 0 < v < n). Put 6, = a v {TO 1} (v < n 0 ). Let /i < v < TI 0. Then and there is A e [0, m) a /i a p. Then 6 M +{A} e 4, 6^6, = ( and therefore Since 2(t 1) < m 2 <TO 1 we obtain, by the induction hypothesis, n. (m 2\ o..,, ^ 9 )" Similarly, smce l we have n n 0 < (^ ). Thus Case 1 b. Suppose that there are ae A, A e [0, TO) a such that TO lea, Then A <TO 1. We may assume that a {m l}-\-{x}$a. TO lea,, X$a v, b v = a v {TO 1}+{A} $A (V < n 0 ), TO leo r, A^a,,, c r = a v {TO l}+{a}e^l (n 0 < v < 74), TO lea,, Aea ( (74 < v < 74), m l$a v (n t^.v<n). Here I^TIO^TIJ^TI^^TI. Put b v = a K (TI 0 ^ v < 71). We now show that (i, J,)6«(1,U). (4) Let ft < v <TO. We have to prove that ^ * &, b^b y # 0. (5) If/A<v<7i t) or7i 0^/i<v, then (5) clearly holds. Now let \t <ra 0 ^ v. Then 6^ ^ ^4, b v = a v e A, and hence 6 M 9^ b v. If n 0 < v < T^, then c p e-4, and there is a e a^c,,. Then a = A, u^m-1, and aeb^b y. If 7^ ^ v < Tig, then A e 6^fe F. K, finally, 7ij, ^ v < n, then there is
4 316 P. ERDOS, CHAO KO, AND R. BADO p e a h a v. Then psa v, P < TO 1, peb^by. This proves (5) and therefore (4). However, we have f(b o,...,k)-f{<h,-,&n) = no(-[m-l]+a) < 0, which contradicts the minimum property of (a 0,..., d n ). This shows that Case 1 b cannot occur. Case 2: min(v < n) \a v \ l 0 < I. If l 0 = I, then we have Case 1. Now let l 0 <l and use induction over I 1 0. We may assume that l«,l = h (" < «o). I«KI > 'o K < * <»), (6) where 1 ^Zn 0 ^Ln. Let 6 0,..., i ni be the distinct sets b such that (3) holds for some v. Then (»i-g < 2(l-l)+l-m < 0, (7) and hence, by the lemma, n^ ^ TI^. Also, Hence, from our induction hypothesis, and Theorem 1 follows. 6. Proof of Theorem 2 Cast 1: k = 0. Then n < ^+(71-71,,) < (^^ V Now (a) (ii) is impossible, and (a) (i) is identical with (b), so that all we have to prove is that»^ l 0 < I, 1 3%: n Q ^ n. If l 0 = I then \a v \ = 1 (v < n), n < rm., Again, we may assume (6), where Now let l 0 < I and use induction over Z Z o. Let 6 0,..., 6 ni be the distinct sets b such that (3) holds for some v. Again (7) holds and, by the lemma, n 0. We have (b o,...,f> ni,a nt,...,d n )es(o,l,m) and, by our induction hypothesis, This proves the assertion.
5 ON INTERSECTION THEOREMS 317 Case 2: k > 0. We separate this into two cases. Case 2 a. Suppose that (1) holds. Put a o...< n = r. We now show that, if r ^ k, then (i) follows. We may assume that a o...d n = [m r,m). Put a^o.m r) = c F (v < n). Th6n (c o,...,e n )es(o,l-r,m-r), 2(l r) (m r) = 2l r m < 21 k m < 0. Hence, by Case 1, k\ ) so that (i) holds. We now Buppose that (i) is false, and we deduce (ii). We k^6 a o...<j n = r < k < \a oai \ < a o < I, and therefore 21 ^ k-\-m < Z+m, A; < I < m. There is a maximal number p ^ n such that there exist ^ " sets a n,..., d p satisfying (ao>... f4p)es(t, I>m ). (8) Put A' = {a r : v < p). We assert that (a o,...,d p )t8(k+l,l,m). (9) For otherwise la^a^l > k (^ < v < n). Let a e A'. Then we can choose o' c [0,TO)such that \a'\ = l, \aa'\ = l-l. Then, for every b e A', we have \a'b\ ^ a6 -l > fc and hence, since p is maximal, a' e A'. By repeated application of this result we find that [0,1), [m-l,m) ea', k < \[0,l)[m-l,m)\ = l-(m-l) < k, which is the desired contradiction. This proves (9), and hence there are sets a, b e A' such that \ab\ = k. Since a o...<j p < K--^nl < *> there is c e A' such that \abc\ < k. Denote by T the set of all triples (x, y, z) such that x ca,y c b, z c c, a;[ = \y \ = \z \ = k, \x-\-y-\-z <: I. Put <f>(x,y,z) = {d: x+y+z cde A'}. Then, by (8), A' = ^{(x,y,z)et)4,(x,y,z). If (x,y,z) e T and s = z+y+z, then s > k since otherwise we obtain the contradiction k > \abc\ > xt/z = z = k.
6 318 P. ERDOS, CHAO KO, AND R. RADO Hence m k 1\ (m k 1 m-l which proves (ii). Case 2b. Suppose that (2) holds. We may assume (6), where l 0 < I; 1 < *&o ^ n. If l 0 = I, then Case 2 a applies. Now let l Q < I and use induction over I 1 0. Let b 0,..., h nj be the distinct sets b satisfying, for some v, the relations (3). Then (7) holdb and hence, by the lemma, rij ^ n 0. Also, since l 0 < I < m, so that m i 0 > 2, we have, by definition of the bp, K-K = Oo-dn.. \b o...h ni a w..d n \ = \a o...d n \ < k. Since (J, ^v-^j^ftu), it follows from our induction hypothesis that It remains to prove (b) in Case 2. If k = I, then (b) is trivial. If ( 7\3, then */ (m-k\ _ (m-k-l\m- -k-l\m-k /m-k-l\(iy \l-k) -\l-k-l)lso that (b) follows from (a). This completes the proof of Theorem ) )[) Concluding remarks (i) In Theorem 2 (b) the condition m ^ k+(l-kfy, though certainly not best-possible, cannot be omitted. It is possible for (a o,...,d n ) e S(k,l,m), k ^ l ^ m to hold and, at the same time, n > I I. This is shown by the following example due to S. H. Min and kindly communicated to the authors. Let a^,..., d n be the distinct sets a such that ac[0,8), a = 4, o[0,4) = 3. Then n = 16, K,...,^) G 5(2,4,8), h~ \ = Q = 15 < n.
7 ON INTERSECTION THEOREMS 31» A more general example is the following. Let r > 0 and denote by o 0,..., d n the distinct sets a such that Then and we have ac[0,4r), a = 2r, a[0, 2r) > r. (a o,...,ci n )es(2,2r > 4r), and, for every large r, possibly for every r > 2, we have I I < n. \ t «/ We put forward the conjecture that, for our special values of k, I, m, this represents a case with maximal n, i.e. // r>0, (a Q,...,d n )es(2,2r,4r),,, l/4r\ l/2r\ B then n < - 2\r) (ii) K in the definition of ^2\2J 8(1, l,m) 2 in \ ) 2, the condition a h <. a v $. a^ is replaced by a^ = a y and if no restriction is placed upon \a y \, then the problem of estimating n becomes trivial, and we have the result: Let m > 0 and a y c [0,TO)for v < n, and a^ = a y, a )i a y = 0 for fi <L v < n. Then n ^ 2 m ~ 1, and there are 2 m ~ 1 n subsets a n,..., d^-i of [0, m) such that a^ ^= a v, a fi a y ^ 0 for p < v < 2 m ~ 1. To prove this we note that of two sets which are complementary in [0,TO) at most one occurs among a 0,..., d n, and, if n < 2 m ~ 1, then there is a pair of complementary sets a, b neither of which occurs among a 0,..., d n. It follows that at least one of a, 6 intersects every a v, so that this set can be taken as a n. and (iii) Let I > 3, 21 <TO, and suppose that a H 7^ ar> a r c [0,TO), \a r \ = 1 for v < n, a fi. a v 7^ 0 f r M < v < n > an( l tt o...(i n = 0. We conjecture that the maximum value of n for which such sets o r can be found is n 0, where /TO 3\
8 320 ON INTERSECTION THEOREMS A system of n 0 sets with the required properties is obtained by taking all sets o such that ac[0,m), o[0,3) >2, \a\ = I. (iv) The following problem may be of interest. Let k < m. Determine the largest number n such that there is a system of n sets a r satisfying the conditions If m-\-k is even, then the system consisting of the a such that ac[0,m), o >l(m+t) has the required properties. We suspect that this system contains the maximum possible number of sets for fixed m and k such that m-\-k is even. (v) If in (ii) the condition a^a v^a (ji < v < n) is replaced by a n a r a P # 0 (JJ- < v < p < n), then the structure of the system a v is largely determined by the result: Let m ^ 2, & c [0, m) /or v < n, a^ = a, for /x < v < n, and a ti a v a P # 0 /of /x < v < p < n. TAen TI ^ 2" 1-1, owd, t/ n = 2 1 "- 1, iaen o 0 a^..a n = 0, so that the a v are au, 2-1 sets a c [0, m) which contain some fixed number t (t < m). For there is a largest p (I ^Z p ^.n) such that If p = n, then a o...(2 n = a r = 0 for some v < n. K ^> < n, then any two of the n+1 distinct sets have a non-empty intersection and hence, by (ii), n+1 ^ 2-1. Different proofs of (v) have been found by L. P6sa, G. Haj6s, G. Pollak, and M. Simonovits. REFERENCE 1. E. Spemer, Math. Z. 27 (1928)
Non-trivial intersecting uniform sub-families of hereditary families
Non-trivial intersecting uniform sub-families of hereditary families Peter Borg Department of Mathematics, University of Malta, Msida MSD 2080, Malta p.borg.02@cantab.net April 4, 2013 Abstract For a family
More information1 The Erdős Ko Rado Theorem
1 The Erdős Ko Rado Theorem A family of subsets of a set is intersecting if any two elements of the family have at least one element in common It is easy to find small intersecting families; the basic
More informationA Hilton-Milner-type theorem and an intersection conjecture for signed sets
A Hilton-Milner-type theorem and an intersection conjecture for signed sets Peter Borg Department of Mathematics, University of Malta Msida MSD 2080, Malta p.borg.02@cantab.net Abstract A family A of sets
More informationThe Intersection Theorem for Direct Products
Europ. J. Combinatorics 1998 19, 649 661 Article No. ej9803 The Intersection Theorem for Direct Products R. AHLSWEDE, H.AYDINIAN AND L. H. KHACHATRIAN c 1998 Academic Press 1. INTRODUCTION Before we state
More informationMinimal Paths and Cycles in Set Systems
Minimal Paths and Cycles in Set Systems Dhruv Mubayi Jacques Verstraëte July 9, 006 Abstract A minimal k-cycle is a family of sets A 0,..., A k 1 for which A i A j if and only if i = j or i and j are consecutive
More informationA diametric theorem for edges. R. Ahlswede and L.H. Khachatrian
A diametric theorem for edges R. Ahlswede and L.H. Khachatrian 1 1 Introduction Whereas there are vertex and edge isoperimetric theorems it went unsaid that diametric theorems are vertex diametric theorems.
More informationON THE ERDOS-STONE THEOREM
ON THE ERDOS-STONE THEOREM V. CHVATAL AND E. SZEMEREDI In 1946, Erdos and Stone [3] proved that every graph with n vertices and at least edges contains a large K d+l (t), a complete (d + l)-partite graph
More informationCocliques in the Kneser graph on line-plane flags in PG(4, q)
Cocliques in the Kneser graph on line-plane flags in PG(4, q) A. Blokhuis & A. E. Brouwer Abstract We determine the independence number of the Kneser graph on line-plane flags in the projective space PG(4,
More informationLINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday
LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationMTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics
MTH 309 Supplemental Lecture Notes Based on Robert Messer, Linear Algebra Gateway to Mathematics Ulrich Meierfrankenfeld Department of Mathematics Michigan State University East Lansing MI 48824 meier@math.msu.edu
More informationCross-Intersecting Sets of Vectors
Cross-Intersecting Sets of Vectors János Pach Gábor Tardos Abstract Given a sequence of positive integers p = (p 1,..., p n ), let S p denote the set of all sequences of positive integers x = (x 1,...,
More informationj* v sji[* n sj $ (r\a]'sa(:\*{, EL u (s\*) = \ 8, Let x f (A\B) U B\A). Then x f A\l3 or x E B\A. If
Chapter 0 PRELIMINARIES \ This chapter contains the basic material on sets, functions, relations and induction, as well as the syater of real numbers. Your students may have seen a good share of this material
More informationMaximal Symmetric Difference-Free Families of Subsets of [n]
arxiv:1010.2711v1 [math.co] 13 Oct 2010 Maximal Symmetric Difference-Free Families of Subsets of [n] Travis G. Buck and Anant P. Godbole Department of Mathematics and Statistics East Tennessee State University
More informationIDEAL CLASSES AND RELATIVE INTEGERS
IDEAL CLASSES AND RELATIVE INTEGERS KEITH CONRAD The ring of integers of a number field is free as a Z-module. It is a module not just over Z, but also over any intermediate ring of integers. That is,
More informationKatarzyna Mieczkowska
Katarzyna Mieczkowska Uniwersytet A. Mickiewicza w Poznaniu Erdős conjecture on matchings in hypergraphs Praca semestralna nr 1 (semestr letni 010/11 Opiekun pracy: Tomasz Łuczak ERDŐS CONJECTURE ON MATCHINGS
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationMONOCHROMATIC VS. MULTICOLORED PATHS. Hanno Lefmann* Department of Mathematics and Computer Science Emory University. Atlanta, Georgia 30332, USA
MONOCHROMATIC VS. MULTICOLORED PATHS Hanno Lefmann* Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30322, USA and School of Mathematics Georgia Institute of Technology
More informationSolutions of APMO 2016
Solutions of APMO 016 Problem 1. We say that a triangle ABC is great if the following holds: for any point D on the side BC, if P and Q are the feet of the perpendiculars from D to the lines AB and AC,
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationForbidding complete hypergraphs as traces
Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics
More informationSequences of height 1 primes in Z[X]
Sequences of height 1 primes in Z[X] Stephen McAdam Department of Mathematics University of Texas Austin TX 78712 mcadam@math.utexas.edu Abstract: For each partition J K of {1, 2,, n} (n 2) with J 2, let
More information220 B. BOLLOBÁS, P. ERDŐS AND M. SIMONOVITS then every G(n, m) contains a K,,, 1 (t), where a log n t - d log 2 (1 Jc) (2) (b) Given an integer d > 1
ON THE STRUCTURE OF EDGE GRAPHS II B. BOLLOBAS, P. ERDŐS AND M. SIMONOVITS This note is a sequel to [1]. First let us recall some of the notations. Denote by G(n, in) a graph with n vertices and m edges.
More informationa 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2,
5.3. Pythagorean triples Definition. A Pythagorean triple is a set (a, b, c) of three integers such that (in order) a 2 + b 2 c 2. We may as well suppose that all of a, b, c are non-zero, and positive.
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES
ASYMPTOTIC DISTRIBUTION OF THE MAXIMUM CUMULATIVE SUM OF INDEPENDENT RANDOM VARIABLES KAI LAI CHUNG The limiting distribution of the maximum cumulative sum 1 of a sequence of independent random variables
More informationClasses of Commutative Clean Rings
Classes of Commutative Clean Rings Wolf Iberkleid and Warren Wm. McGovern September 3, 2009 Abstract Let A be a commutative ring with identity and I an ideal of A. A is said to be I-clean if for every
More informationAn Addition Theorem Modulo p
JOURNAL OF COMBINATORIAL THEORY 5, 45-52 (1968) An Addition Theorem Modulo p JOHN E. OLSON The University of Wisconsin, Madison, Wisconsin 53706 Communicated by Gian-Carlo Rota ABSTRACT Let al,..., a=
More informationFunctions and cardinality (solutions) sections A and F TA: Clive Newstead 6 th May 2014
Functions and cardinality (solutions) 21-127 sections A and F TA: Clive Newstead 6 th May 2014 What follows is a somewhat hastily written collection of solutions for my review sheet. I have omitted some
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationA strongly rigid binary relation
A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationSOLUTIONS FOR 2011 APMO PROBLEMS
SOLUTIONS FOR 2011 APMO PROBLEMS Problem 1. Solution: Suppose all of the 3 numbers a 2 + b + c, b 2 + c + a and c 2 + a + b are perfect squares. Then from the fact that a 2 + b + c is a perfect square
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationON REPRESENTATIVES OF SUBSETS
26 P. HALL ON REPRESENTATIVES OF SUBSETS P. HALL - 1. Let a set S of raw things be divided into m classes of n things each in two distinct ways, (a) and (6); so that there are m (a)-classes and m (6)-classes.
More informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More informationErdös-Ko-Rado theorems for chordal and bipartite graphs
Erdös-Ko-Rado theorems for chordal and bipartite graphs arxiv:0903.4203v2 [math.co] 15 Jul 2009 Glenn Hurlbert and Vikram Kamat School of Mathematical and Statistical Sciences Arizona State University,
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationCOMPLETION OF PARTIAL LATIN SQUARES
COMPLETION OF PARTIAL LATIN SQUARES Benjamin Andrew Burton Honours Thesis Department of Mathematics The University of Queensland Supervisor: Dr Diane Donovan Submitted in 1996 Author s archive version
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationGRAPH ALGORITHMS Week 7 (13 Nov - 18 Nov 2017)
GRAPH ALGORITHMS Week 7 (13 Nov - 18 Nov 2017) C. Croitoru croitoru@info.uaic.ro FII November 12, 2017 1 / 33 OUTLINE Matchings Analytical Formulation of the Maximum Matching Problem Perfect Matchings
More informationDisjoint paths in unions of tournaments
Disjoint paths in unions of tournaments Maria Chudnovsky 1 Princeton University, Princeton, NJ 08544, USA Alex Scott Mathematical Institute, University of Oxford, Oxford OX2 6GG, UK Paul Seymour 2 Princeton
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationBoolean Inner-Product Spaces and Boolean Matrices
Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver
More informationNon-classical Study on the Simultaneous Rational Approximation ABSTRACT
Malaysian Journal of Mathematical Sciences 9(2): 209-225 (205) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES Journal homepage: http://einspem.upm.edu.my/journal Non-classical Study on the Simultaneous Rational
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationOn a certain type of matrices with an application to experimental design
Title Author(s) On a certain type of matrices with an application to experimental design Okamoto, Masashi Citation Osaka Mathematical Journal 6(1) P73-P82 Issue Date 1954-06 Text Version publisher URL
More informationArithmetic progressions in sumsets
ACTA ARITHMETICA LX.2 (1991) Arithmetic progressions in sumsets by Imre Z. Ruzsa* (Budapest) 1. Introduction. Let A, B [1, N] be sets of integers, A = B = cn. Bourgain [2] proved that A + B always contains
More informationTOPOLOGY HW 2. x x ± y
TOPOLOGY HW 2 CLAY SHONKWILER 20.9 Show that the euclidean metric d on R n is a metric, as follows: If x, y R n and c R, define x + y = (x 1 + y 1,..., x n + y n ), cx = (cx 1,..., cx n ), x y = x 1 y
More informationProof of a Conjecture of Erdős on triangles in set-systems
Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationThe Complete Intersection Theorem for Systems of Finite Sets
Europ. J. Combinatorics (1997) 18, 125 136 The Complete Intersection Theorem for Systems of Finite Sets R UDOLF A HLSWEDE AND L EVON H. K HACHATRIAN 1. H ISTORIAL B ACKGROUND AND THE N EW T HEOREM We are
More informationLINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line.
LINEAR SPACES Define a linear space to be a near linear space in which any two points are on a line. A linear space is an incidence structure I = (P, L) such that Axiom LS1: any line is incident with at
More informationOn Subsets with Cardinalities of Intersections Divisible by a Fixed Integer
Europ. J. Combinatorics (1983) 4,215-220 On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer P. FRANKL AND A. M. ODLYZKO If m(n, I) denotes the maximum number of subsets of an n-element
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationA DEGREE VERSION OF THE HILTON MILNER THEOREM
A DEGREE VERSION OF THE HILTON MILNER THEOREM PETER FRANKL, JIE HAN, HAO HUANG, AND YI ZHAO Abstract An intersecting family of sets is trivial if all of its members share a common element Hilton and Milner
More information2.2. Show that U 0 is a vector space. For each α 0 in F, show by example that U α does not satisfy closure.
Hints for Exercises 1.3. This diagram says that f α = β g. I will prove f injective g injective. You should show g injective f injective. Assume f is injective. Now suppose g(x) = g(y) for some x, y A.
More informationMathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations
Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations D. R. Wilkins Academic Year 1996-7 1 Number Systems and Matrix Algebra Integers The whole numbers 0, ±1, ±2, ±3, ±4,...
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationWritten Homework # 4 Solution
Math 516 Fall 2006 Radford Written Homework # 4 Solution 12/10/06 You may use results form the book in Chapters 1 6 of the text, from notes found on our course web page, and results of the previous homework.
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationQuasi-Progressions and Descending Waves
Quasi-Progressions and Descending Waves T. C. Brown, P Erdős, and A. R. Freedman Citation data T.C. Brown, P. Erdős, and A.R. Freedman, Quasi-progressions and descending waves, J. Combin. Theory Ser. A
More informationStrongly Nil -Clean Rings
Strongly Nil -Clean Rings Abdullah HARMANCI Huanyin CHEN and A. Çiğdem ÖZCAN Abstract A -ring R is called strongly nil -clean if every element of R is the sum of a projection and a nilpotent element that
More informationR u t c o r Research R e p o r t. Uniform partitions and Erdös-Ko-Rado Theorem a. Vladimir Gurvich b. RRR , August, 2009
R u t c o r Research R e p o r t Uniform partitions and Erdös-Ko-Rado Theorem a Vladimir Gurvich b RRR 16-2009, August, 2009 RUTCOR Rutgers Center for Operations Research Rutgers University 640 Bartholomew
More informationEXERCISE SET 5.1. = (kx + kx + k, ky + ky + k ) = (kx + kx + 1, ky + ky + 1) = ((k + )x + 1, (k + )y + 1)
EXERCISE SET 5. 6. The pair (, 2) is in the set but the pair ( )(, 2) = (, 2) is not because the first component is negative; hence Axiom 6 fails. Axiom 5 also fails. 8. Axioms, 2, 3, 6, 9, and are easily
More informationMaths 212: Homework Solutions
Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationRIGHT GROUP CONGRUENCES ON A SEMIGROUP
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 50, July 1975 RIGHT GROUP CONGRUENCES ON A SEMIGROUP FRANCIS E. MAS AT ABSTRACT. This paper develops necessary and sufficient conditions on an algebraic
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationMath 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.
Math 20 Exam 2 - Practice Problems. For each of the following, determine whether the statement is True or False. (a) {a,b,c,d} TRE (b) {a,b,c,d} FLSE (c) {a,b, } TRE (d) {a,b, } TRE (e) {a,b} {a,b} FLSE
More informationf Wi; (x) I dfi< x i=1,.,m; j= 1,...,I MINIMAL COMPLETE CLASS OF DECISION FUNCTIONS WHEN THE CHARACTERIZATION OF THE
CHARACTERIZATION OF THE MINIMAL COMPLETE CLASS OF DECISION FUNCTIONS WHEN THE NUMBER OF DISTRIBUTIONS AND DECISIONS IS FINITE A. WALD AND J. WOLFOWITZ COLUMBIA UNIVERSITY 1. Introduction The principal
More informationDFA to Regular Expressions
DFA to Regular Expressions Proposition: If L is regular then there is a regular expression r such that L = L(r). Proof Idea: Let M = (Q,Σ, δ, q 1, F) be a DFA recognizing L, with Q = {q 1,q 2,...q n },
More informationPrimes in the Semigroup of Non-Negative Matrices
Linear and Multilinear Algebra, 1974, Vol. 2, pp. 135-140 Gordon and Breach Science Publishers Ltd. Printed in Great Britain Primes in the Semigroup of Non-Negative Matrices DANIEL J. RICHMAN and HANS
More informationCHAPTER 1. Preliminaries. 1 Set Theory
CHAPTER 1 Preliminaries 1 et Theory We assume that the reader is familiar with basic set theory. In this paragraph, we want to recall the relevant definitions and fix the notation. Our approach to set
More informationFinite connectivity in infinite matroids
Finite connectivity in infinite matroids Henning Bruhn Paul Wollan Abstract We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid,
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationThe Inclusion Exclusion Principle and Its More General Version
The Inclusion Exclusion Principle and Its More General Version Stewart Weiss June 28, 2009 1 Introduction The Inclusion-Exclusion Principle is typically seen in the context of combinatorics or probability
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More information1 4 which satisfies (2) identically in u for at least one value of the complex variable z then s c g.l.b. I ~m-1 y~~z cn, lar m- = 0 ( co < r, s < oo)
Nieuw Archief voor Wiskunde (3) III 13--19 (1955) FUNCTIONS WHICH ARE SYMMETRIC ABOUT SEVERAL POINTS BY PAUL ERDÖS and MICHAEL GOLOMB (Notre Dame University) (Purdue University) 1. Let 1(t) be a real-valued
More informationA proof of the Jordan normal form theorem
A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it
More informationUnique Expansions of Real Numbers
ESI The Erwin Schrödinger International Boltzmanngasse 9 Institute for Mathematical Physics A-1090 Wien, Austria Unique Expansions of Real Numbers Martijn de Vries Vilmos Komornik Vienna, Preprint ESI
More informationTIGHT INSTANCES OF THE LONELY RUNNER. Luis Goddyn 1 Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada
TIGHT INSTANCES OF THE LONELY RUNNER Luis Goddyn 1 Department of Mathematics, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada goddyn@math.sfu.ca Erick B. Wong Department of Mathematics, Simon Fraser
More informationCOUNTING INTEGER POINTS IN POLYTOPES ASSOCIATED WITH DIRECTED GRAPHS. Ilse Fischer
COUNTING INTEGER POINTS IN POLYTOPES ASSOCIATED WITH DIRECTED GRAPHS Ilse Fischer Fakultät für Mathematik, Universität Wien Oskar-Morgenstern-Platz 1, 1090 Wien, Austria ilse.fischer@univie.ac.at Tel:
More informationTHE DIFFERENCE BETWEEN CONSECUTIVE PRIME NUMBERS. IV. / = lim inf ^11-tl.
THE DIFFERENCE BETWEEN CONSECUTIVE PRIME NUMBERS. IV r. a. ran kin 1. Introduction. Let pn denote the nth prime, and let 0 be the lower bound of all positive numbers
More informationUNIONS OF LINES IN F n
UNIONS OF LINES IN F n RICHARD OBERLIN Abstract. We show that if a collection of lines in a vector space over a finite field has dimension at least 2(d 1)+β, then its union has dimension at least d + β.
More informationSolutions to Homework 1. All rings are commutative with identity!
Solutions to Homework 1. All rings are commutative with identity! (1) [4pts] Let R be a finite ring. Show that R = NZD(R). Proof. Let a NZD(R) and t a : R R the map defined by t a (r) = ar for all r R.
More information36th United States of America Mathematical Olympiad
36th United States of America Mathematical Olympiad 1. Let n be a positive integer. Define a sequence by setting a 1 = n and, for each k > 1, letting a k be the unique integer in the range 0 a k k 1 for
More informationA Note on Variable Length Codes
INFORMATION" AND CONTROL 32, 263-271 (1976) A Note on Variable Length Codes ALDO DE LUCA Istituto di Scienze dell'informazione deil'universit~ di Salerno, Italy and Laboratorio di Cibernetica del C.N.R.,
More informationNOTES FOR COMMUTATIVE ALGEBRA M5P55
NOTES FOR COMMUTATIVE ALGEBRA M5P55 AMBRUS PÁL 1. Rings and ideals Definition 1.1. A quintuple (A, +,, 0, 1) is a commutative ring with identity, if A is a set, equipped with two binary operations; addition
More informationMAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS
MAXIMAL ORDERS IN COMPLETELY 0-SIMPLE SEMIGROUPS John Fountain and Victoria Gould Department of Mathematics University of York Heslington York YO1 5DD, UK e-mail: jbf1@york.ac.uk varg1@york.ac.uk Abstract
More informationA Hilton-Milner Theorem for Vector Spaces
A Hilton-Milner Theorem for ector Spaces A Blohuis, A E Brouwer, A Chowdhury 2, P Franl 3, T Mussche, B Patós 4, and T Szőnyi 5,6 Dept of Mathematics, Technological University Eindhoven, PO Box 53, 5600
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationSets in Abelian groups with distinct sums of pairs
Journal of Number Theory 13 (007) 144 153 www.elsevier.com/locate/jnt Sets in Abelian groups with distinct sums of pairs Harri Haanpää a,,1,patricr.j.östergård b, a Department of Computer Science and Engineering,
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationFinite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017
Finite Automata Theory and Formal Languages TMV027/DIT321 LP4 2017 Lecture 4 Ana Bove March 24th 2017 Structural induction; Concepts of automata theory. Overview of today s lecture: Recap: Formal Proofs
More informationLinear independence, a unifying approach to shadow theorems
Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.
More information