the combinatorics of solving linear equations origins: (i. schur) does the congruence always have...
TRANSCRIPT
![Page 1: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/1.jpg)
![Page 2: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/2.jpg)
The combinatorics of solving linear equations
Origins: (I. Schur)
n n nx y z (mod p)Does the congruencealways have non-trivial solutions? 1875 -
1941
![Page 3: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/3.jpg)
The combinatorics of solving linear equations
Origins: (I. Schur)
n n nx y z (mod p)Does the congruencealways have non-trivial solutions?
Yes !
Theorem (Schur – 1916)
If the positive integers are partitioned into finitely many classes then at least one of the classes contains solutions to the equation
x y z.
1875 - 1941
![Page 4: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/4.jpg)
Some notation:
N:: {1,2,3,......}, [n] : {1,2,...,n}
χ N [: [r] - an r-coloring of Nχ N [:
χ induces a partition of N 1 2 rC C ... C
into color classes χ 1iC (i)
Objects in a single color class will be called monochromatic.
![Page 5: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/5.jpg)
Schur’s theorem restated:
In any r-coloring of there is always a monochromatic solution
to the equation x y z.
N
Schur’s theorem restated:
![Page 6: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/6.jpg)
Schur’s theorem restated:
In any r-coloring of there is always a monochromatic solution
to the equation x y z.
N
Schur’s theorem restated:
B. L. van der Waerden(1903 – 1996)
Theorem (van der Waerden – 1927)
In any r-coloring of there is always a monochromatic
arithmetic progression of length k (= k-AP).
N
![Page 7: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/7.jpg)
Theorem (van der Waerden – 1927)
In any r-coloring of there is always a monochromatic
arithmetic progression of length k (= k-AP).
N
Schur’s theorem restated:
In any r-coloring of there is always a monochromatic solution
to the equation x y z.
N
Special case k = 3.
Schur’s theorem restated:
In any r-coloring of there is always a monochromatic solution
to the equation x y 2z.
N
B. L. van der Waerden(1903 – 1996)
![Page 8: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/8.jpg)
What about the equation x y 3z?
![Page 9: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/9.jpg)
What about the equation x y 3z?
Fact. There is a 4-coloring of with no monochromatic
solution to
N
x y 3z.
![Page 10: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/10.jpg)
What about the equation x y 3z?
Fact. There is a 4-coloring of with no monochromatic
solution to
N
x y 3z.
Proof. Define χ N [: [4] by setting
χ t(5 (5k i)) i, 1 i 4.
Then 31 2
1 2 3
tt t5 (5k i) 5 (5k i) 3 5 (5k i)
32 dd(1 5 3 5 ) i 0 (mod 5)
which is impossible.
![Page 11: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/11.jpg)
In general, call an equation
r-regular if every r-coloring of contains a monochromatic
solution to E.
1 2 n 1 1 2 2 n nE E(x ,x ,...,x ) ax a x .. a x 0
N
Also, call E regular if it is r-regular for every r.
![Page 12: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/12.jpg)
In general, call an equation
r-regular if every r-coloring of contains a monochromatic
solution to E.
1 2 n 1 1 2 2 n nE E(x ,x ,...,x ) ax a x .. a x 0
N
Also, call E regular if it is r-regular for every r.
Which equations are regular ?
Theorem (R. Rado – 1933)
E is regular iff it can be solved with all ix 0 or 1,
and not all 0.
![Page 13: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/13.jpg)
In general, call an equation
r-regular if every r-coloring of contains a monochromatic
solution to E.
1 2 n 1 1 2 2 n nE E(x ,x ,...,x ) ax a x .. a x 0
N
Also, call E regular if it is r-regular for every r.
Which equations are regular ?
Theorem (R. Rado – 1933)
E is regular iff it can be solved with all ix 0 or 1,
and not all 0.
x y z, x y 2z, x y 3z
1 0 1, 1 1 2 1, ???
![Page 14: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/14.jpg)
Conjecture (Rado – 1933) For every k, there are equations
which are k-regular but are not (k+1)-regular.
![Page 15: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/15.jpg)
Conjecture (Rado – 1933) For every k, there are equations
which are k-regular but are not (k+1)-regular.
Theorem (Alexeev-Tsimerman – 2009)
The equation
i i
i i
k k2 2
i 02 1 2 1i 1 i 1
x ( 1 )x
is k-regular but not (k+1)-regular.
![Page 16: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/16.jpg)
More generally, for an m x n integer matrix A,
let denote a system of homogenous linear equations.
Ax 0
For example, for
1 2 1 0 0
A 0 1 2 1 0 ,
0 0 1 2 1
the corresponding system is:
1 2 3 2 3 4 3 4 5x 2x x 0, x 2x x 0, x 2x x 0,
which corresponds to an arithmetic progression of length 5 (5-AP).
![Page 17: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/17.jpg)
A matrix A is said to satisfy the columns condition (CC)
if it possible to partition the columns of A into blocks1 2 sB ,B ,...,B
so that:
(i) j 1
jc B
c 0;
(ii)j i
jc B
f or i 1, c
can be expressed as a rational linear
combination of the columns of 1 2 i 1B ,B ,...,B .
![Page 18: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/18.jpg)
A matrix A is said to satisfy the columns condition (CC)
if it possible to partition the columns of A into blocks1 2 sB ,B ,...,B
so that:
For example,
2 4 2 1
0 2 2 1
1 3 2 0has CC since
2 4 2 0 2 4 1
0 23
2 0 , 0 2 1
1 3 2 0 1 3 0
12 2
(i) j 1
jc B
c 0;
(ii)j i
jc B
f or i 1, c
can be expressed as a rational linear
combination of the columns of 1 2 i 1B ,B ,...,B .
![Page 19: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/19.jpg)
Theorem (Rado – 1933)The system is regular iff A satifies the columns condition.
Ax 0
Paul Erdös and Richard Rado1913-1996 1906-1989
![Page 20: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/20.jpg)
Rado also had many other conjectures concerning systems
of regular equations, one of which was this.
Call a subset large if for any r, any r-coloring of S always
has monochromatic solutions for every regular system.
NS
![Page 21: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/21.jpg)
Rado also had many other conjectures concerning systems
of regular equations, one of which was this.
Call a subset large if for any r, any r-coloring of S always
has monochromatic solutions for every regular system.
NS
Conjecture. For any partition of a large set 1 2 tS S S ... S
into finitely many parts, at least one of the parts is large.
iS
![Page 22: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/22.jpg)
Rado also had many other conjectures concerning systems
of regular equations, one of which was this.
Call a subset large if for any r, any r-coloring of S always
has monochromatic solutions for every regular system.
NS
Conjecture. For any partition of a large set 1 2 tS S S ... S
into finitely many parts, at least one of the parts is large.
iS
This was finally proved in 1973 by Deuber.
Walter Deuber – (1943 – 1999)
![Page 23: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/23.jpg)
Even though and are both regular, there is a
fundamental difference between them.
x y z x y 2z
Recall van der Waerden’s theorem:In any r-coloring of there is always a monochromatic
arithmetic progression of length k (= k-AP).
N
Erdös and Turán (1936) ask: Which color class has the k-AP’s?
![Page 24: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/24.jpg)
Even though and are both regular, there is a
fundamental difference between them.
x y z x y 2z
Recall van der Waerden’s theorem:In any r-coloring of there is always a monochromatic
arithmetic progression of length k (= k-AP).
N
Erdös and Turán (1936) ask: Which color class has the k-AP’s?They conjectured that the “densest” class should have them.More precisely, they conjectured that if satisfies NS
then S should contain k-AP’s for every k.
| S [n]|limsup 0
n n
![Page 25: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/25.jpg)
Equivalently, define to be the size of the largest subset
of [n] which contains no k-AP.
kr (n)
Conjecture (Erdös -Turán – 1936)
kr (n) o(n).For all k,
![Page 26: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/26.jpg)
Equivalently, define to be the size of the largest subset
of [n] which contains no k-AP.
kr (n)
Conjecture (Erdös -Turán – 1936)
kr (n) o(n).For all k,
It became clear that even was not going to be so simple
to determine because of:
3r (n)
Theorem (Behrend – 1946)
3r (n) n exp( c logn).
For a suitable constant c > 0,
![Page 27: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/27.jpg)
Equivalently, define to be the size of the largest subset
of [n] which contains no k-AP.
kr (n)
Conjecture (Erdös -Turán – 1936)
kr (n) o(n).For all k,
It became clear that even was not going to be so simple
to determine because of:
3r (n)
Theorem (Behrend – 1946)
3r (n) n exp( c logn).
For a suitable constant c > 0,
This shows that for every 1 ε3r (n) n ε 0 as n .
![Page 28: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/28.jpg)
The first non-trivial upper bound was given by Roth:
Theorem (Roth – 1954)
n3 log log nr (n) O( ).
![Page 29: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/29.jpg)
The first non-trivial upper bound was given by Roth:
Theorem (Roth – 1954)
n3 log log nr (n) O( ).
This was subsequently improved by Szemerédi and Heath-Brown to
cn
3 (log n)r (n) O( ) with the current record being held by
Bourgain (2008)
2
23
(loglog n)3 (log n)r (n) O n .
![Page 30: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/30.jpg)
The first non-trivial upper bound was given by Roth:
Theorem (Roth – 1954)
n3 log log nr (n) O( ).
This was subsequently improved by Szemerédi and Heath-Brown to
cn
3 (log n)r (n) O( ) with the current record being held by
Bourgain (2008)
2
23
(loglog n)3 (log n)r (n) O n .
There has also been a very recent breakthrough improvement
of Behrend’s lower bound by Michael Elkin.
![Page 31: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/31.jpg)
Behrend (1946)
M. Elkin (2009)
22 2 log n
3 2r (n) cn 14log n
22 2 log n
3 2r (n) cn 14log n
![Page 32: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/32.jpg)
Behrend (1946)
M. Elkin (2009)
22 2 log n
3 2r (n) cn 14log n
22 2 log n
3 2r (n) cn 14log n
Is this close to the “truth” ?
![Page 33: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/33.jpg)
What about ?
kr (n)
![Page 34: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/34.jpg)
What about ?
kr (n)
4r (n) o(n) Szemerédi - 1969
![Page 35: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/35.jpg)
What about ?
kr (n)
4r (n) o(n) Szemerédi - 1969
kr (n) o(n) Szemerédi - 1974
+ $1000Endre Szemerédi – (1940 - )
![Page 36: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/36.jpg)
What about ?
kr (n)
4r (n) o(n) Szemerédi - 1969
kr (n) o(n) Szemerédi - 1974
+ $1000
kr (n) o(n) Furstenberg – 1979 (ergodic theory)
Endre Szemerédi – (1940 - )
![Page 37: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/37.jpg)
What about ?
kr (n)
4r (n) o(n) Szemerédi - 1969
kr (n) o(n) Szemerédi - 1974
+ $1000
kr (n) o(n) Furstenberg – 1979 (ergodic theory)
c4r (n) O(n/ (loglogn) ) Gowers - 1998
Endre Szemerédi – (1940 - )
![Page 38: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/38.jpg)
What about ?
kr (n)
4r (n) o(n) Szemerédi - 1969
kr (n) o(n) Szemerédi - 1974
+ $1000
kr (n) o(n) Furstenberg – 1979 (ergodic theory)
c4r (n) O(n/ (loglogn) ) Gowers - 1998
kk
cr (n) O(n/ (loglogn) ) Gowers - 2001
Endre Szemerédi – (1940 - )
![Page 39: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/39.jpg)
What about ?
kr (n)
4r (n) o(n) Szemerédi - 1969
kr (n) o(n) Szemerédi - 1974
+ $1000
kr (n) o(n) Furstenberg – 1979 (ergodic theory)
c4r (n) O(n/ (loglogn) ) Gowers - 1998
kk
cr (n) O(n/ (loglogn) ) Gowers - 2001
The last result can be used to obtain the best currently
available bound for the van der Waerden function W(k).
Endre Szemerédi – (1940 - )
![Page 40: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/40.jpg)
A consequence of van der Waerden’s theorem on arithmetic progressions
is that for every n, there is a least number W(n) so that in any
2-coloring of [W(n)], there is always formed a monochromatic n-AP.
![Page 41: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/41.jpg)
A consequence of van der Waerden’s theorem on arithmetic progressions
is that for every n, there is a least number W(n) so that in any
2-coloring of [W(n)], there is always formed a monochromatic n-AP.
n2222For every n, W(n) 2
9
Theorem (Gowers 2001)
$1000
2222
22
2
2
……
…
2
n 2
’s
W(n) <
![Page 42: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/42.jpg)
The best known lower bound is:
nW(n 1) n 2 , (Berlekamp - 1968)
Elwyn Berlekamp - (1940 - )
![Page 43: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/43.jpg)
The best known lower bound is:
nW(n 1) n 2 , (Berlekamp - 1968)
Elwyn Berlekamp - (1940 - )The only known values are:
nW(n)
2 64353
31785
9 1132
![Page 44: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/44.jpg)
The best known lower bound is:
nW(n 1) n 2 , (Berlekamp - 1968)
Elwyn Berlekamp - (1940 - )
(Brave) Conjecture.$1000
For all n,2nW(n) 2 .
The only known values are:
nW(n)
2 64353
31785
9 1132
![Page 45: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/45.jpg)
A new proof of van der Waerden for 3-AP’s
![Page 46: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/46.jpg)
N
N
“corner”
G(N) = N by N triangular grid
TheoremTheorem: (RLG + J. Solymosi - 2006)
There is a universal constant c such that
if the points of G(N) are colored with at
most c log log N colors, then there is always
a monochromatic corner (x,y), (x+d,y), (x,y+d).
A new proof of van der Waerden for 3-AP’s
![Page 47: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/47.jpg)
N
N
Sketch of proof:
Suppose G(N) is r-colored.
L1
Let L denote the set of points on the diagonal.
1
![Page 48: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/48.jpg)
N
N
Sketch of proof:
Suppose G(N) is r-colored.
L1
Let be points with the “most popular” color c .
1 1S L1
Let L denote the set of points on the diagonal.
1
![Page 49: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/49.jpg)
N
N
Sketch of proof:
Suppose G(N) is r-colored.
L1
………
………
………
Let be points with the “most popular” color c .
1 1S L1
Let L denote the set of points on the diagonal.
1
Let be the points in the product
below L .
1 1 1T S xS
1
![Page 50: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/50.jpg)
N
N
Sketch of proof:
Suppose G(N) is r-colored.
L1
………
………
………
Let be points with the “most popular” color c .
1 1S L1
Let L denote the set of points on the diagonal.
1
Let be the points in the product
below L .
1 1 1T S xS
1 Thus,
21 2
11
2r
N| S |r
2 2| T | ~ N
![Page 51: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/51.jpg)
N
N
Sketch of proof:
Suppose G(N) is r-colored.
L1
………
………
………
Let be points with the “most popular” color c .
1 1S L1
Let L denote the set of points on the diagonal.
1
Let be the points in the product
below L .
1 1 1T S xS
1 Thus,
21 2
11
2r
N| S |r
2 2| T | ~ N
Hence, some line L parallel to L
has at least points of T on it.
21
2rN
2 1
1
L2
![Page 52: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/52.jpg)
N
N
Sketch of proof:
Suppose G(N) is r-colored.
L1
………
………
………
Let be points with the “most popular” color c .
1 1S L1
Let L denote the set of points on the diagonal.
1
Let be the points in the product
below L .
1 1 1T S xS
1 Thus,
21 2
11
2r
N| S |r
2 2| T | ~ N
Hence, some line L parallel to L
has at least points of T on it.
21
2rN
2 1
1
L2
Let be points with
the most popular color c
2 2S L
2
and let be the points in the product below L .
2 2 2T S xS2
![Page 53: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/53.jpg)
62 23
2
N2r
2
18r
| S |
2| T | ~ N
Thus, , etc.
Continue for r+1 steps.Then r 1r 1 r2 1 2 1
1| S | N
2 r
![Page 54: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/54.jpg)
62 23
2
N2r
2
18r
| S |
2| T | ~ N
Thus, , etc.
Continue for r+1 steps.
L i
L j
Lk
a
b
c
d
ef
g
Observe that if abc, bde and cfg are corners
then so is adg.
Then r 1r 1 r2 1 2 1
1| S | N
2 r
![Page 55: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/55.jpg)
62 23
2
N2r
2
18r
| S |
2| T | ~ N
Thus, , etc.
Continue for r+1 steps.
L i
L j
Lk
a
b
c
d
ef
g
Observe that if abc, bde and cfg are corners
then so is adg.
Hence, if then we have a
monochromatic corner.
u vc c , u v,
Then r 1r 1 r2 1 2 1
1| S | N
2 r
![Page 56: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/56.jpg)
62 23
2
N2r
2
18r
| S |
2| T | ~ N
Thus, , etc.
Continue for r+1 steps.
L i
L j
Lk
a
b
c
d
ef
g
Observe that if abc, bde and cfg are corners
then so is adg.
Hence, if then we have a
monochromatic corner.
u vc c , u v,
Then r 1r 1 r2 1 2 1
1| S | N
2 r
This works providedcr2N 2
for a suitable absolute constant c.
This proves the Theorem.
![Page 57: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/57.jpg)
N
Notice that we can project a corner onto a 3-AP
on a copy of . N
![Page 58: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/58.jpg)
Notice that we can project a corner onto a 3-AP
on a copy of .
Hence, we have the
Corollary. Corollary. If {1, 2, …, N} is colored with at
most c log log N colors, then a monochromatic
3-AP must be formed.
N
N
![Page 59: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/59.jpg)
Notice that we can project a corner onto a 3-AP
on a copy of .
Hence, we have the
Corollary. Corollary. If {1, 2, …, N} is colored with at
most c log log N colors, then a monochromatic
3-AP must be formed.
The best result of this type follows from
a difficult result of Bourgain, which
gives the above conclusion with
23
2
logn
log lognc colors.
N
N
![Page 60: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/60.jpg)
N
N
We can actually continue the preceding argument for (m-1)r+1
steps to get a monochromatic “equilateral binary tree” with m levels.
……
……
……
![Page 61: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/61.jpg)
N
N
We can actually continue the preceding argument for (m-1)r+1
steps to get a monochromatic “equilateral binary tree” with m levels.
……
……
……
We can project these trees onto the real axis to get
monochromatic affine “m-cubes”. These are sets of
the formm
k k kk 1
{a x , 0 or 1}
![Page 62: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/62.jpg)
N
N
We can actually continue the preceding argument for (m-1)r+1
steps to get a monochromatic “equilateral binary tree” with m levels.
……
……
……
We can project these trees onto the real axis to get
monochromatic affine “m-cubes”. These are sets of
the formm
k k kk 1
{a x , 0 or 1}
Similar arguments yield monochromatic
connected crossed diagonals of a
hypercube, etc.
![Page 63: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/63.jpg)
N
N
We can actually continue the preceding argument for (m-1)r+1
steps to get a monochromatic “equilateral binary tree” with m levels.
……
……
……
We can project these trees onto the real axis to get
monochromatic affine “m-cubes”. These are sets of
the formm
k k kk 1
{a x , 0 or 1}
Similar arguments yield monochromatic
connected crossed diagonals of a
hypercube, etc.
The partition regularity of these structures was first established by
Hilbert in 1892 in connection with his work on irreducibility of polynomials.
![Page 64: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/64.jpg)
Combinatorial Combinatorial lineslines
For a finite set denote the set of n-tuples from A.
n1 2 mA {a ,a ,...,a }, let A
A combinatorial line in A is a set of m n-tuples wheren1 2 mX ,X ,...,X
k k k k k(1) (2) (j) (n)X (X ,X ,...,X ,...,X )
either all X (j) are equal, or k k k 1 k m.X (j) a f or
and for each j,
![Page 65: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/65.jpg)
Combinatorial Combinatorial lineslines
For a finite set denote the set of n-tuples from A.
n1 2 mA {a ,a ,...,a }, let A
A combinatorial line in A is a set of m n-tuples wheren1 2 mX ,X ,...,X
k k k k k(1) (2) (j) (n)X (X ,X ,...,X ,...,X )
either all X (j) are equal, or k k k 1 k m.X (j) a f or
and for each j,
Theorem (Hales – Jewett – 1963)For every r, there is an N = N(A, r) such that if is r-colored
then there must always be formed a monochromatic combinatorial line.
NA
![Page 66: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/66.jpg)
Hales – Jewett implies van der Waerden by taking A = {1, 2,…, m} and
identifying the n-tuple with the integer1 2 n(x ,x ,...,x ) 1 2 nx x ... x .
![Page 67: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/67.jpg)
Hales – Jewett implies van der Waerden by taking A = {1, 2,…, m} and
identifying the n-tuple with the integer1 2 n(x ,x ,...,x ) 1 2 nx x ... x .
...a... ...b... ..1 1 .c...
...a... ...b... ..2 2 .c...
...a... ...b... ..m m .c...
… …S 2t
S mt
… …
S 1t
![Page 68: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/68.jpg)
Hales – Jewett implies van der Waerden by taking A = {1, 2,…, m} and
identifying the n-tuple with the integer1 2 n(x ,x ,...,x ) 1 2 nx x ... x .
Of course, Szemerédi’s theorem is a (stronger) density form of
van der Waerden’s theorem since in any r-coloring of , some color
class must have density at least 1/r.
...a... ...b... ..1 1 .c...
...a... ...b... ..2 2 .c...
...a... ...b... ..m m .c...
… …S 2t
S mt
… …
S 1t
![Page 69: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/69.jpg)
van der Waerden
SzemerédiHales - Jewett
We have this picture:
![Page 70: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/70.jpg)
van der Waerden
SzemerédiHales - Jewett
density Hales – Jewett theorem ?
We have this picture:
Is there a
![Page 71: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/71.jpg)
van der Waerden
SzemerédiHales - Jewett
density Hales – Jewett
We have this picture:
Yes !
![Page 72: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/72.jpg)
TheoremTheorem – Density Hales–Jewett (Furstenberg - Katznelson - 1991)For every ε > 0, there is an N = N(ε) such that if
N NR A , with| R| | A| ,
then R must contain a combinatorial line.
![Page 73: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/73.jpg)
TheoremTheorem – Density Hales–Jewett (Furstenberg - Katznelson - 1991)For every ε > 0, there is an N = N(ε) such that if
N NR A , with| R| | A| ,
then R must contain a combinatorial line.
Big Problem:Big Problem: Obtain reasonable (for example, any) bounds on N(ε).
(Furstenberg-Katznelson proof uses ergodic theory tools).
![Page 74: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/74.jpg)
TheoremTheorem – Density Hales–Jewett (Furstenberg - Katznelson - 1991)For every ε > 0, there is an N = N(ε) such that if
N NR A , with| R| | A| ,
then R must contain a combinatorial line.
Big Problem:Big Problem: Obtain reasonable (for example, any) bounds on N(ε).
Warm-up Big Problem: Try this for m = 3.
(Furstenberg-Katznelson proof uses ergodic theory tools).
![Page 75: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/75.jpg)
TheoremTheorem – Density Hales–Jewett (Furstenberg - Katznelson - 1991)For every ε > 0, there is an N = N(ε) such that if
N NR A , with| R| | A| ,
then R must contain a combinatorial line.
Big Problem:Big Problem: Obtain reasonable (for example, any) bounds on N(ε).
Warm-up Big Problem: Try this for m = 3.
Very recent breakthrough !
Tim Gowers and the Polymath Polymath project.
(Furstenberg-Katznelson proof uses ergodic theory tools).
![Page 76: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/76.jpg)
![Page 77: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/77.jpg)
It now appears that the Polymath project has succeeded
in finding 3 combinatorial proofs of the density Hales – Jewett
theorem, and consequently, for the first time we have
explicit (but still quite large!) bounds on N(m,ε).
![Page 78: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/78.jpg)
It now appears that the Polymath project has succeeded
in finding 3 combinatorial proofs of the density Hales – Jewett
theorem, and consequently, for the first time we have
explicit (but still quite large!) bounds on N(m,ε).Is this the wave of the future ??
![Page 79: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/79.jpg)
Back to linear equationsEven though and are both regular, there is a
fundamental difference between them.
x y z x y 2z
x y 2z always has solutions in any set of positive densitywhereas may not. x y z
![Page 80: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/80.jpg)
Back to linear equationsEven though and are both regular, there is a
fundamental difference between them.
x y z x y 2z
x y 2z always has solutions in any set of positive densitywhereas may not. x y z
For example, has no solutions in either x y z
n2
{x [n] : x odd} or {x [n] : x }.
![Page 81: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/81.jpg)
Back to linear equationsEven though and are both regular, there is a
fundamental difference between them.
x y z x y 2z
x y 2z always has solutions in any set of positive densitywhereas may not. x y z
In fact, a system of homogenous linear equations given by
Ax 0 is density regular iff the all 1’s vector is a solution.
For example, has no solutions in either x y z
n2
{x [n] : x odd} or {x [n] : x }.
![Page 82: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/82.jpg)
If [n] is r-colored, how manyhow many monochromatic 3-AP’s must be formed?
It follows from general results of Frankl, RLG, and Rödl that for any regular
system of homogeneous linear equations that a positive fraction of all the
solutions must be monochromatic.
![Page 83: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/83.jpg)
If [n] is r-colored, how manyhow many monochromatic 3-AP’s must be formed?
It follows from general results of Frankl, RLG, and Rödl that for any regular
system of homogeneous linear equations that a positive fraction of all the
solutions must be monochromatic.For the equation let f (n) denote the minimum
possible number of monochromatic solutions formed over
all possible 2-colorings of [n].
1 2 tE(x ,x ,...,x ), E
![Page 84: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/84.jpg)
If [n] is r-colored, how manyhow many monochromatic 3-AP’s must be formed?
It follows from general results of Frankl, RLG, and Rödl that for any regular
system of homogeneous linear equations that a positive fraction of all the
solutions must be monochromatic.For the equation let f (n) denote the minimum
possible number of monochromatic solutions formed over
all possible 2-colorings of [n].
1 2 tE(x ,x ,...,x ), E
For example, for E: x + y = z, it is known that
2
En22(1 o(1))f (n)
Robertson/Zeilberger and Schoen - 1998
![Page 85: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/85.jpg)
If [n] is r-colored, how manyhow many monochromatic 3-AP’s must be formed?
It follows from general results of Frankl, RLG, and Rödl that for any regular
system of homogeneous linear equations that a positive fraction of all the
solutions must be monochromatic.For the equation let f (n) denote the minimum
possible number of monochromatic solutions formed over
all possible 2-colorings of [n].
1 2 tE(x ,x ,...,x ), E
For example, for E: x + y = z, it is known that
2
En22(1 o(1))f (n)
Robertson/Zeilberger and Schoen - 1998
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
![Page 86: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/86.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
![Page 87: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/87.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
![Page 88: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/88.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
Is this best possible ?
![Page 89: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/89.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
Is this best possible ? No!
![Page 90: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/90.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
Is this best possible ? No!
It has recently been shown that there is a 2-coloring of [n] which has only 2117
2192(1 o(1)) n monochromatic 3-AP’s.
![Page 91: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/91.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
Is this best possible ? No!
It has recently been shown that there is a 2-coloring of [n] which has only 2117
2192(1 o(1)) n monochromatic 3-AP’s.
117 12192 18.735...
![Page 92: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/92.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
Is this best possible ? No!
It has recently been shown that there is a 2-coloring of [n] which has only 2117
2192(1 o(1)) n monochromatic 3-AP’s.
117 12192 18.735...
28 6 28 37 59 2828 63759116 116
![Page 93: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/93.jpg)
What is the situation for 3–AP’s, i.e., the equation x + y = 2z ??
[n] contains 3-AP’s. 2n
4(1 o(1))
Hence, if [n] is randomlyrandomly 2-colored then there will be
essentially monochromatic 3-AP’s. 2n
16(1 o(1))
Is this best possible ? No!
It has recently been shown that there is a 2-coloring of [n] which has only 2117
2192(1 o(1)) n monochromatic 3-AP’s.
117 12192 18.735...
In the other direction, it is known that there must
always be at least monochromatic 3-AP’s.2167532768(1 o(1)) n
28 6 28 37 59 2828 63759116 116
1675 11732768 2192
0.05111... 0.05337...
![Page 94: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/94.jpg)
We believe the upper bound is the “truth”, i.e., any
2-coloring of [n] must have at least 21172192
(1 o(1)) n
monochromatic 3-AP’s.
![Page 95: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/95.jpg)
We believe the upper bound is the “truth”, i.e., any
2-coloring of [n] must have at least 21172192
(1 o(1)) n
monochromatic 3-AP’s.
Sketch of our approach (S. Butler, K. Costello, RLG)
Let c :[n] {0,1} be a 2-coloring of [n] and define
jS {x :c(x) j, 1 x n}, j 0, 1,
![Page 96: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/96.jpg)
We believe the upper bound is the “truth”, i.e., any
2-coloring of [n] must have at least 21172192
(1 o(1)) n
monochromatic 3-AP’s.
Sketch of our approach (S. Butler, K. Costello, RLG)
Let c :[n] {0,1} be a 2-coloring of [n] and define
jS {x :c(x) j, 1 x n}, j 0, 1,
0 1V(S ,S ) # of monochromatic 3-AP’s formed
![Page 97: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/97.jpg)
We believe the upper bound is the “truth”, i.e., any
2-coloring of [n] must have at least 21172192
(1 o(1)) n
monochromatic 3-AP’s.
Sketch of our approach (S. Butler, K. Costello, RLG)
Let c :[n] {0,1} be a 2-coloring of [n] and define
jS {x :c(x) j, 1 x n}, j 0, 1,
0 1V(S ,S ) # of monochromatic 3-AP’s formed
j
2πisxj
s S
f (x) e .
![Page 98: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/98.jpg)
We believe the upper bound is the “truth”, i.e., any
2-coloring of [n] must have at least 21172192
(1 o(1)) n
monochromatic 3-AP’s.
Sketch of our approach (S. Butler, K. Costello, RLG)
Let c :[n] {0,1} be a 2-coloring of [n] and define
jS {x :c(x) j, 1 x n}, j 0, 1,
0 1V(S ,S ) # of monochromatic 3-AP’s formed
j
2πisxj
s S
f (x) e .
Thus,
1 2 2
0 1 0 0 1 102V(S ,S ) (f (x)f (2x) f (x)f (2x))dx
![Page 99: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/99.jpg)
2 20 0 1 1f (x)f (2x) f (x)f (2x)
20 1 0 1
0 1 1 0 0 1
0 1 0 1
(f (x) f (x)) (f (2x) f (2x))
(f (x)f (2x) f (x)f (2x))(f (x) f (x))
f (x)f (x)(f (2x) f (2x))
Expanding the integrand, we get
![Page 100: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/100.jpg)
2 20 0 1 1f (x)f (2x) f (x)f (2x)
20 1 0 1
0 1 1 0 0 1
0 1 0 1
(f (x) f (x)) (f (2x) f (2x))
(f (x)f (2x) f (x)f (2x))(f (x) f (x))
f (x)f (x)(f (2x) f (2x))
Expanding the integrand, we get
We can interpret these three terms respectively as:
3
0 1 1 0
0 1
| {(a,b,c) [n] : a b 2c}|
| {(a,b) (S S ) (S S ) :2b a [n]}|
| {(a,b) S S : a b is even}| .
![Page 101: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/101.jpg)
3
0 1 1 0
0 1
| {(a,b,c) [n] : a b 2c}|
| {(a,b) (S S ) (S S ) :2b a [n]}|
| {(a,b) S S : a b is even}| .
The first term is and the third term can be
shown to be bounded above by
2
2n(1 o(1)) ,
2 2nodd even odd even2
(0 0 ) (0 0 )
0 12V(S ,S )
where and denote the number of odd and even numbers,
respectively, in [n] which have color 0.
odd0even0
![Page 102: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/102.jpg)
3
0 1 1 0
0 1
| {(a,b,c) [n] : a b 2c}|
| {(a,b) (S S ) (S S ) :2b a [n]}|
| {(a,b) S S : a b is even}| .
The first term is and the third term can be
shown to be bounded above by
2
2n(1 o(1)) ,
2 2nodd even odd even2
(0 0 ) (0 0 )
If we assume that then this term isodd even0 0 2
8n(1 o(1)) .
0 12V(S ,S )
where and denote the number of odd and even numbers,
respectively, in [n] which have color 0.
odd0even0
![Page 103: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/103.jpg)
Thus, to minimize we should maximize the size of
0 1V(S ,S ),
0 1 1 0T {(a,b) (S S ) (S S ) :2b a [n] }.
![Page 104: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/104.jpg)
Thus, to minimize we should maximize the size of
0 1V(S ,S ),
0 1 1 0T {(a,b) (S S ) (S S ) :2b a [n] }.
Let us color the points (a,b) in [n] by2
red if 0 1 1 0(a,b) {(S S ) (S S )}
and
blue if 0 0 1 1(a,b) {(S S ) (S S ) }
![Page 105: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/105.jpg)
Thus, to minimize we should maximize the size of
0 1V(S ,S ),
0 1 1 0T {(a,b) (S S ) (S S ) :2b a [n] }.
Let us color the points (a,b) in [n] by2
red if 0 1 1 0(a,b) {(S S ) (S S )}
and
blue if 0 0 1 1(a,b) {(S S ) (S S ) }
If and consist of blocks then this coloring
is a red – blue “checkerboard” coloring of [n] .0S 1S
2
![Page 106: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/106.jpg)
2[n]
A red/blue “checkerboard”
![Page 107: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/107.jpg)
(a,b)
The requirement in T that means that we can
restrict our considerations to the parallelogram P determined
by the lines
2b a [n]
1 12 2
y x and y (1 x).
P
2[n]0S
1S
![Page 108: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/108.jpg)
2[n ] P
The intersection of the checkerboard with the parallelogram P
![Page 109: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/109.jpg)
“Incremental improvement” algorithms produced the following pictures.
x y 2z random start
![Page 110: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/110.jpg)
x y 2z random start
![Page 111: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/111.jpg)
x y 2z another random start
![Page 112: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/112.jpg)
x y 2z all blue start
![Page 113: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/113.jpg)
Converging to a common block structure !
![Page 114: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/114.jpg)
(0,0) (1,0)
(0,1) (1,1)
The “checkerboard” picture for the approximate block sizes obtained by the incremental algorithm (normalized by dividing by n ).
2
![Page 115: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/115.jpg)
(0,0) (1,0)
(0,1) (1,1)
(1, 1/2)
(0,1/2)
Restricting the checkerboard to the relevant parallelogram P.)
![Page 116: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/116.jpg)
kx
kx………
……
Local optimization of the red/blue blocks
![Page 117: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/117.jpg)
kx
kx………
……
Increasing the value of by kx ε
![Page 118: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/118.jpg)
kx
kx
= lost
………
……
![Page 119: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/119.jpg)
kx
kx
= lost
= gained
………
……
![Page 120: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/120.jpg)
*kx
= lost
= gained
Δ = 0 at local minimum………
……
*kx
![Page 121: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/121.jpg)
(0,0) (1,0)
(0,1) (1,1)
We apply the “local minimum” condition to this picture.
![Page 122: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/122.jpg)
This leads to the following set of linear equations:
![Page 123: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/123.jpg)
This leads to the following set of linear equations:
The correspond to the interval widths (normalized so that they sum to 1).
iα
The remaining equations arise from forcing equal amounts of red and blue
along each line.
![Page 124: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/124.jpg)
This leads to the following set of linear equations:
The correspond to the interval widths (normalized so that they sum to 1).
iα
The remaining equations arise from forcing equal amounts of red and blue
along each line. This results in the values etc.,
6 281 2548 548
α ,α ,...,
which gives the current best solution for x + y = 2z, namely there are
2-colorings which have only 21172192(1 o(1)) n monochromatic 3-AP’s.
![Page 125: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/125.jpg)
x 2y 3z all blue start
Another equation
![Page 126: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/126.jpg)
x 2y 3z random start
![Page 127: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/127.jpg)
Two runs of x + y = z
(random starts)
![Page 128: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/128.jpg)
Two runs of x + y = z
(random starts)
411
611
111
Known optimal coloring for x + y = z.
![Page 129: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/129.jpg)
We next show the best currently known patterns for minimizing monochromatic
solutions to certain equations Ax + By = Cz for 2-colorings of [n], where A + B = C.
![Page 130: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/130.jpg)
We next show the best currently known patterns for minimizing monochromatic
solutions to certain equations Ax + By = Cz for 2-colorings of [n], where A + B = C.
These were found by first doing a local perturbation of a coloring until it went to
a locally minimal pattern, in the sense that changing no single block gives any
improvement to the overall structure.
![Page 131: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/131.jpg)
We next show the best currently known patterns for minimizing monochromatic
solutions to certain equations Ax + By = Cz for 2-colorings of [n], where A + B = C.
These were found by first doing a local perturbation of a coloring until it went to
a locally minimal pattern, in the sense that changing no single block gives any
improvement to the overall structure. We then took the resulting (approximate)
structure and optimized so that on each line in the pattern intersected equal
amounts of each color.
![Page 132: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/132.jpg)
We next show the best currently known patterns for minimizing monochromatic
solutions to certain equations Ax + By = Cz for 2-colorings of [n], where A + B = C.
These were found by first doing a local perturbation of a coloring until it went to
a locally minimal pattern, in the sense that changing no single block gives any
improvement to the overall structure. We then took the resulting (approximate)
structure and optimized so that on each line in the pattern intersected equal
amounts of each color.
In the following figures we indicate the coefficient of n corresponding to
random ( ), the coefficient of the current best known configuration ( )
and we show what fraction of random we are currently achieving ( ).
We also show the coloring of the current best known configuration.
αγαγ
2
![Page 133: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/133.jpg)
![Page 134: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/134.jpg)
![Page 135: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/135.jpg)
![Page 136: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/136.jpg)
![Page 137: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/137.jpg)
![Page 138: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/138.jpg)
![Page 139: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/139.jpg)
![Page 140: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/140.jpg)
![Page 141: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/141.jpg)
![Page 142: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/142.jpg)
We collect information on all these patterns in the plot below. On the bottom axis is A/C (which will run between 0 and 1, with 1 corresponding to x + y = 2z) and on the vertical axis is (which again runs from 0 to 1).
αγ
With this “normalization” we would expect that the curve formed from all points would be continuous, i.e., a small change in A/C would result in a small change in since the same pattern should be a good approximation for both.
αγ
A/C
![Page 143: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/143.jpg)
We collect information on all these patterns in the plot below. On the bottom axis is A/C (which will run between 0 and 1, with 1 corresponding to x + y = 2z) and on the vertical axis is (which again runs from 0 to 1).
αγ
With this “normalization” we would expect that the curve formed from all points would be continuous, i.e., a small change in A/C would result in a small change in since the same pattern should be a good approximation for both.
αγ
However, there are some gaps!. The most interesting (as of now) are the ones around 2/5 and 3/5, corresponding to the equation 2x + 3y = 5z (in blue). Something seems to be happening in that region, e.g., we haven’t been able to identify any stable behavior for the equation 7x + 10y = 17z.
A/C
![Page 144: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/144.jpg)
We collect information on all these patterns in the plot below. On the bottom axis is A/C (which will run between 0 and 1, with 1 corresponding to x + y = 2z) and on the vertical axis is (which again runs from 0 to 1).
αγ
With this “normalization” we would expect that the curve formed from all points would be continuous, i.e., a small change in A/C would result in a small change in since the same pattern should be a good approximation for both.
αγ
However, there are some gaps!. The most interesting (as of now) are the ones around 2/5 and 3/5, corresponding to the equation 2x + 3y = 5z (in blue). Something seems to be happening in that region, e.g., we haven’t been able to identify any stable behavior for the equation 7x + 10y = 17z.
What happens as A/C 0 ? Does curve stay below 0.95 or does it tend to 1 ?
A/C
![Page 145: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/145.jpg)
We have primarily just examined equations of the form
Ax + By = Cz with A + B = C. These are all density regular
equations and, in particular, solutions are invariant under
translation.
![Page 146: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/146.jpg)
We have primarily just examined equations of the form
Ax + By = Cz with A + B = C. These are all density regular
equations and, in particular, solutions are invariant under
translation.
In every case except one, the best colorings we found are composed
of a finite number of anti-symmetrically colored blocks, such as
28 6 28 37 59 2828 63759116 116
for x + y = 2z.
![Page 147: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/147.jpg)
We have primarily just examined equations of the form
Ax + By = Cz with A + B = C. These are all density regular
equations and, in particular, solutions are invariant under
translation.
In every case except one, the best colorings we found are composed
of a finite number of anti-symmetrically colored blocks, such as
28 6 28 37 59 2828 63759116 116
for x + y = 2z.
The one exceptional equation we found is 2x + 3y = 5z.
Here is a picture of what the heuristic algorithm always produced.
![Page 148: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/148.jpg)
2x 3y 5z all blue start
![Page 149: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/149.jpg)
This picture also consists of “blocks”, but this time the blocks
are formed by alternating blue/red (and red/blue) strings.Performing a similar local optimizing procedure on these blocks
gives a value of = 0.923755…, which is unexpectedly low.
αγ
![Page 150: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/150.jpg)
This picture also consists of “blocks”, but this time the blocks
are formed by alternating blue/red (and red/blue) strings.Performing a similar local optimizing procedure on these blocks
gives a value of = 0.923755…, which is unexpectedly low.
αγ
Presumably, this is the optimal coloring for 2x + 3y = 5z although
we can’t prove it.
blue odd, red even
red odd, blue even
………
![Page 151: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/151.jpg)
This picture also consists of “blocks”, but this time the blocks
are formed by alternating blue/red (and red/blue) strings.Performing a similar local optimizing procedure on these blocks
gives a value of = 0.923755…, which is unexpectedly low.
αγ
Presumably, this is the optimal coloring for 2x + 3y = 5z although
we can’t prove it. What is different about this equation ?
blue odd, red even
red odd, blue even
………
![Page 152: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/152.jpg)
For the equation E: ax + by = cz with a + b = c, random 2-colorings
are never optimal.
In fact, it can be shown that the optimal 2-coloring of [n]
has at most times as many monochromatic solutions
to E as a random one does.
21
2bc1
For example, for 3-AP’s, (i.e., E: x + y = 2z), this ratio is 78
0.875
while the truth appears to be 0.854… .
![Page 153: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/153.jpg)
Are random colorings ever optimal ?
Yes !Yes !
![Page 154: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/154.jpg)
Are random colorings ever optimal ?
Yes !Yes !
Let E denote the equation x + y = z + w.
![Page 155: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/155.jpg)
Are random colorings ever optimal ?
Yes !Yes !
Let E denote the equation x + y = z + w.
If we count permutations of solutions as different then
it easy to compute that E has solutions in [n]. 3 22n O(n )
3
![Page 156: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/156.jpg)
Are random colorings ever optimal ?
Yes !Yes !
Let E denote the equation x + y = z + w.
If we count permutations of solutions as different then
it easy to compute that E has solutions in [n]. 3 22n O(n )
3
Thus, in a random 2-coloring of [n] we would expect
to find monochromatic solutions.
33 2 22n1 O(n ) n12
O(n )8 3
![Page 157: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/157.jpg)
Are random colorings ever optimal ?
Yes !Yes !
Let E denote the equation x + y = z + w.
If we count permutations of solutions as different then
it easy to compute that E has solutions in [n]. 3 22n O(n )
3
Thus, in a random 2-coloring of [n] we would expect
to find monochromatic solutions.
33 2 22n1 O(n ) n12
O(n )8 3
In fact, anyany 2-coloring of [n] must produce
at least this many monochromatic solutions.
![Page 158: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/158.jpg)
Sketch of proof:
Let {red, blue} be a 2-coloring of [n] = {1,2,…,n}.
c :[n]
Think of where N > 2n.N[n] Z
Define by f(x) = 1 if x is red, and 0 otherwisef :[n] {0,1}
and by g(x) = 1 if x is blue, and 0 otherwise.
g:[n] {0,1}
![Page 159: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/159.jpg)
Sketch of proof:
Let {red, blue} be a 2-coloring of [n] = {1,2,…,n}.
c :[n]
Think of where N > 2n.N[n] Z
Define by f(x) = 1 if x is red, and 0 otherwisef :[n] {0,1}
and by g(x) = 1 if x is blue, and 0 otherwise.
g:[n] {0,1}
Thus, [n]f g 1
The number of monochromatic solutions to x + y = z + w
is given by the expression
N
2 2
x
C: ((ff )(x) (g g)(x) )
Z
where denotes convolution.
![Page 160: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/160.jpg)
With2πijk 2πi(N 1)k
N N
N1 0 k N,ke (1,...,e ,...,e ),
as an orthonormal basis for our Fourier transform , we have
F G F G N ||F|| ||F|| andN
2πixξN1
Nx
F(ξ) F(x)e
Z
![Page 161: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/161.jpg)
With2πijk 2πi(N 1)k
N N
N1 0 k N,ke (1,...,e ,...,e ),
as an orthonormal basis for our Fourier transform , we have
F G F G N ||F|| ||F|| and
Thus,
2 2|| ff || || g g|| N
2 2
x
C: ((ff )(x) (g g)(x) )
Z
N
2πixξN1
Nx
F(ξ) F(x)e
Z
2 2|| ff || || g g|| 2 2 2 2( || f || || f || || g || || g|| ) N
![Page 162: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/162.jpg)
With2πijk 2πi(N 1)k
N N
N1 0 k N,ke (1,...,e ,...,e ),
as an orthonormal basis for our Fourier transform , we have
F G F G N ||F|| ||F|| and
Thus,
2 2|| ff || || g g|| N
2 2
x
C: ((ff )(x) (g g)(x) )
Z
2 2|| ff || || g g|| 2 2 2 2( || f || || f || || g || || g|| ) N
4 4( || f || || g || ) N
N
4 4
ξ
(| f (ξ)| | g(ξ)| ) N
Z
N
2πixξN1
Nx
F(ξ) F(x)e
Z
![Page 163: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/163.jpg)
Continuing,
N
4 4
x
(| f (x)| | g(x)| ) N
Z
C
N
4
x
18
(| f (x)| | g(x)|) N
Z
(by C-S twice)
![Page 164: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/164.jpg)
Continuing,
N
4 4
x
(| f (x)| | g(x)| ) N
Z
C
N
4
x
18
(| f (x)| | g(x)|) N
Z
(by C-S twice)
N
4
x
18
(| f (x) g(x)|) N
Z
N
4
x
18
(| (f g)(x)|) N
Z
![Page 165: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/165.jpg)
Continuing,
N
4 4
x
(| f (x)| | g(x)| ) N
Z
C
N
4
x
18
(| f (x)| | g(x)|) N
Z
(by C-S twice)
N
4
x
18
(| f (x) g(x)|) N
Z
N
4
x
18
(| (f g)(x)|) N
Z
218
|| (f g) (f g)||
2[n] [n]
18
||1 1 ||
3 32 22n n18 3 12
O(n ) O(n )
and the claim is proved.
![Page 166: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/166.jpg)
In fact, none of the colorings we have produced for any ofthe equations ax + by = cz considered have been proved to be optimal (except for x + y = z).
![Page 167: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/167.jpg)
What happens for other equations ?
In fact, none of the colorings we have produced for any ofthe equations ax + by = cz considered have been proved to be optimal (except for x + y = z).
![Page 168: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/168.jpg)
What happens for other equations ?
In fact, none of the colorings we have produced for any ofthe equations ax + by = cz considered have been proved to be optimal (except for x + y = z).
Computational evidence strongly suggests that for the equation
E: x + ay = z, with \{1}, we havea N\
2
2E
1 o(1)2a(a 2a 3)
f (n) n .
![Page 169: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/169.jpg)
What happens for other equations ?
In fact, none of the colorings we have produced for any ofthe equations ax + by = cz considered have been proved to be optimal (except for x + y = z).
Computational evidence strongly suggests that for the equation
E: x + ay = z, with \{1}, we havea N\
2
2E
1 o(1)2a(a 2a 3)
f (n) n .
What are the corresponding results for 4-AP’s4-AP’s (or k-AP’s) ??
![Page 170: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/170.jpg)
A good coloring for avoiding monochromatic 4-AP’s
In this case, the number of monochromatic 4-AP’s
is at most where
24c n O(n)
![Page 171: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/171.jpg)
A good coloring for avoiding monochromatic 4-AP’s
In this case, the number of monochromatic 4-AP’s
is at most where
24c n O(n)
c = 4
![Page 172: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/172.jpg)
A good coloring for avoiding monochromatic 4-AP’s
In this case, the number of monochromatic 4-AP’s
is at most where
24c n O(n)
c =
Is this the “truth”?
4
![Page 173: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/173.jpg)
A good coloring for avoiding monochromatic 4-AP’s
In this case, the number of monochromatic 4-AP’s
is at most where
24c n O(n)
c =
Is this the “truth”?
4
![Page 174: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/174.jpg)
Sensational result (Ben Green and Terry Tao – 2003):
There are arbitrarily long arithmetic progressions of primes.
Finding k-AP’s in sparse sets.
![Page 175: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/175.jpg)
Sensational result (Ben Green and Terry Tao – 2003):
There are arbitrarily long arithmetic progressions of primes.
Ben Green – Cambridge Univ.
Terry Tao - UCLA
Finding k-AP’s in sparse sets.
![Page 176: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/176.jpg)
In fact, they show that there exists a
k-term arithmetic progression of primes
222
222
2100 k
which are all less than
![Page 177: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/177.jpg)
In fact, they show that there exists a
k-term arithmetic progression of primes
222
222
2100 k
(This is probably not best possible !)
which are all less than
![Page 178: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/178.jpg)
An even tougher challenge.
Show that there exist arbitrarily long AP’s of consecutive primes.
The current record is 10, given be the following numbers:
k 0, 1,...,9,P 210 k,
![Page 179: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/179.jpg)
An even tougher challenge.
Show that there exist arbitrarily long AP’s of consecutive primes.
The current record is 10, given be the following numbers:
k 0, 1,...,9,P 210 k,
where
P = 100 99697 24697 14247 63778 66555 87969 84032 95093 24689 19004 18036 03417 75890 43417 03348 88215 90672
29719(found by M. Toplic in 1998)
![Page 180: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/180.jpg)
An even tougher challenge.
Show that there exist arbitrarily long AP’s of consecutive primes.
The current record is 10, given be the following numbers:
k 0, 1,...,9,P 210 k,
where
P = 100 99697 24697 14247 63778 66555 87969 84032 95093 24689 19004 18036 03417 75890 43417 03348 88215 90672
29719(found by M. Toplic in 1998)
Will we ever find 11 ??
![Page 181: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/181.jpg)
Schur’s theorem (finite version):
For all r, there is a least Sc(r) such that any r-coloring
of [Sc(r)] contains a monochromatic solution of x y z.
Some open Some open problemsproblems
![Page 182: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/182.jpg)
Schur’s theorem (finite version):
For all r, there is a least Sc(r) such that any r-coloring
of [Sc(r)] contains a monochromatic solution of x y z.
It is known that 1 2rc π Sc(r) c r !
Some open Some open problemsproblems
![Page 183: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/183.jpg)
Schur’s theorem (finite version):
For all r, there is a least Sc(r) such that any r-coloring
of [Sc(r)] contains a monochromatic solution of x y z.
It is known that 1 2rc π Sc(r) c r !
(Old) Problem. Is
1/ rSc(r)lim ?r r
Some open Some open problemsproblems
![Page 184: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/184.jpg)
Schur’s theorem (finite version):
For all r, there is a least Sc(r) such that any r-coloring
of [Sc(r)] contains a monochromatic solution of x y z.
It is known that 1 2rc π Sc(r) c r !
(Old) Problem. Is
1/ rSc(r)lim ?r r
$100
Some open Some open problemsproblems
![Page 185: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/185.jpg)
Suppose we consider the “off-diagonal” van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there either is a red k-AP or a blue l-AP.
![Page 186: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/186.jpg)
k 3 4 5 6 7 8 9 10 11 12 13
W(k,3) 9 18 22 32 46 58 77 97 114 135 160
Suppose we consider the “off-diagonal” van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there either is a red k-AP or a blue l-AP.
![Page 187: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/187.jpg)
k 3 4 5 6 7 8 9 10 11 12 13
W(k,3) 9 18 22 32 46 58 77 97 114 135 160
k
W(k,3)
Suppose we consider the “off-diagonal” van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there either is a red k-AP or a blue l-AP.
![Page 188: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/188.jpg)
k 3 4 5 6 7 8 9 10 11 12 13
W(k,3) 9 18 22 32 46 58 77 97 114 135 160
k
W(k,3)
Suppose we consider the “off-diagonal” van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there either is a red k-AP or a blue l-AP.
Any conjectures ?Any conjectures ?
![Page 189: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/189.jpg)
k 3 4 5 6 7 8 9 10 11 12 13
W(k,3) 9 18 22 32 46 58 77 97 114 135 160
k
W(k,3) Any conjectures ?Any conjectures ?
Only known that c' logkck W(k,3) k
Suppose we consider the “off-diagonal” van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there either is a red k-AP or a blue l-AP.
![Page 190: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/190.jpg)
We can prove the following related result.Consider the modified off-diagonal van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there is either a red consecutive block of length k or a blue l-AP.
![Page 191: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/191.jpg)
We can prove the following related result.
Theorem (RLG – 2006)
For a suitable constant c > 0,
Consider the modified off-diagonal van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there is either a red consecutive block of length k or a blue l-AP.
clogkW(k,3) k .
![Page 192: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/192.jpg)
We can prove the following related result.
Theorem (RLG – 2006)
For a suitable constant c > 0,
Consider the modified off-diagonal van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there is either a red consecutive block of length k or a blue l-AP.
clogkW(k,3) k .
Unfortunately, the best upper bound we have is32c'kW(k,3) k .
![Page 193: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/193.jpg)
We can prove the following related result.
Theorem (RLG – 2006)
For a suitable constant c > 0,
Consider the modified off-diagonal van der Waerden number W(k, l)
defined as the least integer such that if [W(k, l)] is 2-colored red and blue,
then there is either a red consecutive block of length k or a blue l-AP.
clogkW(k,3) k .
Which bound is closer to the truth?
Unfortunately, the best upper bound we have is32c'kW(k,3) k .
![Page 194: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/194.jpg)
Restricted van der Waerden
It was shown by Spencer (1975) that the following restricted
version of van der Waerden’s theorem holds.
For every k, there exists a finite set S(k) with the properties:
(i) any 2-coloring always produces a monochromatic k-AP;
(ii) S(k) does not contain a (k + 1)-AP.
![Page 195: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/195.jpg)
Restricted van der Waerden
It was shown by Spencer (1975) that the following restricted
version of van der Waerden’s theorem holds.
For every k, there exists a finite set S(k) with the properties:
(i) any 2-coloring always produces a monochromatic k-AP;
(ii) S(k) does not contain a (k + 1)-AP.
We have no idea of the sizes s(k) = |S(k)| of the smallest
sets S(k) which satisfy the above conditions.
![Page 196: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/196.jpg)
Restricted van der Waerden
It was shown by Spencer (1975) that the following restricted
version of van der Waerden’s theorem holds.
For every k, there exists a finite set S(k) with the properties:
(i) any 2-coloring always produces a monochromatic k-AP;
(ii) S(k) does not contain a (k + 1)-AP.
We have no idea of the sizes s(k) = |S(k)| of the smallest
sets S(k) which satisfy the above conditions.
For example, is it true that s(k)W(k)
as k ?
![Page 197: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/197.jpg)
Recall that an equation is r-regular if for any partition
of into r color classes, there is a monochromatic solution to this equation.
1 2 n) 0E(x ,x ,...,x
Conjecture: (Rado – 1933)
For each n, there is an M = M(n) so that if the linear
homogeneous equation is M-regular,
then in fact the equation is regular.
1 2 n) 0E(x ,x ,...,x
![Page 198: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/198.jpg)
Recall that an equation is r-regular if for any partition
of into r color classes, there is a monochromatic solution to this equation.
1 2 n) 0E(x ,x ,...,x
Conjecture: (Rado – 1933)
For each n, there is an M = M(n) so that if the linear
homogeneous equation is M-regular,
then in fact the equation is regular.
1 2 n) 0E(x ,x ,...,x
The conjecture holds for n = 1 and n = 2. (Rado – 1933)
![Page 199: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/199.jpg)
Recall that an equation is r-regular if for any partition
of into r color classes, there is a monochromatic solution to this equation.
1 2 n) 0E(x ,x ,...,x
Conjecture: (Rado – 1933)
For each n, there is an M = M(n) so that if the linear
homogeneous equation is M-regular,
then in fact the equation is regular.
1 2 n) 0E(x ,x ,...,x
The conjecture holds for n = 1 and n = 2. (Rado – 1933)
The conjecture also holds for n = 3 with M(3) = 24. (Fox and Kleitman – 2005)
![Page 200: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/200.jpg)
Recall that an equation is r-regular if for any partition
of into r color classes, there is a monochromatic solution to this equation.
1 2 n) 0E(x ,x ,...,x
Conjecture: (Rado – 1933)
For each n, there is an M = M(n) so that if the linear
homogeneous equation is M-regular,
then in fact the equation is regular.
1 2 n) 0E(x ,x ,...,x
The conjecture holds for n = 1 and n = 2. (Rado – 1933)
The conjecture also holds for n = 3 with M(3) = 24. (Fox and Kleitman – 2005)
ChallengeChallenge: Prove that M(n) always exists, and determine (or estimate) its value.
![Page 201: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/201.jpg)
Let W*(k) denote the least integer such that there is a set S(k) of integers
of size W*(k) such that any 2-coloring always produces a monochromatic k-AP.
Thus, W * (k) W(k).
![Page 202: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/202.jpg)
Let W*(k) denote the least integer such that there is a set S(k) of integers
of size W*(k) such that any 2-coloring always produces a monochromatic k-AP.
Thus, W * (k) W(k).
It is known that W*(3) = 9 = W(3) but that 27W * (4) 35 W(4).
The characteristic function of one such S(4) is:
1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 0 0 1
![Page 203: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/203.jpg)
Let W*(k) denote the least integer such that there is a set S(k) of integers
of size W*(k) such that any 2-coloring always produces a monochromatic k-AP.
Thus, W * (k) W(k).
It is known that W*(3) = 9 = W(3) but that 27W * (4) 35 W(4).
Does W(k) W * (k) as k ?
The characteristic function of one such S(4) is:
1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 0 0 1
Is this the correct value of W*(4)?
![Page 204: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/204.jpg)
Let W*(k) denote the least integer such that there is a set S(k) of integers
of size W*(k) such that any 2-coloring always produces a monochromatic k-AP.
Thus, W * (k) W(k).
It is known that W*(3) = 9 = W(3) but that 27W * (4) 35 W(4).
Does W(k) W * (k) as k ?
The characteristic function of one such S(4) is:
1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 0 0 1
Is boundedW(k)W*(k)
as k ?
Is this the correct value of W*(4)?
![Page 205: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/205.jpg)
Let W*(k) denote the least integer such that there is a set S(k) of integers
of size W*(k) such that any 2-coloring always produces a monochromatic k-AP.
Thus, W * (k) W(k).
It is known that W*(3) = 9 = W(3) but that 27W * (4) 35 W(4).
Does W(k) W * (k) as k ?
The characteristic function of one such S(4) is:
1 0 0 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 0 0 1
Is boundedW(k)W*(k)
as k ?
What happens with r colors?
Is this the correct value of W*(4)?
![Page 206: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/206.jpg)
What about the regularity of nonlinear equations ?
For example, it is known that the equation
k1 2
1 2 k
aa a
x x x0...
is regular if and only if the corresponding equation
1 1 2 2 k kax a x ... a x 0
is regular.
![Page 207: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/207.jpg)
What about the regularity of nonlinear equations ?
For example, it is known that the equation
k1 2
1 2 k
aa a
x x x0...
is regular if and only if the corresponding equation
1 1 2 2 k kax a x ... a x 0
is regular.
Beautiful old Beautiful old questionquestion
Is regular ? 2 2 2x y z
![Page 208: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/208.jpg)
What about the regularity of nonlinear equations ?
For example, it is known that the equation
k1 2
1 2 k
aa a
x x x0...
is regular if and only if the corresponding equation
1 1 2 2 k kax a x ... a x 0
is regular.
Beautiful old Beautiful old questionquestion
Is regular ? 2 2 2x y z$100
![Page 209: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/209.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
An unexpected twistAn unexpected twist
![Page 210: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/210.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
Must every 4-coloring of produce a monochromatic solution of L ?
R
An unexpected twistAn unexpected twist
![Page 211: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/211.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
Must every 4-coloring of produce a monochromatic solution of L ?
R
Well, it depends !
An unexpected twistAn unexpected twist
![Page 212: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/212.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
Must every 4-coloring of produce a monochromatic solution of L ?
R
Well, it depends ! The answer is no in ZFC.
An unexpected twistAn unexpected twist
![Page 213: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/213.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
Must every 4-coloring of produce a monochromatic solution of L ?
R
Well, it depends ! The answer is no in ZFC.
(LM is the axiom that every set of reals is Lebesgue measurable)
However, the answer is yes in ZF + LM.
Radoičič, Fox, Alexeev, RLG - 2007
An unexpected twistAn unexpected twist
![Page 214: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/214.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
Must every 4-coloring of produce a monochromatic solution of L ?
R
Well, it depends ! The answer is no in ZFC.
(LM is the axiom that every set of reals is Lebesgue measurable)
A theorem of Solovay asserts that ZFC and ZF + LM are equally consistent.
However, the answer is yes in ZF + LM.
Radoičič, Fox, Alexeev, RLG - 2007
An unexpected twistAn unexpected twist
![Page 215: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/215.jpg)
Consider the linear equation L:
x + y + z = 4w
It is easy to 4-color so that L has no monochromatic solution
(for example, define ). a(5 (5b c)) c
Must every 4-coloring of produce a monochromatic solution of L ?
R
Well, it depends ! The answer is no in ZFC.
(LM is the axiom that every set of reals is Lebesgue measurable)
A theorem of Solovay asserts that ZFC and ZF + LM are equally consistent.
However, the answer is yes in ZF + LM.
Radoičič, Fox, Alexeev, RLG - 2007
For which (sets of) equations do we have this distinction ?
An unexpected twistAn unexpected twist
![Page 216: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/216.jpg)
A classic conjecture of Erdös
If then X contains k-AP’s for every k.N 1x
x X
X with
$3000
![Page 217: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/217.jpg)
A classic conjecture of Erdös
If then X contains k-AP’s for every k.N 1x
x X
X with
$3000
Warm-up problem. Prove this holds for k = 3.
![Page 218: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/218.jpg)
If then X contains 4 vertices of a square.
A classic conjecture of Erdös
If then X contains k-AP’s for every k.N 1x
x X
X with
$3000
Warm-up problem. Prove this holds for k = 3.
(Two-dimensional analogue - RLG).
N N 2 21
x y(x,y) X
X with
![Page 219: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/219.jpg)
If then X contains 4 vertices of a square.
A classic conjecture of Erdös
If then X contains k-AP’s for every k.N 1x
x X
X with
$3000
Warm-up problem. Prove this holds for k = 3.
(Two-dimensional analogue - RLG).
N N 2 21
x y(x,y) X
X with
$1000
![Page 220: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/220.jpg)
![Page 221: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/221.jpg)
Paul is surprised when finally gets to read The Book
![Page 222: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/222.jpg)
![Page 223: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/223.jpg)
“Very creative. Very imaginative. Logic……that’s what’s missing.”
![Page 224: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/224.jpg)
![Page 225: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/225.jpg)
Front Row: Mrs. van Lint, Robert Rankin, Mrs. Rankin, Gina Birch, J. H. van Lint, L. J. Mordell, Mrs. Mordell, Paul Erdös (with Cheryl (" Che' ") Graham - Ron Graham's daughter), Mrs. Andrews.
Second Row: Mrs. J.B. Muskat (hidden), Mrs. T.R. Parkin (hidden), George Andrews, Stefan Burr, Mrs. S. Burr, Mrs. Pat Nickson, Francis Coghlan, Gérard Ligozat, John Tate, Bryan Birch, A.O.L. Atkin, Helmut Hasse, Marshall Hall Jnr.
Third Row: Pierre Barrucand, Juliette Barrucand, Yvette Amice, Harvey Cohn, Bernice Cohn, Bob Churchhouse, Julia Churchhouse, John Hunter, Richard Guy, Mrs. Kuroda, Michael Keates.
Fourth Row: Nelson Stephens, Ian Angell, Andy Mc Gettrick, Mrs. Straus, Daniel Straus, E. G. Straus, Paul Bateman, Fenella Rankin, Mohinder Cheema, K. Kloos, S. Kuroda, Terence Jackson.
Fifth Row: Ian Anderson, Marie-Nicole Montouchet, M. G. Gras, A. S. Fraenkel, Olga Taussky-Todd, Synolda Butler, ø. Rødseth, Susan Cohn, Debra Baumert, Anthony Cohn, Jean Pierre Serre, John Leech.
Back Row: George Greaves, Lyliane Bouvier, Jean Fresnel, Marvin Wunderlich, Horst Zimmer, Christiane Martinet, Jacques Martinet, John Todd, Albrecht Pfister, S. Mossige, J. Hjelle, John Brillhart.
![Page 226: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/226.jpg)
![Page 227: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/227.jpg)
Front Row: Mrs. Andrews, Mrs. H. Fredricksen, Mrs. K. Kloos, Mrs. Cassels, Jane Pitman, Mrs. J. Merriman, Felice Bateman, Sally Bateman, Harriet Cantor.
Second Row: E. S. Selmer, J. C. P. Miller, Ron Graham , John Selfridge, John Merriman, H. Tverberg, David Cantor, Andrzej Schinzel, Helen Alderson, J. W. S. Cassels.
Third Row: Michael Keates, Peter Pleasants, Elwyn Berlekamp, Emma Lehmer, D. H. Lehmer, Joseph Muskat, C.E. Fröberg, Robert Spira.
Fourth Row: H.G. Apsimon, Peter Swinnerton-Dyer, Albrecht Fröhlich, A. M. Macbeath, O. Hermann, J.C. Herz, Georges Poitou, John Conway, John Chalk.
Fifth Row: V. Felsch, J. Larmouth, O. Kolberg, Bob Laxton, Peter Weinberger, Roger Cook, Jonathan Hall, T.R. Parkin, J.H.E. Cohn, John Cosgrave.
Back Row: H. J. Godwin, Fred Lunnon, T. Kløve, H. Fredricksen, Jack Howlett, A. L. Dulmage, Nathan Mendelsohn, Leonard Baumert, Hans Riesel, Harold Stark
![Page 228: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/228.jpg)
![Page 229: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/229.jpg)
![Page 230: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/230.jpg)
![Page 231: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/231.jpg)
Frank Plumpton Ramsey(1903-1930)
Arthur Michael Ramsey
100th Archbishop of Canterbury
(1904-1988)
![Page 232: The combinatorics of solving linear equations Origins: (I. Schur) Does the congruence always have non-trivial solutions? 1875 - 1941](https://reader036.vdocuments.us/reader036/viewer/2022062409/56649ea95503460f94bae161/html5/thumbnails/232.jpg)
Current champs