# Forskjeller

Her vises forskjeller mellom den valgte versjonen og den nåværende versjonen av dokumentet.

Begge sider forrige revisjon Forrige revisjon Neste revisjon | Forrige revisjon | ||

ma3150:2019v:start [2019-03-15] seip [Oral presentations] |
ma3150:2019v:start [2019-03-19] (nåværende versjon) seip [Guidance and consultation before the exam] |
||
---|---|---|---|

Linje 27: | Linje 27: | ||

The syllabus for the course is as defined by the lectures described in detail below. I expect you to be able to present the basic concepts and ideas discussed during the lectures. The exercises should be viewed as an integral part of the syllabus. | The syllabus for the course is as defined by the lectures described in detail below. I expect you to be able to present the basic concepts and ideas discussed during the lectures. The exercises should be viewed as an integral part of the syllabus. | ||

+ | |||

+ | The final lecture took place on March 19. You are supposed to work on the topic for your oral presentation during the four remaining weeks of the semester. | ||

===== Reference Group ===== | ===== Reference Group ===== | ||

Linje 59: | Linje 61: | ||

* Lecture 19, March 12. We continue our discussion of primitive characters and Gauss sums, covering roughly 8.8 - 8.12 in Apostol. | * Lecture 19, March 12. We continue our discussion of primitive characters and Gauss sums, covering roughly 8.8 - 8.12 in Apostol. | ||

* Lecture 20, March 18. We establish the functional equation for \( L(s,\chi) \) when \( \chi \) is a primitive character, following Ch. 9 in Davenport. | * Lecture 20, March 18. We establish the functional equation for \( L(s,\chi) \) when \( \chi \) is a primitive character, following Ch. 9 in Davenport. | ||

- | * Lecture 21, March 19 (FINAL LECTURE). We recall our route to the prime number theorem and discuss how to proceed to obtain the corresponding result for arithmetic progressions. The lecture will include some words on zero-free regions (see Ch. 14 in Davenport). | + | * Lecture 21, March 19 (FINAL LECTURE). We recall our route to the prime number theorem and discuss how to proceed to obtain the corresponding result for arithmetic progressions. The lecture will include some words on zero-free regions and Siegel zeros (see Ch. 14 in Davenport). |

Linje 88: | Linje 90: | ||

- Mean value theorems - results and conjectures | - Mean value theorems - results and conjectures | ||

- Zeta functions for which RH fails | - Zeta functions for which RH fails | ||

- | - Dirichlet's divisor problem, including Voronoi's summation formula | + | - Dirichlet's divisor problem, including Voronoi's summation formula (chosen by ''Lars Magnus Øverlier'') |

- Elementary sieve methods and Brun's theorem on twin primes (chosen by ''Daniel Olaisen'') | - Elementary sieve methods and Brun's theorem on twin primes (chosen by ''Daniel Olaisen'') | ||

- Voronin's universality theorem and value distribution of the Riemann zeta function | - Voronin's universality theorem and value distribution of the Riemann zeta function | ||

- | - Lagarias's version of Guy Robin's criterion | + | - Lagarias's version of Guy Robin's criterion (chosen by Morten ''Ravnemyr'') |

- The Beurling--Nyman condition for RH | - The Beurling--Nyman condition for RH | ||

- Li's criterion for RH (chosen by ''William Tell'') | - Li's criterion for RH (chosen by ''William Tell'') | ||

Linje 97: | Linje 99: | ||

- Alternate proofs of the functional equation for \( \zeta(s)\) (Titchmarsh gives 7 proofs; take a look and make your own selection of some of them) | - Alternate proofs of the functional equation for \( \zeta(s)\) (Titchmarsh gives 7 proofs; take a look and make your own selection of some of them) | ||

- Approximations of \(\zeta(s)\), including the approximate functional equation | - Approximations of \(\zeta(s)\), including the approximate functional equation | ||

- | - The Riemann--Weil explicit formula. | + | - The Riemann--Weil explicit formula |

+ | - Siegel zeros. | ||

The aim of the presentations is to convey to your peers what the topic is about and the most important and interesting problems and results associated with it. You are not expected to study proofs of deep theorems, but you should be able to say a little more than what we can find on the Wikipedia. You may choose to give a blackboard lecture or a Beamer/Powerpoint presentation. Each presentation should last for about 15--20 minutes. | The aim of the presentations is to convey to your peers what the topic is about and the most important and interesting problems and results associated with it. You are not expected to study proofs of deep theorems, but you should be able to say a little more than what we can find on the Wikipedia. You may choose to give a blackboard lecture or a Beamer/Powerpoint presentation. Each presentation should last for about 15--20 minutes. | ||

- | Please let me know your choice of topic before **March 29**. There should be only student per topic. Once a topic is chosen, I will make a note of it in the list above. Accordingly, we follow the principle of "first-come, first-served" when assigning topics. | + | Please let me know your choice of topic before **March 29**. There should be only one student per topic. Once a topic is chosen, I will make a note of it in the list above. Accordingly, we follow the principle of "first-come, first-served" when assigning topics. |

===== Exam, dates and location ===== | ===== Exam, dates and location ===== | ||

Linje 109: | Linje 112: | ||

===== Guidance and consultation before the exam ===== | ===== Guidance and consultation before the exam ===== | ||

- | I will be available for consultation | + | Before the Easter break, I will be available for consultation until April 3. I will be traveling April 4 -- 11, and will again be available on April 12. After the Easter break, I will be available only May 6 -- 7. |

- | | + | |

- | * April 4 -- 6 | + | |

- | * April 15 | + | |

- | * May 6 -- 7. | + | |

- | You may in principle come at "any" time during these days, but I would recommend that you contact me in advance to make an appointment. | + | You may in principle come at "any" time during the days I am in my office, but I would recommend that you contact me in advance to make an appointment. |