Maximum subsets of (0, 1] with no solutions to x + y = kz

Size: px
Start display at page:

Download "Maximum subsets of (0, 1] with no solutions to x + y = kz"

Transcription

1 Maximum subsets of 0, 1] with no solutions to x + y = z Fan R. K. Chung Department of Mathematics University of Pennsylvania Philadelphia, PA John L. Goldwasser West Virginia University Morgantown, WV 6506 Abstract If is a positive integer we say that a set S of real numbers is -sum-free if there do not exist x, y, x is S such that x + y = z. For greater than or equal to 4 we find the essentially unique measurable -sum-free subset of 0, 1] of maximum size. 1 Introduction We say that a set S of real numbers is sum-free if there do not exist x,y,z is S such that x + y = z. If is a positive integer we say that a set S of real numbers is -sum-free if there do not exist x,y,z in S such that x + y = z we require that not all x,y, and z be equal to each other to avoid a meaningless problem when = ). Let fn, ) denote the maximum size of a -sum-free subset of {1,,...,n}. It is easy to show that fn,1) = n. For n odd there are precisely two such maximum sets: the odd integers and the top half. For n even and greater than 9 there are precisely three such sets: the two maximum sets for the odd number n 1, and the top half. The problem of determining fn,) is unsolved. Roth [R] proved that a subset of the positive integers with positive upper density contains threeterm arithmetic progressions. Szeméredi improved Roth s result to fourterm [S1] and later to -term [S] arithmetic progressions. The current best 1

2 bounds for fn, ) were established by Salem and Spencer [SS] and Heath- Brown and Szeméredi [H]. Chung and Goldwasser [CG] proved a conjecture of Erdös that fn,3) is roughly n n. They showed that fn,3) = for n 4 and that for n 3 the set of odd integers less than or equal to n is the unique maximum set. Loosely speaing, the set of odd numbers less than or equal to n qualifies as a -sum-free set for odd because of parity considerations while the top half maximum sum-free set qualifies because of magnitude considerations: the sum of two numbers in the top half is too big. There is an obvious way to tae a magnitude -sum-free subset of {1,,...,n} and get an analogue -sum-free subset of the interval 0, ] 1]. The top half maximum sum-free 1 subset of {1,,... n} becomes,1 and the size seems to be preserved. On the other hand it is not so obvious how to get the analogue on 0,1] for the odd numbers maximum sum-free subset of {1,,... n}. One could try to fatten up each odd integral point on [0,n] by as much as possible while eeping it sum-free and then normalize. It turns out one can fatten each odd integer j to j 1 3,j + 1 ) and, after normalization, one ends up with 3 a subset of 0,1] of size roughly 1 3. Chung and Goldwasser have conjectured that if 4, n is sufficiently large, and S is a -sum-free subset of {1,,..., n} of size fn, ), then S is the union of three strings of consecutive integers. Such a set has an analogue -sum-free subset of 0,1] of the same size, so we can learn someting about -sum-free subsets of {1,,...,n} by studying -sum-free subsets of 0,1]. We say that a Lebesgue) measurable subset S of 0,1] is a maximum -sum-free-set if S is -sum-free, has maximum size among all measurable -sum-free subsets of 0,1], and is not a proper subset of any -sum-free subset of 0,1]. So S is a maximum -sum-free set if both S and µs) are maximal where µs) denotes the measure of S. In this paper, for each integer greater than or equal to 3 we will construct a family of -sum-free subsets 0,1], each of which is the union of finitely many intervals Lemma 1). We will find which set in the family has maximum size Theorem 1). Then we will show that for 4 any maximum -sum-free subset of 0,1] must be in the family Section 3). This also gives us a lower bound for lim n fn,), and we conjecture that the bound is the actual value. n

3 A family of -sum-free sets. Let be a positive integer greater than or equal to 3, m be a positive integer, and a 1 and c be real numbers such that We define sequences {a i } and {b i } by 0 < c < a 1..1) b i = a i i = 1,,...,m a i+1 = b i c i = 1,,...,m 1..) We normalize to get sequences {e 1 } and {f i } defined by e 1 = 1 b m max{a 1,c} e i = 1 b m a i i =,3,...,m f i = 1 b m b i i = 1,,...,m.3) The set S = m i=1 e i,f i ) is the union of m disjoint intervals and is a subset of 0,1]. Furthermore, S is -sum-free because if x e i,f i ),y e j,f j ), z e r,f r ) and if r = max{i,j,r} then x + y < z, while if r < max{i,j,r} then x + y > z. If P is a set of real numbers consisting of f 1 and either e i or f i for i =,3,...,m then it is not hard to see that S P is a maximal -sum-free set; we will show that if c = a 1 and m = 3 then it is in fact a maximum -sum-free set. Now we calculate µs). From equations.) we get a i+1 a i ) = a i a i 1 ) i =,3,...,m 1 a a 1 = a 1 c 3

4 which has solution ) i a i = c 1 + c i = 1,,...,m where c 1 = a 1 4 ) c.4) If d = max{0,c a 1 } then c = c. µs) = 1 b m = b m = m b i a i ) d b i=1 m ) m 1 c 1 + c m d 1 b m ) 1 + m ) c 1 ) d c 1 c 1 c 1 ) m + c c where we have summed the geometric series and simplified. Now we let y = c a 1 so that c 1 0 < y < by equation.1). Then from equations.4) we get c 1 = c = a 1 ) [ 4 y 1)] a 1 y 4

5 and c c 1 = So now we substitute and simplify to get µs) = ) y y. { } 1 + ym 1) max 0, )y 1) ) m 1 ) ) y m 1 1 With fixed we note that because of the normalization, µs) is a function of m and y alone. So we have the following result. Lemma 1 Let m be a positive integer, a positive integer greater than or equal to 3, a 1 and c real numbers such that 0 < c < a 1,y = c a 1, and let S m,y) = m i=1 e i,f i ) where {e i } and {f i } are defined by.) and.3). Then S m,y) is a -sum-free set. If c a 1, then 0 < y 1 and.5) µs m,y)) = ) + [ym 1) 1] ) ) m 1 ) ) y m 1 1.6) while if c a 1 then 1 y < and µs m,y)) = ) + 1) y[ + 4) m )] ) m 1 ) ) y m ) For any positive integer greater than we define the set S ) by ) i 1 ) ) i 1 S ) = i=1,. 5

6 If P ) is formed from S ) by including one end-point of each interval then it is easy to see that P ) is a maximal -sum-free set and µp )) = µs )) = i=1 ) i 1 ) =. We remar that S ) = lim S m,y) for any y 0, ) and that m µs )) = µs,1)). If m is fixed, the expression in.6) is clearly an increasing function [ of y on 0,1], so to maximize µs m,y)) we need only consider y 1, ) and use.7). For fixed we define the functions fm,y) = 1) y [ + 4) m )] ) gm,y) = m 1 ) ) y m 1 1 hm,y) = fm,y) gm, y) [ where m is a positive integer and y 1, ). With y fixed, the function F y m) = fm,y) is an increasing linear function of m with root my) given by my) = + 3 1) y. y ) So the root my) of F y m) is an increasing function of y for y hence = m1) my) < m = + 1 ) [ 1, ) and [ This means that for each y 1, ) there is a positive integer m c y) {,3,..., + 1} such that fm,y) < 0 for m < m c y) and fm,y) 0 for m m c y). It is easy to show that if y is fixed then hm,y) > hm + 1,y) for all m greater than m c y) because gm,y) is positive and exponential 6

7 in m). So for fixed y the maximum value of hm,y) occurs when m {m c y),m c y) + 1}, which means for some m satisfying m +..8) Now with m fixed and satisfying.8) we let H m y) = hm,y). We differentiate to get where H my) = A [gm,y)] ) A = 1) m 1 1 ) m 1 ) [ + 4) m )] ) m 1 ) 1) [ by.8). So H m y) is strictly decreasing on 1, ) for any m satisfying.8). And hence µ S m,y)) is a maximum if and only if y = 1 and Rm) = hm,1) is a maximum over {,3,..., + }. We have Rm) = 1) + 4) + m ) ) m 1 4) + 1 = + m ) m which clearly is maximum only at m = 3. In fact it is easy to see that Rm) is decreasing on [3, ) and that lim Rm) = R) = 0. We have proved m the following result. 7

8 Theorem 1 Let m be a positive integer, a positive integer greater than or equal to 3, a 1 and c real numbers such that 0 < c < a 1,y = c a 1, and let S m,y) = m i=1 e i,f i ) where {e i } and {f i } are defined by.) and.3). Then µs m,y)) is a maximum only when m = 3 and y = 1. The size of this maximum set is ) µ S 3,1)) = + 8 ) ) 4 4) Furthermore, if m is greater than, then µ S m,1)) > µ S m + 1,1)) ) and µ S m,1)) > µ S,1)) = µ S )) =. 3 Maximum -sum-free sets are in the family. Lemma If S is a maximum -sum-free subset of {0,1] where is an integer greater than or equal to 4 and if u = 1.u.b. x S x < } then < u <. Proof: If 1 < u 1 then there exists a real number x in S, Then 0 < x 1 < 1, and for each y [x 1,1], not both y and x y are in S. Because of these forbidden pairs, ). If we now let µ S [x 1,1]) 1 [1 x 1)]. 3.1) S = then S is -sum-free and { } 1 w w S 0,x 1] x 1 ) µs 1 ) = µs 0,x 1] x 1 1 = µs) µs [x 1,1])) x 1 1 x 1)µS) + [1 x 1)]µS) 1 ) x 1 [1 x 1)] > µs) 8

9 where the first inequality follows from 3.1) and the second follows because µs) > > 1 for 4. We have contradicted the assumption that S is a maximum set, so u 1 [. Now suppose u, 1 ]. For each ǫ > 0 there exists a real number x in S such that 0 u x < ǫ. If u < u then ǫ can be chosen such that x < x, and for each y 0,x], not both y and x y can be in S. Because of this forbidden pairing of 0,x] with [x x,x), and since < x x < x < 1, [ µs) = µ S x, ]) ])) + µ S 0,x],1 u x) + 1 < 1 + ǫ and µs) is not a maximum. If u u then since x x and due to the forbidden pairing of 0,x ] [ ) with,x, µs) 1 ) + u x ) = 1 1)u + u x) 1 1) + u x) = + ǫ. But is the size of S,1), so µs) is not a maximum. Hence u <. If u then the set 9

10 has size S = { x x S 0,u ] } µs ) = µs 0,u ]) µs) + = µs) + > µs) µs) 1 ) ) ) µs) which again is a contradiction, so µ > completing the proof. Lemma 3 If S is a maximum -sum-free subset of {0,1] where is an integer greater than or equal to 4 and if u = l.u.b. x S x < }, then u,1) S and µ S 0,u ]) [ ]) + µ S,1 =. Proof: First we will show that if S is a maximum -sum-free subset of 0,1] then S u,1) is also -sum-free. If x and y are in S and z u,1) then x+y < z, since u > by Lemma. If x u,1) and z then x + y > z, while if x u,1) and z < then x + y > z, since z u. Thus S u,1) is -sum-free and hence u,1) S. ] As in the proof of Lemma, for each x in S,u there is a forbidden pairing of 0,x ] [ ) and,x, so µ S 0,u ] [ ])),u u. 3.) If the inequality in 3.) is strict, then the set S = S u ]),u ],1 is also -sum-free and µs) < µs ). Thus equality holds in 3.). 10

11 Lemma 4 If S is a maximum -sum-free subset of {0,1] where is an integer greater than or equal to 4 and if u = l.u.b. x S x < } then µs) > 1 u + 1 ). Proof: If not then since u < µs) < 1 + Lemma ) we have 1 ) 1 ) + = which is a contradiction since this is the size of S,1). Lemma 5 If S is a maximum -sum-free subset { of 0,1] where is an integer greater than or equal to 4 and if u = l.u.b. x S x < } then a) µ S 0, ]) u > 0. { b) If u 3 = l.u.b. x S x < } u then u 3 1 u. c) There exists a positive number c such that u 3 u = u = c. d) [ ) )] u,u,1 S and S 0,c) =. Proof: a) If µ S 0, ]) u = 0 then, since u < 1 ) + u 1 ) < Lemma ), µs) 1 b) if x S u, ) u then there are forbidden pairs in [x u,u ] : If y S [x [ u,u ] then x y S. If we let S [x u,u ] = r and µ S u ]),u = p then 11

12 because of the forbidden pairing and r < 1 [u x u )] 3.3) p > 1 u 3.4) by Lemma 3 and Lemma 4. From equations 3.3) and 3.4) we get { u p r > 1 x u ). 3.5) [ Now let S = w w S u ]} ] x u,x u,1. It is easy to chec that S is -sum-free and µs u ) = p r) + 1 ) x u = p r) + u x u ) p r) + 1 ) x u r > p r) + 1 p r) p r) + ) = µs) where the inequality follows from equations 3.3) and 3.5) and the 1 last equality follows from Lemma 3. Hence S u, ) u = and u 3 1 u. c) By Lemma, u is equal to some positive number c. Let u 3 u = b and assume b < c. Let S = A B C where c + A = u x x S c,u 3 ),B = u 3 ] ] u,u, and c =,1. 1

13 If z B C or if {x,y,z} A it is clear that S has no solution to x + y = z. If z A and y A then x + y > c + u > z, so S is -sum-free. And c + µs ) = u µ S c,u 3 )) + 1 ) u + 1 u 3 > S c,u 3 )) + 1 ) u + 1 ) ) since µ S c,u 3 )) > 0 otherwise µs) µ S,1)) and u 3 = b + u < c + u. On the other [ hand, ] if b > c then b is positive and for each x S u,u 3 there is a forbidden pairing of [,x) u. Since x can be arbitrarily close to u 3, 0,x u ] and [ ])) µ S 0,b] u,u 3 b. 3.6) It is not hard to chec that the set ) ] S 0 = S b,u 3 ]) u,u,1 3.7) is -sum-free and that µs) µs 0 ) by 3.6) and Lemma 5b)). We define the set S by where u is chosen so that ] ] S = S b,u 3 ]) u,u,1 u 3 u = u. Since b > c we have u 3 + > u + u, so 13

14 u = u > u + u + = u. Hence µs ) > µs 0 ) µs). It remains to show S is -sum-free. If x S,y S\b,u 3 ] and z S b,u 3 ] then while if x S,y Hence b = c. z < u 3 + u u ) = b + u < x + y ] ],1, and z u,u, then z = < u ) + u 3 ) u + u 3 ) u + < x + y d) If µs 0,c])[ = δ > 0 ) then, because [ ) of the forbidden pairing of 0,c] with each of u,u 3 and,u we have [ µs) µs 0,u 3 ]) + 1 ) ] u δ + 1 ) δ < µs 0 ) where S 0 is given by 3.7) with b = c. And if δ = 0 but ] ])) µ S u,u,1 < u 1 ) + 1 ) 14

15 we would still have µs) < µs 0 ). So S 0,c) and [ ) )] u,u,1 \S are both sets of measure 0; we will now show each is the empty set. If y S 0,c) choose and r and t in S such that 1 y + < r < t u such [ r and ] t exist because S is missing at most a set of measure zero in,u ). Then < r y < t y u and for each q S)) [r,t],q y S. Hence µs [r y,t y]) = 0, so µ S,u < u and µs) < µs 0). Thus we have shown S 0,c) = ). It is each ) to see that any such maximum S contains u,u and,1. Lemma 6 Let S be a maximum -sum-free subset of 0,1] where is an integer greater { than or equal to 4 with the sequence {u i } defined by u 1 = 1, u i = l.u.b. x S x < } u i 1 for i =,3,.... Then a) There exists a positive integer m 3 such that u m exists but u m+1 does not. [ ] b) There exists a positive number c 1) u m,u m such that [0,c) c) S = and u i+1 u i = c i = 1,,...,m 1. u i,u i ) max { u m,c}. S i = 1,,...,m 1 and t,u m ) S where t = 15

16 Proof: By Lemma 5 there exists a positive number c such that and u i+1 u i = c 3.8) ) u i,u i S 3.9) for i = 1 and and where S [0,c) =. Since c is a fixed positive number it is clear that the statement in a) is true. We will show by induction that equations 3.8) and 3.9) hold for all positive integers integers less than m. Assume 3.8) and 3.9) hold for all i less than j where j {3,4,...,m 1}; we will show they hold for i = j as well. First we will show that µ S 0,u j )) > 1 u j. 3.10) Since u j+1 exists and S 0,c) = we must have c < u j. Hence the set ) S = j i=1 u i,u i is -sum-free and µ S 0,u j )) = µs) µs ) + 1 ) u j 3.11) 1 u j + 4 u j since µs) µs ). This verifies 3.10) for any greater than 4. But for 4 the value of µs ) is given by Lemma 1 with c < a 1 = u j. Hence y < 1 and we use formula.6). As remared earlier, this is an increasing function of y, so µs ) is not a maximum and µs) µs ) > 0. This maes the inequality in 3.11) strict and verifies 3.10). Next we will show u j+1 1 u j. 3.1) 16

17 1 If there exists x S u j, ) u j then µ S [x u j,u j ]) 1 [u j x u j )] 3.13) by a forbidden pair argument. If we now let { } [ ]) S uj = w w S c,x u j ) S x u j u j 1,1 then it is easy to show S is -sum-free and µs u j ) µs) = µ S 0,u j ]) µ S [x u j,u j ])) x u j µ S 0,u j ]) u j x u j ) µ S 0,u j ])) x u j u j 1 x u j [u j x u j )] = u j x u j ) µ S 0,u j ]) 1 ) x u j u j > 0 where the first inequality follows by 3.13) and the second by 3.10). Thus we have verified equation 3.1). Now let b = u j+1 u j. We wish to show b = c. If b < c then we let 1 S u j + c) [ ]) = w w S 0,u j+1 ) S u j+1 u j,1. It is easy to chec that S is -sum-free and we have 1 µs ) µs) = u j + c) 1 u µ S 0,u j+1)). j ) 17

18 If µs 0,u j+1 )) = 0 then as in the discussion following inequality 3.11) µs) is given by formula.6) with y < 1, so it cannot be a maximum. Since u j+1 = 1 ) u j + b, each factor in 3.14) is positive, which is a contradiction. If b > c then u j < u j+1 u j and as in the proof of Lemma 5c)) from a forbidden pairing we get [ ))) µ S 0,b] u j,u j+1 b. 3.15) Now we let S = S b,u j+1 )) j i=3 where u = 1 So S is obtained from S by replacing S [ ] u,u u j,u j+1), replacing S ) ) ) u i,u i u,u,1 b + ) > 1 c + ) = u. 3.16) [ ]) 0,b] u j,u j+1 by ) by u,u and possibly omitting finitely many points certain end-points). It is easy to chec that S is - sum-free and µs ) µs) 1 ) u 1 ) u > 0 by 3.15) and 3.16), so again µs) is not a maximum. Therefore ) b = c which verifies 3.8) for i = j. And clearly S u j,u j is -sum-free, which verifies 3.9) for i = j. Thus we have shown by induction that 3.8) and 3.9) hold for i = 1,,...,m 1. { } Since u m+1 does not exist, if we let t = max u m,c then S t,u m ) is -sum-free, so t,u m ) S verifying c). Finally, if c < c + u m 3.17) 18

19 then we can choose a real number y greater than c such that y < y + u m. But then S {y} is -sum-free which[ violates the maximality ] of S. Hence 3.17) must be false which shows c 1) u m,u m. Theorem If is an integer greater than or equal to 4 and S is a maximum -sum-free subset of 0,1] then S is the union of the set S 3,1) = 3 i=1 e i,f i ) of Lemma 1) and three points, one end-point of each interval. Any of the eight possible ways of choosing the end-points is all right except {e 1,f,e 3 }. Proof: By Lemma 6, if we ignore end-points, S has the form of S m,y) for some m 3. By Theorem 1, S 3,1) is the largest of these. To get a maximal set we need to put in one end-point of each interval, but since e 1 + e 3 = f we cannot choose {e 1,f,e 3 }. The end-points turn out to be f 1 = 4 4 4, f = ) 4 4, f 3 = 1, with e i = f i i = 1,,3. For = 4 one gets S 4 3,1) = ) 1 110, , 14 ) ) 1 110,1. Corollary 1 Let fn,) denote the maximum size of a -sum-free subset fn,) of {1,,... n}. If 4 then lim µ S 3,1)). n n 4 Remars One can get a maximum -sum-free subset of 0,1] by a sort of greedy 8 algorithm if one nows where to start. Put e 1 = 4 in S, 4) and then moving left to right put in anything that goes and eeps it - sum-free. So f 1 = l.u.b.{x [e 1,1] [e 1,x]is -sum-free}. But f 1 cannot be in S, so we have [e 1,f 1 ) so far. Then let e = g.l.b.{x [f 1,1] [e 1,f 1 ) {x} is -sum-free}, and so on. Alternatively, let a 1 = 1 and perform this greedy procedure, stop after three intervals and normalize. 19

20 ] Moving right to left the greedy procedure does not wor. One gets,1 for the first interval and then 1) is the largest number that can be added. However the set is now maximal. In fact is the only real ] 1) number x such that {x},1 is a maximal -sum-free subset of 0,1]. 8 If you first put 4 in S and then wor right to left from 1 4) following the greedy procedure, you do get a maximum -sum-free set. The proof of Theorem is valid for any real number greater than + since then > 1 and the forbidden pairs arguments wor). The proof does not wor for = 3, but µs 3 m,y)) is still maximized when m = 3 and y = 1 µs 3 3,1)) = 77 ). 177 Conjecture 3 Theorem holds for = 3 as well. As mentioned in the Introduction, maximum -sum-free subsets of 0, 1] and of {1,,...,n} have very different structures for = 3. There is no maximum 3-sum-free analogue on 0, 1] of the all odd number maximum 3-sum-free subset of {1,,...,n}). However, we thin they have the same structures for 4. Conjecture 4 Equality holds in Corollary 1. We believe that if n is sufficiently large, to get a maximum -sum-free subset of {1,,...,n} one taes the integers within the three intervals obtained by multiplying each real number in S 3 3,1) by n with slight modification of the end-points due to integer round-off). To prove this integral version one can probably use the general outline of the above proof for 0,1]. There are some technical difficulties due to the fact that if one multiplies each member of a set of integers by a real number greater than 1, the result may not be a set of integers, and even if it is, the size of the set is the same as the size of the original set as opposed to what happens with the measure of a set of real numbers). 0

21 References [CG] F. R. K. Chung and J. L. Goldwasser, Integer sets containing no solutions to x + y = 3, The Mathematics of Paul Erdős, R. L. Graham and J. Nesetril eds., Springer Verlag, Heidelberg, [H] D. R. Heath-Brown, Integer sets containing no arithmetic progressions, 1986) preprint. [R] K. Roth, On certain sets of integers, J. London Math. Society, ), [SS] [S1] [S] R. Salem and D. C. Spencer, On sets of integers which contain no three terms in arithmetical progressions, Proc. Nat. Acad. Sci. USA 8 194), E. Szemerédi, On sets of integers containing no four elements in arithmetic progression, Acta. Math. Acad. Sci. Hungar ), E. Szemerédi, On sets of integers containing no elements in arithmetic progression, Acta. Arith ),

The Maximum Upper Density of a Set of Positive. Real Numbers with no solutions to x + y = kz. John L. Goldwasser. West Virginia University

The Maximum Upper Density of a Set of Positive. Real Numbers with no solutions to x + y = kz. John L. Goldwasser. West Virginia University The Maximum Upper Density of a Set of Positive Real Numbers with no solutions to x + y = z John L. Goldwasser West Virginia University Morgantown, WV 6506 Fan R. K. Chung University ofpennsylvania Philadelphia,

More information

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.

MATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers. MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES

GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February

More information

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction

Math 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If

More information

The number of edge colorings with no monochromatic cliques

The 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 information

Solving a linear equation in a set of integers II

Solving a linear equation in a set of integers II ACTA ARITHMETICA LXXII.4 (1995) Solving a linear equation in a set of integers II by Imre Z. Ruzsa (Budapest) 1. Introduction. We continue the study of linear equations started in Part I of this paper.

More information

Graphs 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 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 information

Roth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013

Roth s theorem on 3-arithmetic progressions. CIMPA Research school Shillong 2013 Roth s theorem on 3-arithmetic progressions CIPA Research school Shillong 2013 Anne de Roton Institut Elie Cartan Université de Lorraine France 2 1. Introduction. In 1953, K. Roth [6] proved the following

More information

Maximum union-free subfamilies

Maximum union-free subfamilies Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called

More information

Multicolour Ramsey Numbers of Odd Cycles

Multicolour Ramsey Numbers of Odd Cycles Multicolour Ramsey Numbers of Odd Cycles JOHNSON, JR; Day, A 2017 Elsevier Inc This is a pre-copyedited, author-produced PDF of an article accepted for publication in Journal of Combinatorial Theory, Series

More information

AN UPPER BOUND FOR ODD PERFECT NUMBERS. Pace P. Nielsen Department of Mathematics, University of California, Berkeley, CA 94720, U.S.A.

AN UPPER BOUND FOR ODD PERFECT NUMBERS. Pace P. Nielsen Department of Mathematics, University of California, Berkeley, CA 94720, U.S.A. AN UPPER BOUND FOR ODD PERFECT NUMBERS Pace P. Nielsen Department of Mathematics, University of California, Berkeley, CA 94720, U.S.A. pace@math.berkeley.edu Received:1/31/03, Revised: 9/29/03, Accepted:

More information

Bipartite Subgraphs of Integer Weighted Graphs

Bipartite Subgraphs of Integer Weighted Graphs Bipartite Subgraphs of Integer Weighted Graphs Noga Alon Eran Halperin February, 00 Abstract For every integer p > 0 let f(p be the minimum possible value of the maximum weight of a cut in an integer weighted

More information

PRIME-REPRESENTING FUNCTIONS

PRIME-REPRESENTING FUNCTIONS Acta Math. Hungar., 128 (4) (2010), 307 314. DOI: 10.1007/s10474-010-9191-x First published online March 18, 2010 PRIME-REPRESENTING FUNCTIONS K. MATOMÄKI Department of Mathematics, University of Turu,

More information

On some inequalities between prime numbers

On some inequalities between prime numbers On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely

More information

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9 MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

More information

arxiv:math/ v2 [math.nt] 3 Dec 2003

arxiv:math/ v2 [math.nt] 3 Dec 2003 arxiv:math/0302091v2 [math.nt] 3 Dec 2003 Every function is the representation function of an additive basis for the integers Melvyn B. Nathanson Department of Mathematics Lehman College (CUNY) Bronx,

More information

arxiv: v1 [math.co] 28 Jan 2019

arxiv: v1 [math.co] 28 Jan 2019 THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in

More information

Properly colored Hamilton cycles in edge colored complete graphs

Properly colored Hamilton cycles in edge colored complete graphs Properly colored Hamilton cycles in edge colored complete graphs N. Alon G. Gutin Dedicated to the memory of Paul Erdős Abstract It is shown that for every ɛ > 0 and n > n 0 (ɛ), any complete graph K on

More information

On the Infinitude of Twin-Primes Bao Qi Feng

On the Infinitude of Twin-Primes Bao Qi Feng On the Infinitude of Twin-Primes Bao Qi Feng Department of Mathematical Sciences, Kent State University at Tuscarawas 330 University Dr. NE, New Philadelphia, OH 44663, USA. Abstract In this article, we

More information

EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS

EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS #A5 INTEGERS 5 (205) EGYPTIAN FRACTIONS WITH EACH DENOMINATOR HAVING THREE DISTINCT PRIME DIVISORS Steve Butler Department of Mathematics, Iowa State University, Ames, Iowa butler@iastate.edu Paul Erdős

More information

ALMOST ODD RANDOM SUM-FREE SETS NEIL J. CALKIN AND P. J. CAMERON. 1. introduction

ALMOST ODD RANDOM SUM-FREE SETS NEIL J. CALKIN AND P. J. CAMERON. 1. introduction ALMOST ODD RANDOM SUM-FREE SETS NEIL J. CALKIN AND P. J. CAMERON Abstract. We show that if S 1 is a strongly complete sum-free set of positive integers, and if S 0 is a nite sum-free set, then with positive

More information

Note on Vertex-Disjoint Cycles

Note on Vertex-Disjoint Cycles Note on Vertex-Disjoint Cycles Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road, Cambridge CB3 OWB England. November 999.

More information

A PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS

A PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS A PROOF OF ROTH S THEOREM ON ARITHMETIC PROGRESSIONS ERNIE CROOT AND OLOF SISASK Abstract. We present a proof of Roth s theorem that follows a slightly different structure to the usual proofs, in that

More information

THE INVERSE PROBLEM FOR REPRESENTATION FUNCTIONS FOR GENERAL LINEAR FORMS

THE INVERSE PROBLEM FOR REPRESENTATION FUNCTIONS FOR GENERAL LINEAR FORMS INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A16 THE INVERSE PROBLEM FOR REPRESENTATION FUNCTIONS FOR GENERAL LINEAR FORMS Peter Hegarty Department of Mathematics, Chalmers University

More information

Math 145. Codimension

Math 145. Codimension Math 145. Codimension 1. Main result and some interesting examples In class we have seen that the dimension theory of an affine variety (irreducible!) is linked to the structure of the function field in

More information

A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS

A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS BRIAN L MILLER & CHRIS MONICO TEXAS TECH UNIVERSITY Abstract We describe a particular greedy construction of an arithmetic progression-free

More information

Any Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?

Any Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City? Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of

More information

Sub-Ramsey numbers for arithmetic progressions

Sub-Ramsey numbers for arithmetic progressions Sub-Ramsey numbers for arithmetic progressions Maria Axenovich and Ryan Martin Department of Mathematics, Iowa State University, Ames, IA, 50011. axenovic@math.iastate.edu, rymartin@iastate.edu Abstract.

More information

Welsh s problem on the number of bases of matroids

Welsh s problem on the number of bases of matroids Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University

More information

#A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1

#A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1 #A34 INTEGERS 13 (2013) A NOTE ON THE MULTIPLICATIVE STRUCTURE OF AN ADDITIVELY SHIFTED PRODUCT SET AA + 1 Steven Senger Department of Mathematics, University of Delaware, Newark, Deleware senger@math.udel.edu

More information

Equidivisible consecutive integers

Equidivisible consecutive integers & Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics

More information

Solutions for Homework Assignment 2

Solutions for Homework Assignment 2 Solutions for Homework Assignment 2 Problem 1. If a,b R, then a+b a + b. This fact is called the Triangle Inequality. By using the Triangle Inequality, prove that a b a b for all a,b R. Solution. To prove

More information

Minimal Paths and Cycles in Set Systems

Minimal 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 information

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page. Formal Methods Name: Key Midterm 2, Spring, 2007 Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.. Determine whether each of

More information

Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions

Math 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions Math 4: Principles of Analysis Fall 0 Homework Part B solutions. Let x, y, z R. Use the axioms of the real numbers to prove the following. a) If x + y = x + z then y = z. Solution. By Axiom a), there is

More information

Irredundant Families of Subcubes

Irredundant Families of Subcubes Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which

More information

Arithmetic progressions in sumsets

Arithmetic 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 information

Properties of the Integers

Properties of the Integers Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.

a + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c. Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called

More information

On primitive sets of squarefree integers

On primitive sets of squarefree integers On primitive sets of suarefree integers R. Ahlswede and L. Khachatrian Fakultät für Mathematik Universität Bielefeld Postfach 003 3350 Bielefeld and A. Sárközy * Eötvös Loránd University Department of

More information

Off-diagonal hypergraph Ramsey numbers

Off-diagonal hypergraph Ramsey numbers Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of

More information

Unique Difference Bases of Z

Unique Difference Bases of Z 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 14 (011), Article 11.1.8 Unique Difference Bases of Z Chi-Wu Tang, Min Tang, 1 and Lei Wu Department of Mathematics Anhui Normal University Wuhu 41000 P.

More information

The ideal of Sierpiński-Zygmund sets on the plane

The ideal of Sierpiński-Zygmund sets on the plane The ideal of Sierpiński-Zygmund sets on the plane Krzysztof P lotka Department of Mathematics, West Virginia University Morgantown, WV 26506-6310, USA kplotka@math.wvu.edu and Institute of Mathematics,

More information

Conway s RATS Sequences in Base 3

Conway s RATS Sequences in Base 3 3 47 6 3 Journal of Integer Sequences, Vol. 5 (0), Article.9. Conway s RATS Sequences in Base 3 Johann Thiel Department of Mathematical Sciences United States Military Academy West Point, NY 0996 USA johann.thiel@usma.edu

More information

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10

Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Math 4606, Summer 2004: Inductive sets, N, the Peano Axioms, Recursive Sequences Page 1 of 10 Inductive sets (used to define the natural numbers as a subset of R) (1) Definition: A set S R is an inductive

More information

Even Cycles in Hypergraphs.

Even Cycles in Hypergraphs. Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and

More information

arxiv: v1 [math.co] 25 Oct 2018

arxiv: v1 [math.co] 25 Oct 2018 AN IMPROVED BOUND FOR THE SIZE OF THE SET A/A+A OLIVER ROCHE-NEWTON arxiv:1810.10846v1 [math.co] 25 Oct 2018 Abstract. It is established that for any finite set of positive real numbers A, we have A/A+A

More information

81 1. Nearly foamy years ago I made the following conjecture : Let 1 5 al <... < ak s n ; 1 5 b l <... < b1 S n be two sequences of integers. Assume t

81 1. Nearly foamy years ago I made the following conjecture : Let 1 5 al <... < ak s n ; 1 5 b l <... < b1 S n be two sequences of integers. Assume t 80 Extremal Problems in Number Theory Paul Erdős Hungarian Academy of Sciences Within the last few years I have written several papers on this subject. To keep this note short I mention only two or three

More information

Powers of 2 with five distinct summands

Powers of 2 with five distinct summands ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3

More information

ZEROES OF INTEGER LINEAR RECURRENCES. 1. Introduction. 4 ( )( 2 1) n

ZEROES OF INTEGER LINEAR RECURRENCES. 1. Introduction. 4 ( )( 2 1) n ZEROES OF INTEGER LINEAR RECURRENCES DANIEL LITT Consider the integer linear recurrence 1. Introduction x n = x n 1 + 2x n 2 + 3x n 3 with x 0 = x 1 = x 2 = 1. For which n is x n = 0? Answer: x n is never

More information

arxiv: v3 [math.co] 23 Jun 2008

arxiv: v3 [math.co] 23 Jun 2008 BOUNDING MULTIPLICATIVE ENERGY BY THE SUMSET arxiv:0806.1040v3 [math.co] 23 Jun 2008 Abstract. We prove that the sumset or the productset of any finite set of real numbers, A, is at least A 4/3 ε, improving

More information

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition

More information

Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv: v2 [math.

Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv: v2 [math. Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv:0801.0728v2 [math.co] 31 Mar 2008 David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, and Misha Rudnev

More information

List coloring hypergraphs

List coloring hypergraphs List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University

More information

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION

SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION Copyright Cengage Learning. All rights reserved. SECTION 5.4 Strong Mathematical Induction and the Well-Ordering Principle for the Integers Copyright

More information

RAINBOW 3-TERM ARITHMETIC PROGRESSIONS. Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada.

RAINBOW 3-TERM ARITHMETIC PROGRESSIONS. Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada. RAINBOW 3-TERM ARITHMETIC PROGRESSIONS Veselin Jungić Department of Mathematics, Simon Fraser University, Burnaby, B.C., Canada vjungic@sfu.ca Radoš Radoičić Department of Mathematics, MIT, Cambridge,

More information

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases

Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases Writing proofs for MATH 51H Section 2: Set theory, proofs of existential statements, proofs of uniqueness statements, proof by cases September 22, 2018 Recall from last week that the purpose of a proof

More information

Regular matroids without disjoint circuits

Regular matroids without disjoint circuits Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if

More information

A lattice point problem and additive number theory

A lattice point problem and additive number theory A lattice point problem and additive number theory Noga Alon and Moshe Dubiner Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract

More information

Rectangles as Sums of Squares.

Rectangles as Sums of Squares. Rectangles as Sums of Squares. Mark Walters Peterhouse, Cambridge, CB2 1RD Abstract In this paper we examine generalisations of the following problem posed by Laczkovich: Given an n m rectangle with n

More information

arxiv: v1 [math.gm] 1 Oct 2015

arxiv: v1 [math.gm] 1 Oct 2015 A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence

More information

Induced subgraphs of prescribed size

Induced subgraphs of prescribed size Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum

More information

Rainbow Hamilton cycles in uniform hypergraphs

Rainbow Hamilton cycles in uniform hypergraphs Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie

More information

1 Basic Combinatorics

1 Basic Combinatorics 1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set

More information

1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA

1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical

More information

On judicious bipartitions of graphs

On judicious bipartitions of graphs On judicious bipartitions of graphs Jie Ma Xingxing Yu Abstract For a positive integer m, let fm be the maximum value t such that any graph with m edges has a bipartite subgraph of size at least t, and

More information

THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México

THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p. Mario Huicochea CINNMA, Querétaro, México #A8 INTEGERS 15A (2015) THE STRUCTURE OF RAINBOW-FREE COLORINGS FOR LINEAR EQUATIONS ON THREE VARIABLES IN Z p Mario Huicochea CINNMA, Querétaro, México dym@cimat.mx Amanda Montejano UNAM Facultad de Ciencias

More information

Remarks on a Ramsey theory for trees

Remarks on a Ramsey theory for trees Remarks on a Ramsey theory for trees János Pach EPFL, Lausanne and Rényi Institute, Budapest József Solymosi University of British Columbia, Vancouver Gábor Tardos Simon Fraser University and Rényi Institute,

More information

Avoider-Enforcer games played on edge disjoint hypergraphs

Avoider-Enforcer games played on edge disjoint hypergraphs Avoider-Enforcer games played on edge disjoint hypergraphs Asaf Ferber Michael Krivelevich Alon Naor July 8, 2013 Abstract We analyze Avoider-Enforcer games played on edge disjoint hypergraphs, providing

More information

GROWTH IN GROUPS I: SUM-PRODUCT. 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define

GROWTH IN GROUPS I: SUM-PRODUCT. 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define GROWTH IN GROUPS I: SUM-PRODUCT NICK GILL 1. A first look at growth Throughout these notes A is a finite set in a ring R. For n Z + Define } A + {{ + A } = {a 1 + + a n a 1,..., a n A}; n A } {{ A} = {a

More information

MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMUM AND TYPICAL VALUES (EXTENDED ABSTRACT)

MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMUM AND TYPICAL VALUES (EXTENDED ABSTRACT) MEASURES OF PSEUDORADOMESS FOR FIITE SEQUECES: MIIMUM AD TYPICAL VALUES (EXTEDED ABSTRACT) Y. KOHAYAKAWA, C. MAUDUIT, C. G. MOREIRA, AD V. RÖDL Dedicated to Professor Imre Simon on the occasion of his

More information

On a Conjecture of Thomassen

On a Conjecture of Thomassen On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,

More information

Kiddie Talk - The Diamond Lemma and its applications

Kiddie Talk - The Diamond Lemma and its applications Kiddie Tal - The Diamond Lemma and its applications April 22, 2013 1 Intro Start with an example: consider the following game, a solitaire. Tae a finite graph G with n vertices and a function e : V (G)

More information

A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES

A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9939(XX)0000-0 A NOTE ON THE TURÁN FUNCTION OF EVEN CYCLES OLEG PIKHURKO Abstract. The Turán function ex(n, F

More information

CHAPTER 8: EXPLORING R

CHAPTER 8: EXPLORING R CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed

More information

Disjoint Subgraphs in Sparse Graphs 1

Disjoint Subgraphs in Sparse Graphs 1 Disjoint Subgraphs in Sparse Graphs 1 Jacques Verstraëte Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 OWB, UK jbav2@dpmms.cam.ac.uk

More information

Graph coloring, perfect graphs

Graph coloring, perfect graphs Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive

More information

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication

are Banach algebras. f(x)g(x) max Example 7.4. Similarly, A = L and A = l with the pointwise multiplication 7. Banach algebras Definition 7.1. A is called a Banach algebra (with unit) if: (1) A is a Banach space; (2) There is a multiplication A A A that has the following properties: (xy)z = x(yz), (x + y)z =

More information

Ch 3.2: Direct proofs

Ch 3.2: Direct proofs Math 299 Lectures 8 and 9: Chapter 3 0. Ch3.1 A trivial proof and a vacuous proof (Reading assignment) 1. Ch3.2 Direct proofs 2. Ch3.3 Proof by contrapositive 3. Ch3.4 Proof by cases 4. Ch3.5 Proof evaluations

More information

(1) is an invertible sheaf on X, which is generated by the global sections

(1) is an invertible sheaf on X, which is generated by the global sections 7. Linear systems First a word about the base scheme. We would lie to wor in enough generality to cover the general case. On the other hand, it taes some wor to state properly the general results if one

More information

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS

ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements

More information

Fermat numbers and integers of the form a k + a l + p α

Fermat numbers and integers of the form a k + a l + p α ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac

More information

arxiv: v2 [math.nt] 21 May 2016

arxiv: v2 [math.nt] 21 May 2016 arxiv:165.156v2 [math.nt] 21 May 216 PROGRESSION-FREE SETS IN Z n 4 ARE EXPONENTIALLY SMALL ERNIE CROOT, VSEVOLOD F. LEV, AND PÉTER PÁL PACH Abstract. We show that for integer n 1, any subset A Z n 4 free

More information

AVOIDING 3-TERM GEOMETRIC PROGRESSIONS IN NON-COMMUTATIVE SETTINGS

AVOIDING 3-TERM GEOMETRIC PROGRESSIONS IN NON-COMMUTATIVE SETTINGS AVOIDING 3-TERM GEOMETRIC PROGRESSIONS IN NON-COMMUTATIVE SETTINGS MEGUMI ASADA, EVA FOURAKIS, ELI GOLDSTEIN, SARAH MANSKI, NATHAN MCNEW, STEVEN J. MILLER, AND GWYNETH MORELAND ABSTRACT. Several recent

More information

CSE 20 DISCRETE MATH SPRING

CSE 20 DISCRETE MATH SPRING CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Describe computer representation of sets with bitstrings Define and compute the cardinality of finite

More information

Every 3-connected, essentially 11-connected line graph is hamiltonian

Every 3-connected, essentially 11-connected line graph is hamiltonian Every 3-connected, essentially 11-connected line graph is hamiltonian Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou October 2, 25 Abstract Thomassen conjectured that every 4-connected line graph is hamiltonian.

More information

6 CARDINALITY OF SETS

6 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 information

Small Cycle Cover of 2-Connected Cubic Graphs

Small Cycle Cover of 2-Connected Cubic Graphs . Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of

More information

DR.RUPNATHJI( DR.RUPAK NATH )

DR.RUPNATHJI( DR.RUPAK NATH ) Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

More information

Bipartite decomposition of random graphs

Bipartite decomposition of random graphs Bipartite decomposition of random graphs Noga Alon Abstract For a graph G = (V, E, let τ(g denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of G so that each edge of G belongs

More information

A SHARP RESULT ON m-covers. Hao Pan and Zhi-Wei Sun

A SHARP RESULT ON m-covers. Hao Pan and Zhi-Wei Sun Proc. Amer. Math. Soc. 35(2007), no., 355 3520. A SHARP RESULT ON m-covers Hao Pan and Zhi-Wei Sun Abstract. Let A = a s + Z k s= be a finite system of arithmetic sequences which forms an m-cover of Z

More information

Equations and Inequalities

Equations and Inequalities Chapter 3 Equations and Inequalities Josef Leydold Bridging Course Mathematics WS 2018/19 3 Equations and Inequalities 1 / 61 Equation We get an equation by equating two terms. l.h.s. = r.h.s. Domain:

More information

SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P

SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P SUM-PRODUCT ESTIMATES APPLIED TO WARING S PROBLEM MOD P TODD COCHRANE AND CHRISTOPHER PINNER Abstract. Let γ(k, p) denote Waring s number (mod p) and δ(k, p) denote the ± Waring s number (mod p). We use

More information

Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights

Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Discrete Mathematics and Theoretical Computer Science DMTCS vol. 17:3, 2015, 1 12 Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights Hongliang Lu School of Mathematics and Statistics,

More information

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same

More information

Rainbow Hamilton cycles in uniform hypergraphs

Rainbow Hamilton cycles in uniform hypergraphs Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie

More information

NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES

NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs

More information

INTERMINGLED ASCENDING WAVE M-SETS. Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York

INTERMINGLED ASCENDING WAVE M-SETS. Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York INTERMINGLED ASCENDING WAVE M-SETS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu and Caitlin Cremin, Will Daniel, and Quer Xiang 1 Abstract Given

More information

Theorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies,

Theorem (Special Case of Ramsey s Theorem) R(k, l) is finite. Furthermore, it satisfies, Math 16A Notes, Wee 6 Scribe: Jesse Benavides Disclaimer: These notes are not nearly as polished (and quite possibly not nearly as correct) as a published paper. Please use them at your own ris. 1. Ramsey

More information