Wiki source code of Topics in additive combinatorics and incidence geometry, fall 2015
Last modified by torponen@helsinki_fi on 2024/03/27 10:49
Show last authors
author | version | line-number | content |
---|---|---|---|
1 | = Topics in additive combinatorics and incidence geometry, fall 2015 = | ||
2 | |||
3 | |||
4 | |||
5 | {{panel}} | ||
6 | **Teacher:** [[Tuomas Orponen>>doc:mathstatHenkilokunta.Orponen, Tuomas]] | ||
7 | |||
8 | **Scope:** 5 cr | ||
9 | |||
10 | **Type:** Advanced studies | ||
11 | |||
12 | **Teaching: **(% style="line-height: 1.4285715;" %)Weeks 36-42, Monday and Friday 14-16 in room B321. First lecture on Friday Sept. 4th. | ||
13 | |||
14 | * (% style="color: rgb(153, 204, 0); color: rgb(0, 0, 255)" %)No lectures on Monday the 21st of September and Friday the 25th of September. | ||
15 | |||
16 | **Topics:** | ||
17 | |||
18 | (% style="list-style-type: square;" %) | ||
19 | * Freiman's theorem, | ||
20 | * Plünnecke-Ruzsa inequalities and Ruzsa's triangle inequality | ||
21 | * Roth's theorem on 3-term arithmetic progressions, | ||
22 | * Sum-product theory, including Solymosi's "4/3" theorem on the real line, and the Bourgain-Katz-Tao theorem in prime fields, | ||
23 | * The polynomial method in incidence geometry | ||
24 | * The Szemerédi-Trotter incidence theorem in the plane + applications | ||
25 | * The Kakeya problem in finite fields, and the Joints problem | ||
26 | * The multilinear Kakeya problem | ||
27 | |||
28 | **Prerequisites: **The tools needed will be introduced on the go. There will be bits and pieces from Fourier analysis and algebraic geometry used, but most arguments are quite combinatorial and elementary. You can check out the draft lecture notes below to assess yourself. | ||
29 | {{/panel}} | ||
30 | |||
31 | === {{toc maxLevel="4" minLevel="2" indent="20px"/}} === | ||
32 | |||
33 | == (% style="line-height: 1.5;" %)Course material (%%) == | ||
34 | |||
35 | The following lecture notes will be updated, amended – and certainly corrected – several times during the course: | ||
36 | |||
37 | [[attach:OrponenLectureNotes.pdf]] (Last update: 5/11/2015, added Laura's notes on multilinear Kakeya) | ||
38 | |||
39 | For additional reading, the most comprehensive text is | ||
40 | |||
41 | T. Tao and V. Vu: Additive Combinatorics, Cambridge University Press (2006) | ||
42 | |||
43 | For something freely available, you could try Ruzsa's lecture notes "Sumsets and structure", which you can easily find by googling. | ||
44 | |||
45 | == [[Registration>>url:https://oodi-www.it.helsinki.fi/hy/opintjakstied.jsp?html=1&Tunniste=57072||shape="rect"]] == | ||
46 | |||
47 | No registration needed, just come to the first lecture. | ||
48 | |||
49 | (% style="font-size: 20.0px;line-height: 1.5;" %)Exercises | ||
50 | |||
51 | There will most likely be no official exercises. Instead, the students will be given individual topics – perhaps an article, or a book section – which they should study, write notes about, and present during the "exercise sessions", whose timetable will be discussed on the first lecture. This presentation will also be the means to get credit for the course (so if you don't need credit, you won't be required to prepare a presentation). | ||
52 | |||
53 | (% style="font-size: 16.0px;font-weight: bold;line-height: 1.5;" %)Exercise classes | ||
54 | |||
55 | |=((( | ||
56 | Group | ||
57 | )))|=((( | ||
58 | Day | ||
59 | )))|=((( | ||
60 | Time | ||
61 | )))|=((( | ||
62 | Room | ||
63 | )))|=(% colspan="1" %)((( | ||
64 | Instructor | ||
65 | ))) | ||
66 | |((( | ||
67 | 1. | ||
68 | )))|((( | ||
69 | |||
70 | )))|((( | ||
71 | |||
72 | )))|((( | ||
73 | |||
74 | )))|(% colspan="1" %)((( | ||
75 | |||
76 | ))) | ||
77 | |||
78 | == Course feedback == | ||
79 | |||
80 | Course feedback can be given at any point during the course. Click [[here>>url:https://elomake.helsinki.fi/lomakkeet/11954/lomake.html||style="line-height: 1.4285;" shape="rect"]]. |