Ramsey theory. Andrés Eduardo Caicedo. Undergraduate Math Seminar, March 22, Department of Mathematics Boise State University
|
|
- Derrick Crawford
- 5 years ago
- Views:
Transcription
1 Andrés Eduardo Department of Mathematics Boise State University Undergraduate Math Seminar, March 22, 2012
2 Thanks to the NSF for partial support through grant DMS My work is mostly in set theory, but I am also interested in finite combinatorics. can be seen as part of both these fields.
3 Shameful self-promotion: Next term, I ll be teaching a topics course on set theory, centered on. Please contact me if you think you d be interested in taking the course.
4 This is the news I woke up to yesterday: professor wins prestig.html
5
6 Szemerédi s most famous theorem is at the heart of. It is a strengthening of the following result of van der Warden: Theorem (van der Waerden, 1927) Suppose the natural numbers are split into finitely many sets, N = A 1 A 2 A k. Then at least one of the sets A i contains arbitrarily large arithmetic progressions.
7 Recall that an arithmetic progression is a sequence of numbers of the form a, a + b, a + 2b,..., a + kb. For certain partitions, it is easy to verify the theorem. For example, N = Even Odd, and both sets contain arithmetic progressions of any length (in fact, both contain an infinite progression).
8 For another example, N = Squares Non-squares. In this case, the non-squares contain arbitrarily large progressions, because the gaps between squares get larger and larger.
9 Aside: What about the squares? Do they also contain arbitrarily large progressions? Here is an example of length 3: 1 2 = 1, 5 2 = 25 = , 7 2 = 49 =
10 Aside: What about the squares? Do they also contain arbitrarily large progressions? Here is an example of length 3: 1 2 = 1, 5 2 = 25 = , 7 2 = 49 =
11 Aside: What about the squares? Do they also contain arbitrarily large progressions? Here is an example of length 3: 1 2 = 1, 5 2 = 25 = , 7 2 = 49 = Fermat asked in 1640 whether we could find an example of length 4. Euler proved that this is not the case.
12 Aside: What about the squares? Do they also contain arbitrarily large progressions? Here is an example of length 3: 1 2 = 1, 5 2 = 25 = , 7 2 = 49 = Fermat asked in 1640 whether we could find an example of length 4. Euler proved that this is not the case.
13 Of course, the strength of van der Waerden s theorem comes from the fact that it applies to all possible partitions, even into sets for which no nice structure is apparent. It is then natural to ask whether there is a way, given a partition N = A 1... A k, to identify a piece A i with arbitrarily large progressions.
14 Of course, the strength of van der Waerden s theorem comes from the fact that it applies to all possible partitions, even into sets for which no nice structure is apparent. It is then natural to ask whether there is a way, given a partition N = A 1... A k, to identify a piece A i with arbitrarily large progressions.
15 First attempt: Maybe one of the A i actually contains an infinite progression. Counterexample: N = A B, where A = {1, 3, 4, 7, 8, 9, 13, 14, 15, 16,... } and B = {2, 5, 6, 10, 11, 12, 17, 18, 19, 20,... }.
16 First attempt: Maybe one of the A i actually contains an infinite progression. Counterexample: N = A B, where A = {1, 3, 4, 7, 8, 9, 13, 14, 15, 16,... } and B = {2, 5, 6, 10, 11, 12, 17, 18, 19, 20,... }.
17 First attempt: Maybe one of the A i actually contains an infinite progression. Counterexample: N = A B, where A = {1, 3, 4, 7, 8, 9, 13, 14, 15, 16,... } and B = {2, 5, 6, 10, 11, 12, 17, 18, 19, 20,... }.
18 Paul Erdős and Paul Turán proposed a different attempt.
19 A set A N has density δ iff A {1,..., n} lim = δ. n n This notion is too restrictive; many sets do not have density. More generally, we can say that A has positive upper density iff there is a sequence k 1 < k 2 < k 3 <... such that A {1,..., k n } lim > 0. n k n The usefulness of the notion comes from the fact that if N = A 1 A k, then at least one of the A i has positive upper density. Would this suffice to ensure the presence of progressions?
20 A set A N has density δ iff A {1,..., n} lim = δ. n n This notion is too restrictive; many sets do not have density. More generally, we can say that A has positive upper density iff there is a sequence k 1 < k 2 < k 3 <... such that A {1,..., k n } lim > 0. n k n The usefulness of the notion comes from the fact that if N = A 1 A k, then at least one of the A i has positive upper density. Would this suffice to ensure the presence of progressions?
21 A set A N has density δ iff A {1,..., n} lim = δ. n n This notion is too restrictive; many sets do not have density. More generally, we can say that A has positive upper density iff there is a sequence k 1 < k 2 < k 3 <... such that A {1,..., k n } lim > 0. n k n The usefulness of the notion comes from the fact that if N = A 1 A k, then at least one of the A i has positive upper density. Would this suffice to ensure the presence of progressions?
22 Theorem (Szemerédi, 1975) If A N has positive upper density, then it contains arbitrarily large arithmetic progressions.
23
24 As a silly example, if A is the set of squares, then A {1,..., n} n 1 n 0, which means that N \ A contains arbitrarily large arithmetic progressions. (This example is silly, because one can prove this by much easier methods.)
25 The theorem admits a refinement: Theorem Suppose that 0 < δ < 1 and n are given. Then there is an N large enough such that if A {1,..., N} N δ, then A contains an arithmetic progression of length n.
26 During the Abel prize awarding ceremony, Timothy Gowers presented Szemerédi s work. Here is how he explained this result: Imagine the following one-player game. You are told a small number, such as 5, and a large number, such as 10,000. Your job is to choose as many integers between 1 and 10,000 as you can, and the one rule that you must obey is that from the integers you choose it should not be possible to create a five-term arithmetic progression. For example, if you were accidentally to choose the numbers 101, 1103, 2105, 3107 and 4109 (amongst others), then you would have lost, because these numbers form a five-term progression with step size Obviously you are destined to lose this game eventually. But Szemerédi s theorem tells us something far more interesting: even if you play with the best possible progression-avoiding strategy, you will lose long before you get anywhere near choosing all the numbers.
27 Paul Erdős was not a rich man, but he used to assign a monetary reward to his questions. As Wikipedia tells us: These ranged from $25 for problems that he felt were just out of the reach of current mathematical thinking, to several thousand dollars for problems that were both difficult to attack and mathematically significant. There are thought to be at least a thousand such outstanding prizes, though there is no official or comprehensive list. The prizes remain active despite Erdős s death; Ronald Graham is the (informal) administrator of solutions. Winners can get either a check signed by Erdős (for framing only) or a cashable check from Graham.
28 Szemerédi s theorem earned Szemerédi an Erdős prize of $1,000. This is not the end of the story. Because some sets A N contain arbitrarily large progressions, even though they have density 0. For an easy example, consider A = { 1, 10 10, , , , , , , , ,... }.
29 Szemerédi s theorem earned Szemerédi an Erdős prize of $1,000. This is not the end of the story. Because some sets A N contain arbitrarily large progressions, even though they have density 0. For an easy example, consider A = { 1, 10 10, , , , , , , , ,... }.
30 Szemerédi s theorem earned Szemerédi an Erdős prize of $1,000. This is not the end of the story. Because some sets A N contain arbitrarily large progressions, even though they have density 0. For an easy example, consider A = { 1, 10 10, , , , , , , , ,... }.
31 The prime number theorem tells us that if A is the set of primes, then A {1,..., n} n 1 log n, so the primes have density 0. Are there arbitrarily large arithmetic progressions of prime numbers?
32 The prime number theorem tells us that if A is the set of primes, then A {1,..., n} n 1 log n, so the primes have density 0. Are there arbitrarily large arithmetic progressions of prime numbers?
33 This question was recently solved by Terence Tao and Benjamin Green.
34 Theorem (Green-Tao, 2004) The primes contain arbitrarily large arithmetic progressions.
35 Not even this is the end of the story. There is a natural notion of largeness, different from positive upper density, under which the prime numbers are actually large: Recall that the harmonic series diverges, that is, = +. It is a famous theorem of Euler that the same is true of the series of reciprocals of primes: = +.
36 Not even this is the end of the story. There is a natural notion of largeness, different from positive upper density, under which the prime numbers are actually large: Recall that the harmonic series diverges, that is, = +. It is a famous theorem of Euler that the same is true of the series of reciprocals of primes: = +.
37 Not even this is the end of the story. There is a natural notion of largeness, different from positive upper density, under which the prime numbers are actually large: Recall that the harmonic series diverges, that is, = +. It is a famous theorem of Euler that the same is true of the series of reciprocals of primes: = +.
38 The highest Erdős prize is $5,000. It will be awarded for a proof (or disproof) of the following conjecture: Suppose A N and n A 1 n = +. Then A contains arbitrarily large arithmetic progressions.
39 Currently, we do not even know if the condition implies that A contains a progression of length 3. Naively, one would think that if A is built greedily to avoid 3-term arithmetic progressions, then n A 1 n 1 n n B for any other B without 3-term arithmetic progressions, and so it would suffice to check that the first sum converges.
40 This greedy set A starts 1,2,4,5,10,11,13,... In fact, A consists precisely of those n such that n 1 only has 1s and 0s in its base 3 representation. One has < 1 n < n A Unfortunately (?), Wróblewski built in 1983 a set B with no 3-term progressions, with n B 1 n > Currently, we do not know how much higher one can reach.
41 This greedy set A starts 1,2,4,5,10,11,13,... In fact, A consists precisely of those n such that n 1 only has 1s and 0s in its base 3 representation. One has < 1 n < n A Unfortunately (?), Wróblewski built in 1983 a set B with no 3-term progressions, with n B 1 n > Currently, we do not know how much higher one can reach.
42 This greedy set A starts 1,2,4,5,10,11,13,... In fact, A consists precisely of those n such that n 1 only has 1s and 0s in its base 3 representation. One has < 1 n < n A Unfortunately (?), Wróblewski built in 1983 a set B with no 3-term progressions, with n B 1 n > Currently, we do not know how much higher one can reach.
43 Ok. So... What is?
44 Whereas the entropy theorems of probability theory and mathematical physics imply that, in a large universe, disorder is probable, certain combinatorial theorems show that complete disorder is impossible. T.S. Motzkin (1967)
45 Indeed one can view as the study of generalizations and repeated applications of the pigeonhole principle. Tao-Vu (2006)
46 The pigeonhole principle If sufficiently many objects are distributed over not too many classes, then at least one class contains many of these objects. The principle was first stated by Dirichlet in 1834, who called it the Schubfachprinzip.
47 Dirichlet used the principle to prove a result on Diophantine approximation. Given a real α, let α denote the closest distance from α to an integer. Theorem (Dirichlet) For any real α and k N there is a positive integer m k such that mα 1 k + 1. If α is irrational, this implies that there are infinitely many fractions n/m such that α n < 1 m m 2. These fractions are closely related to the continued fraction of α.
48 For example: π = Its convergents are 3, , , = 3, 22 7, , = 15 3, , ,....
49 Note that π 3 1 < 1, π 22 7 = < 1 49 = , π = < = ,...
50 Thus for any irrational α, we can find infinitely many fractions n m with α n < 1 m m 2. On the other hand, a deep number theoretic result, the Thue-Siegel-Roth theorem, states that if α is irrational and algebraic, then the equation α n < 1 m m 2+ɛ has only finitely many solutions for any ɛ > 0. One of the key ingredients of the proof is the construction of what is called an auxiliary function. Curiously, one of the main steps of the construction is an application of the pigeonhole principle.
51 The typical framework of a problem in is as follows: Given a certain size, a large structure is partitioned (colored) into a small number of pieces. Must it be the case that there is a monochromatic substructure of the given size? For example, if the structures are arithmetic progressions, van der Waerden s theorem is precisely an affirmative answer.
52 Ramsey s theorem, the result from which the field takes its name, is a generalization of the following statement: Given a number n, let K n denote the complete graph on n-vertices, and let K n denote the graph on n-vertices with no edges. Theorem (Ramsey) For any n, m there is an M so large that any graph on M vertices either contains a copy of K n, or a copy of K m.
53 Theorem (Ramsey) For any n, m there is an M so large that any graph on M vertices either contains a copy of K n, or a copy of K m. This is another instance of the framework mentioned before: Now we have complete graphs as structures, and we are splitting the graph into two pieces. The smallest M as above is the Ramsey number R(n, m). Clearly, R(n, m) = R(m, n), R(1, m) = 1, and R(2, m) = m.
54 Frank Plumpton Ramsey (22 Feb., Jan., 1930). Philosopher, Economist, Mathematician.
55 Statements of the form R(n, m) M are usually stated in the following way: In any party of at least M people, either there are n that know each other, or else there are m that do not know one another. We can also think of them as follows: Color each edge of K M red or blue. Then there is either a red copy of K n, or a blue copy of K m. Let s see some examples.
56 R(3, 3) = 6. That it is at least 6 follows from considering the following graph:
57 R(3, 3) = 6. That it is at most 6 follows from noticing that in any coloring of K 6, there must be 3 edges from the same vertex with the same color:
58 R(3, 4) = 9. That it is at least 9 follows from considering the following graph:
59 R(4, 3) = 9. That it is at most 10 follows from considering the following: To see that it is at most 9 is a bit more involved.
60 R(4, 4) = 18. That it is at least 18 follows from considering the following graph:
61 R(3, 5) = 14, R(3, 6) = 18, R(3, 7) = 23, R(3, 8) = 28, R(3, 9) = R(3, 10) 43. R(4, 5) = 25, 35 R(4, 6) 41. That R(4, 5) 25 was proved by Kalbfleisch in That R(4, 5) 25 was proved by McKay and Radziszowski in Computers were used in an essential fashion.
62 R(3, 5) = 14, R(3, 6) = 18, R(3, 7) = 23, R(3, 8) = 28, R(3, 9) = R(3, 10) 43. R(4, 5) = 25, 35 R(4, 6) 41. That R(4, 5) 25 was proved by Kalbfleisch in That R(4, 5) 25 was proved by McKay and Radziszowski in Computers were used in an essential fashion.
63 R(3, 5) = 14, R(3, 6) = 18, R(3, 7) = 23, R(3, 8) = 28, R(3, 9) = R(3, 10) 43. R(4, 5) = 25, 35 R(4, 6) 41. That R(4, 5) 25 was proved by Kalbfleisch in That R(4, 5) 25 was proved by McKay and Radziszowski in Computers were used in an essential fashion.
64 R(3, 5) = 14, R(3, 6) = 18, R(3, 7) = 23, R(3, 8) = 28, R(3, 9) = R(3, 10) 43. R(4, 5) = 25, 35 R(4, 6) 41. That R(4, 5) 25 was proved by Kalbfleisch in That R(4, 5) 25 was proved by McKay and Radziszowski in Computers were used in an essential fashion.
65 The two implementations required 3.2 years and 6 years of cpu time on Sun Microsystems computers (mostly Sparcstation SLC). This was achieved without undue delay by employing a large number of computers (up to 110 at once). McKay-Radziszowski (1993)
66 43 R(5, 5) R(6, 6) 165. Suppose aliens invade the Earth and threaten to destroy it in a year if human beings do not find R(5, 5). It is (probably) possible to save the Earth by putting together the world s best minds and computers. If, however, the invaders were to demand R(6, 6), the human beings might as well attempt a preemptive strike without even trying to ponder the problem. P. Erdős (1993)
67 43 R(5, 5) R(6, 6) 165. Suppose aliens invade the Earth and threaten to destroy it in a year if human beings do not find R(5, 5). It is (probably) possible to save the Earth by putting together the world s best minds and computers. If, however, the invaders were to demand R(6, 6), the human beings might as well attempt a preemptive strike without even trying to ponder the problem. P. Erdős (1993)
68 43 R(5, 5) R(6, 6) 165. Suppose aliens invade the Earth and threaten to destroy it in a year if human beings do not find R(5, 5). It is (probably) possible to save the Earth by putting together the world s best minds and computers. If, however, the invaders were to demand R(6, 6), the human beings might as well attempt a preemptive strike without even trying to ponder the problem. P. Erdős (1993)
69 In general, we know that m 1 (n)2 n/2 < R(n, n) < m 2 (n)2 2n where m 1, m 2 are modest functions of n, by which I simply mean that they are small compared to the exponential term. This means that, if lim R(n, n)1/n n exists, then it is somewhere between 2 and 4. Ronald Graham offers a $100 prize for a proof that lim R(n, n)1/n n exists, and a prize of $250 for a computation of this limit.
70 In general, we know that m 1 (n)2 n/2 < R(n, n) < m 2 (n)2 2n where m 1, m 2 are modest functions of n, by which I simply mean that they are small compared to the exponential term. This means that, if lim R(n, n)1/n n exists, then it is somewhere between 2 and 4. Ronald Graham offers a $100 prize for a proof that lim R(n, n)1/n n exists, and a prize of $250 for a computation of this limit.
71 Here is an easy application of Ramsey s theorem: Suppose that X is an infinite linear order. Then it either contains an infinite increasing sequence, or an infinite decreasing sequence. That is, X contains a copy of N, or a copy of the negative integers. What if X is a nice order? Suppose that the rationals are split into two sets. Then one of the sets contains a copy of the rationals.
72 Here is an easy application of Ramsey s theorem: Suppose that X is an infinite linear order. Then it either contains an infinite increasing sequence, or an infinite decreasing sequence. That is, X contains a copy of N, or a copy of the negative integers. What if X is a nice order? Suppose that the rationals are split into two sets. Then one of the sets contains a copy of the rationals.
73 Here is an easy application of Ramsey s theorem: Suppose that X is an infinite linear order. Then it either contains an infinite increasing sequence, or an infinite decreasing sequence. That is, X contains a copy of N, or a copy of the negative integers. What if X is a nice order? Suppose that the rationals are split into two sets. Then one of the sets contains a copy of the rationals.
74 Let K Q be the complete graph with set of vertices Q. Theorem (Galvin) Color the edges of K Q using finitely many colors. Then there is a copy of Q that uses at most 2 colors. (By the way, this is one of the results I expect to discuss in detail during the course next term.)
75 has many applications in number theory, analysis, and algebra. For example, beyond the pigeonhole principle, the earliest recorded Ramsey theoretic result is due to Hilbert. He used it as a lemma towards a proof of the irreducibility of certain polynomials.
76
77 An n-dimensional affine cube is a set Q Z for which there exist a, x 1,..., x n N such that Q = {a + i F x i F {1,..., n}}. Theorem (Hilbert) For every pair of positive integers r, n, there exists an M such that if {1,..., M} is colored with at most r colors, then there is a monochromatic n-dimensional affine cube.
78 Let s go back to the first result we mentioned. Theorem (Van der Waerden) For any n, r there is an N such that if {1, 2,..., N} is split into r pieces, then one of the pieces contains an arithmetic progression of size at least n. Call W (n, r) the smallest possible N.
79 Not much is known in terms of bounds. The original proof is a double induction and gives an Ackermannian bound.
80 Ackermannian bounds are as bad as they get. For example, the diagram above shows that W (3, 3) 7( )(2 3 7( ) + 1) Actually, W (3, 3) = 27.
81 Ackermannian bounds are as bad as they get. For example, the diagram above shows that W (3, 3) 7( )(2 3 7( ) + 1) Actually, W (3, 3) = 27.
82 Van der Waerden s proof is from In 1988, Shelah found a new proof that gives much better bounds (still huge). For example, even for two colors, the bounds obtained by Shelah are given by towers of towers of powers of 2. In general, he obtains bounds that are towers of towers of towers of powers of 2.
83 The best known bounds are due to Timothy Gowers. In work from the early 2000s, Gowers established that W (n, 2) n+9.
84 Ronald Graham conjectures that W (n, 2) 2 n2. He offers $1000 for a proof of the conjecture.
85
Ramsey theory. Andrés Eduardo Caicedo. Graduate Student Seminar, October 19, Department of Mathematics Boise State University
Andrés Eduardo Department of Mathematics Boise State University Graduate Student Seminar, October 19, 2011 Thanks to the NSF for partial support through grant DMS-0801189. My work is mostly in set theory,
More informationSchur s Theorem and Related Topics in Ramsey Theory
Schur s Theorem and Related Topics in Ramsey Theory Summer Lynne Kisner Advisor: Dr. Andrés E. Caicedo Boise State University March 4, 2013 Acknowledgments Advisor: Dr. Caicedo Committee: Dr. Scheepers
More informationPigeonhole Principle and Ramsey Theory
Pigeonhole Principle and Ramsey Theory The Pigeonhole Principle (PP) has often been termed as one of the most fundamental principles in combinatorics. The familiar statement is that if we have n pigeonholes
More informationMonochromatic and Rainbow Colorings
Chapter 11 Monochromatic and Rainbow Colorings There are instances in which we will be interested in edge colorings of graphs that do not require adjacent edges to be assigned distinct colors Of course,
More informationThe Probabilistic Method
The Probabilistic Method In Graph Theory Ehssan Khanmohammadi Department of Mathematics The Pennsylvania State University February 25, 2010 What do we mean by the probabilistic method? Why use this method?
More informationOn 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 informationWhat we still don t know about addition and multiplication. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
What we still don t know about addition and multiplication Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA You would think that all of the issues surrounding addition and multiplication were
More informationGraph Theory. Thomas Bloom. February 6, 2015
Graph Theory Thomas Bloom February 6, 2015 1 Lecture 1 Introduction A graph (for the purposes of these lectures) is a finite set of vertices, some of which are connected by a single edge. Most importantly,
More informationapproximation of the dimension. Therefore, we get the following corollary.
INTRODUCTION In the last five years, several challenging problems in combinatorics have been solved in an unexpected way using polynomials. This new approach is called the polynomial method, and the goal
More informationRAMSEY THEORY: VAN DER WAERDEN S THEOREM AND THE HALES-JEWETT THEOREM
RAMSEY THEORY: VAN DER WAERDEN S THEOREM AND THE HALES-JEWETT THEOREM MICHELLE LEE ABSTRACT. We look at the proofs of two fundamental theorems in Ramsey theory, Van der Waerden s Theorem and the Hales-Jewett
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationErdős and arithmetic progressions
Erdős and arithmetic progressions W. T. Gowers University of Cambridge July 2, 2013 W. T. Gowers (University of Cambridge) Erdős and arithmetic progressions July 2, 2013 1 / 22 Two famous Erdős conjectures
More informationSums and products: What we still don t know about addition and multiplication
Sums and products: What we still don t know about addition and multiplication Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Based on joint work with R. P. Brent, P. Kurlberg, J. C. Lagarias,
More informationSome Elementary Problems (Solved and Unsolved) in Number Theory and Geometry
Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry Paul Erdös The Hungarian Academy of Science and Technion, Haifa Dedicated to the memory of Prof. J. Gillis Mathematics is full
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 informationPaul Erdős and Graph Ramsey Theory
Paul Erdős and Graph Ramsey Theory Benny Sudakov ETH and UCLA Ramsey theorem Ramsey theorem Definition: The Ramsey number r(s, n) is the minimum N such that every red-blue coloring of the edges of a complete
More informationSECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS
(Chapter 9: Discrete Math) 9.11 SECTION 9.2: ARITHMETIC SEQUENCES and PARTIAL SUMS PART A: WHAT IS AN ARITHMETIC SEQUENCE? The following appears to be an example of an arithmetic (stress on the me ) sequence:
More informationRamsey Numbers. Introduction. Author: John G. Michaels, Department of Mathematics, State University of New York, College at Brockport.
8 Ramsey Numbers Author: John G. Michaels, Department of Mathematics, State University of New York, College at Brockport. Prerequisites: The prerequisites for this chapter are the pigeonhole principle
More informationInevitable patterns in mathematics. Some topics in Ramsey theory
Inevitable patterns in mathematics Some topics in Ramsey theory These notes cover an ambitious guess at what we might get through in the course 1. It is quite likely that we will not manage it all in which
More informationRoth s Theorem on 3-term Arithmetic Progressions
Roth s Theorem on 3-term Arithmetic Progressions Mustazee Rahman 1 Introduction This article is a discussion about the proof of a classical theorem of Roth s regarding the existence of three term arithmetic
More informationVariants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems Dhruv Mubayi December 19, 2016 Abstract Given integers l, n, the lth power of the path P n is the ordered graph Pn l with vertex set v 1
More informationRAMSEY THEORY. Contents 1. Introduction Arithmetic Ramsey s Theorem
RAMSEY THEORY CAN LIU Abstract. We give a proof to arithmetic Ramsey s Theorem. In addition, we show the proofs for Schur s Theorem, the Hales-Jewett Theorem, Van der Waerden s Theorem and Rado s Theorem,
More informationSUMS OF SQUARES WUSHI GOLDRING
SUMS OF SQUARES WUSHI GOLDRING 1. Introduction Here are some opening big questions to think about: Question 1. Which positive integers are sums of two squares? Question 2. Which positive integers are sums
More informationA Working Knowledge of Computational Complexity for an Optimizer
A Working Knowledge of Computational Complexity for an Optimizer ORF 363/COS 323 Instructor: Amir Ali Ahmadi 1 Why computational complexity? What is computational complexity theory? It s a branch of mathematics
More informationMath 262: Topics in Combinatorial Mathematics
Math 262: Topics in Combinatorial Mathematics Lectures by Fan Chung Graham Compiled and Edited by Robert Ellis University of California at San Diego Spring Quarter 2002 Contents 1 Introduction to Ramsey
More informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
More informationRamsey Unsaturated and Saturated Graphs
Ramsey Unsaturated and Saturated Graphs P Balister J Lehel RH Schelp March 20, 2005 Abstract A graph is Ramsey unsaturated if there exists a proper supergraph of the same order with the same Ramsey number,
More informationBrown s lemma in reverse mathematics
Brown s lemma in reverse mathematics Emanuele Frittaion Sendai Logic School 2016 Emanuele Frittaion (Tohoku University) 1 / 25 Brown s lemma asserts that piecewise syndetic sets are partition regular,
More informationCombinatorial Number Theory in China
Combinatorial Number Theory in China Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun Nov. 6, 2009 While in the past many of the basic combinatorial
More informationContest Number Theory
Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,
More informationThe Hales-Jewett Theorem
The Hales-Jewett Theorem A.W. HALES & R.I. JEWETT 1963 Regularity and positional games Trans. Amer. Math. Soc. 106, 222-229 Hales-Jewett Theorem, SS04 p.1/35 Importance of HJT The Hales-Jewett theorem
More informationImpact of Women in Number Theory
Impact of Women in Number Theory Allysa Lumley Impact of Women Mathematicians on Research and Education in Mathematics BIRS 2018 March 17, 2018 Allysa Lumley (York) Impact of Women in Number Theory March
More informationR(p, k) = the near regular complete k-partite graph of order p. Let p = sk+r, where s and r are positive integers such that 0 r < k.
MATH3301 EXTREMAL GRAPH THEORY Definition: A near regular complete multipartite graph is a complete multipartite graph with orders of its partite sets differing by at most 1. R(p, k) = the near regular
More informationVAN DER WAERDEN S THEOREM.
VAN DER WAERDEN S THEOREM. REU SUMMER 2005 An arithmetic progression (AP) of length k is a set of the form A = {a, a+d,..., a+(k 1)d} which we ll also denote by A = a+[0, k 1]d. A basic result due to Van
More informationPutnam Greedy Algorithms Cody Johnson. Greedy Algorithms. May 30, 2016 Cody Johnson.
1 Introduction Greedy Algorithms May 0, 2016 Cody Johnson ctj@math.cmu.edu A greedy algorithm is an algorithm that chooses the optimal choice in the short run. 2 Examples 1. Prove that every nonnegative
More informationSzemerédi s regularity lemma revisited. Lewis Memorial Lecture March 14, Terence Tao (UCLA)
Szemerédi s regularity lemma revisited Lewis Memorial Lecture March 14, 2008 Terence Tao (UCLA) 1 Finding models of large dense graphs Suppose we are given a large dense graph G = (V, E), where V is a
More informationExample. How to Guess What to Prove
How to Guess What to Prove Example Sometimes formulating P (n) is straightforward; sometimes it s not. This is what to do: Compute the result in some specific cases Conjecture a generalization based on
More informationMath Real Analysis
1 / 28 Math 370 - Real Analysis G.Pugh Sep 3 2013 Real Analysis 2 / 28 3 / 28 What is Real Analysis? Wikipedia: Real analysis... has its beginnings in the rigorous formulation of calculus. It is a branch
More informationATLANTA LECTURE SERIES In Combinatorics and Graph Theory (XIX)
ATLANTA LECTURE SERIES In Combinatorics and Graph Theory (XIX) April 22-23, 2017 GEORGIA STATE UNIVERSITY Department of Mathematics and Statistics Sponsored by National Security Agency and National Science
More informationThe Erdős-Hajnal hypergraph Ramsey problem
The Erdős-Hajnal hypergraph Ramsey problem Dhruv Mubayi Andrew Suk February 28, 2016 Abstract Given integers 2 t k +1 n, let g k (t, n) be the minimum N such that every red/blue coloring of the k-subsets
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationCertainty from uncertainty: the probabilistic method
Certainty from uncertainty: the probabilistic method Lily Silverstein UC Davis Nov 9, 2017 Seattle University 0 / 17 Ramsey numbers 1 / 17 Ramsey numbers A graph is a set of vertices {1,..., n} and edges
More informationNonstandard Methods in Combinatorics of Numbers: a few examples
Nonstandard Methods in Combinatorics of Numbers: a few examples Università di Pisa, Italy RaTLoCC 2011 Bertinoro, May 27, 2011 In combinatorics of numbers one can find deep and fruitful interactions among
More informationTable of Contents. 2013, Pearson Education, Inc.
Table of Contents Chapter 1 What is Number Theory? 1 Chapter Pythagorean Triples 5 Chapter 3 Pythagorean Triples and the Unit Circle 11 Chapter 4 Sums of Higher Powers and Fermat s Last Theorem 16 Chapter
More informationMonochromatic Forests of Finite Subsets of N
Monochromatic Forests of Finite Subsets of N Tom C. Brown Citation data: T.C. Brown, Monochromatic forests of finite subsets of N, INTEGERS - Elect. J. Combin. Number Theory 0 (2000), A4. Abstract It is
More informationAt the start of the term, we saw the following formula for computing the sum of the first n integers:
Chapter 11 Induction This chapter covers mathematical induction. 11.1 Introduction to induction At the start of the term, we saw the following formula for computing the sum of the first n integers: Claim
More informationMONOCHROMATIC FORESTS OF FINITE SUBSETS OF N
MONOCHROMATIC FORESTS OF FINITE SUBSETS OF N Tom C. Brown Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC Canada V5A 1S6 tbrown@sfu.ca Received: 2/3/00, Revised: 2/29/00,
More informationCantor and Infinite Sets
Cantor and Infinite Sets Galileo and the Infinite There are many whole numbers that are not perfect squares: 2, 3, 5, 6, 7, 8, 10, 11, and so it would seem that all numbers, including both squares and
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More informationSection Summary. Proof by Cases Existence Proofs
Section 1.8 1 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Uniqueness Proofs Proving Universally Quantified Assertions Proof Strategies sum up
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More informationRoth s Theorem on Arithmetic Progressions
September 25, 2014 The Theorema of Szemerédi and Roth For Λ N the (upper asymptotic) density of Λ is the number σ(λ) := lim sup N Λ [1, N] N [0, 1] The Theorema of Szemerédi and Roth For Λ N the (upper
More informationSign of derivative test: when does a function decreases or increases:
Sign of derivative test: when does a function decreases or increases: If for all then is increasing on. If for all then is decreasing on. If then the function is not increasing or decreasing at. We defined
More informationResolving a conjecture on degree of regularity of linear homogeneous equations
Resolving a conjecture on degree of regularity of linear homogeneous equations Noah Golowich MIT-PRIMES, Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. Submitted:
More informationRamsey theory and the geometry of Banach spaces
Ramsey theory and the geometry of Banach spaces Pandelis Dodos University of Athens Maresias (São Paulo), August 25 29, 2014 1.a. The Hales Jewett theorem The following result is due to Hales & Jewett
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationThe dichotomy between structure and randomness. International Congress of Mathematicians, Aug Terence Tao (UCLA)
The dichotomy between structure and randomness International Congress of Mathematicians, Aug 23 2006 Terence Tao (UCLA) 1 A basic problem that occurs in many areas of analysis, combinatorics, PDE, and
More informationHypergraph Ramsey numbers
Hypergraph Ramsey numbers David Conlon Jacob Fox Benny Sudakov Abstract The Ramsey number r k (s, n is the minimum N such that every red-blue coloring of the k-tuples of an N-element set contains a red
More informationCombinatorics on Words:
Combinatorics on Words: Applications to Number Theory and Ramsey Theory Narad Rampersad Department of Mathematics and Statistics University of Winnipeg 9 May 2008 Narad Rampersad (University of Winnipeg)
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationMaximum 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 informationPalindromic Ramsey Theory
Palindromic Ramsey Theory Vladislav Taranchuk Mentor: Dr. Jay Cummings Abstract In this paper the researcher studies palindromic ramsey theory on the integers. Given an integer coloring of any length the
More informationBasics of Proofs. 1 The Basics. 2 Proof Strategies. 2.1 Understand What s Going On
Basics of Proofs The Putnam is a proof based exam and will expect you to write proofs in your solutions Similarly, Math 96 will also require you to write proofs in your homework solutions If you ve seen
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationThe regularity method and blow-up lemmas for sparse graphs
The regularity method and blow-up lemmas for sparse graphs Y. Kohayakawa (São Paulo) SPSAS Algorithms, Combinatorics and Optimization University of São Paulo July 2016 Partially supported CAPES/DAAD (430/15),
More informationA 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 informationRamsey theory of homogeneous structures
Ramsey theory of homogeneous structures Natasha Dobrinen University of Denver Notre Dame Logic Seminar September 4, 2018 Dobrinen big Ramsey degrees University of Denver 1 / 79 Ramsey s Theorem for Pairs
More informationThe Green-Tao theorem and a relative Szemerédi theorem
The Green-Tao theorem and a relative Szemerédi theorem Yufei Zhao Massachusetts Institute of Technology Based on joint work with David Conlon (Oxford) and Jacob Fox (MIT) Green Tao Theorem (arxiv 2004;
More informationA talk given at the Institute of Math., Chinese Academy of Sciences ( ).
A talk given at the Institute of Math., Chinese Academy of Sciences (2007-01-30). COMBINATORIAL ASPECTS OF SZEMERÉDI S THEOREM Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093, P.
More informationIntroduction to Series and Sequences Math 121 Calculus II Spring 2015
Introduction to Series and Sequences Math Calculus II Spring 05 The goal. The main purpose of our study of series and sequences is to understand power series. A power series is like a polynomial of infinite
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationConstructions in Ramsey theory
Constructions in Ramsey theory Dhruv Mubayi Andrew Suk Abstract We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationMATH 402 : 2017 page 1 of 6
ADMINISTRATION What? Math 40: Enumerative Combinatorics Who? Me: Professor Greg Smith You: students interested in combinatorics When and Where? lectures: slot 00 office hours: Tuesdays at :30 6:30 and
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More informationSection 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationF 2k 1 = F 2n. for all positive integers n.
Question 1 (Fibonacci Identity, 15 points). Recall that the Fibonacci numbers are defined by F 1 = F 2 = 1 and F n+2 = F n+1 + F n for all n 0. Prove that for all positive integers n. n F 2k 1 = F 2n We
More informationOn the chromatic number and independence number of hypergraph products
On the chromatic number and independence number of hypergraph products Dhruv Mubayi Vojtĕch Rödl January 10, 2004 Abstract The hypergraph product G H has vertex set V (G) V (H), and edge set {e f : e E(G),
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 013 Vazirani Note 1 Induction Induction is a basic, powerful and widely used proof technique. It is one of the most common techniques for analyzing
More information1 5 π 2. 5 π 3. 5 π π x. 5 π 4. Figure 1: We need calculus to find the area of the shaded region.
. Area In order to quantify the size of a 2-dimensional object, we use area. Since we measure area in square units, we can think of the area of an object as the number of such squares it fills up. Using
More information1 Continued Fractions
Continued Fractions To start off the course, we consider a generalization of the Euclidean Algorithm which has ancient historical roots and yet still has relevance and applications today.. Continued Fraction
More informationAutomatic Sequences and Transcendence of Real Numbers
Automatic Sequences and Transcendence of Real Numbers Wu Guohua School of Physical and Mathematical Sciences Nanyang Technological University Sendai Logic School, Tohoku University 28 Jan, 2016 Numbers
More informationMulticolour 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 informationSome new representation problems involving primes
A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationSpanning and Independence Properties of Finite Frames
Chapter 1 Spanning and Independence Properties of Finite Frames Peter G. Casazza and Darrin Speegle Abstract The fundamental notion of frame theory is redundancy. It is this property which makes frames
More informationSquare-Difference-Free Sets of Size Ω(n )
Square-Difference-Free Sets of Size Ω(n 0.7334 ) Richard Beigel Temple University William Gasarch Univ. of MD at College Park Abstract A set A N is square-difference free (henceforth SDF) if there do not
More informationHAMPSHIRE COLLEGE: YOU CAN T GET THERE FROM HERE : WHY YOU CAN T TRISECT AN ANGLE, DOUBLE THE CUBE, OR SQUARE THE CIRCLE. Contents. 1.
HAMPSHIRE COLLEGE: YOU CAN T GET THERE FROM HERE : WHY YOU CAN T TRISECT AN ANGLE, DOUBLE THE CUBE, OR SQUARE THE CIRCLE RAVI VAKIL Contents 1. Introduction 1 2. Impossibility proofs, and 2 2 3. Real fields
More informationMT 855: Graduate Combinatorics
MT 855: Graduate Combinatorics Lecture 24: News Flash: the chromatic number of the plane is at least 5 We interrupt this regularly scheduled lecture series in order to bring the latest news: the chromatic
More informationApplications of model theory in extremal graph combinatorics
Applications of model theory in extremal graph combinatorics Artem Chernikov (IMJ-PRG, UCLA) Logic Colloquium Helsinki, August 4, 2015 Szemerédi regularity lemma Theorem [E. Szemerédi, 1975] Every large
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More informationContinued Fractions New and Old Results
Continued Fractions New and Old Results Jeffrey Shallit School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1 Canada shallit@cs.uwaterloo.ca https://www.cs.uwaterloo.ca/~shallit Joint
More informationSum-free sets. Peter J. Cameron University of St Andrews
Sum-free sets Peter J. Cameron University of St Andrews Topological dynamics, functional equations, infinite combinatorics and probability LSE, June 2017 Three theorems A set of natural numbers is k-ap-free
More informationSum-free sets. Peter J. Cameron University of St Andrews
Sum-free sets Peter J. Cameron University of St Andrews Topological dynamics, functional equations, infinite combinatorics and probability LSE, June 2017 Three theorems The missing fourth? A set of natural
More informationLimit and Continuity
Limit and Continuity Table of contents. Limit of Sequences............................................ 2.. Definitions and properties...................................... 2... Definitions............................................
More informationInfinity. The infinite! No other question has ever moved so profoundly the spirit of man. David Hilbert
ℵ ℵ The infinite! No other question has ever moved so profoundly the spirit of man. David Hilbert ℵℵ The Mathematics of the Birds and the Bee Two birds are racing towards each other in the heat of passion.
More informationMathematical Statements
Mathematical Statements Joseph R. Mileti January 26, 2015 1 Mathematical Statements and Mathematical Truth Unfortunately, many people view mathematics only as complicated equations and elaborate computational
More informationWarm-up Quantifiers and the harmonic series Sets Second warmup Induction Bijections. Writing more proofs. Misha Lavrov
Writing more proofs Misha Lavrov ARML Practice 3/16/2014 and 3/23/2014 Warm-up Using the quantifier notation on the reference sheet, and making any further definitions you need to, write the following:
More informationMonochromatic 4-term arithmetic progressions in 2-colorings of Z n
Monochromatic 4-term arithmetic progressions in 2-colorings of Z n Linyuan Lu Xing Peng University of South Carolina Integers Conference, Carrollton, GA, October 26-29, 2011. Three modules We will consider
More informationA Number Theorist s Perspective on Dynamical Systems
A Number Theorist s Perspective on Dynamical Systems Joseph H. Silverman Brown University Frontier Lectures Texas A&M, Monday, April 4 7, 2005 Rational Functions and Dynamical Systems
More informationNotice how these numbers thin out pretty quickly. Yet we can find plenty of triples of numbers (a, b, c) such that a+b = c.
THE ABC Conjecture Mark Saul, Ph.D. Center for Mathematical Talent Courant Institute of Mathematical Sciences New York University I The abc conjecture was formulated independently by Joseph Oesterle and
More information