MATH-337 / 5 credits
Teacher: Richter Florian Karl
This is an introductory course to combinatorial number theory. The main objective of this course is to learn how to use combinatorial, probabilistic, and analytic methods to solve problems in number theory.
Combinatorial number theory is a field of research in mathematics that has seen tremendous growth in recent years. It is a very interdisciplinary subject, since it incorporates ideas from a wide range of different areas: harmonic analysis, graph theory, number theory, ergodic theory, discrete geometry, probability theory, and even theoretical computer science. But rest assured, you don't need any prerequisites from these areas to take this course, because we will keep things simple and develop everything we need along the way. We will cover various results in Ramsey theory (such as Schur's Theorem, van der Waerden's Theorem, or the Erdos-Szekeres Theorem) and in additive combinatorics (such as Roth's Theorem).
Combinatorial number theory, additive combinatorics, arithmetic combinatorics, additive number theory, Ramsey theory
first year math courses
By the end of the course, the student must be able to:
- Apply tools from combinatorics, probability theory, and discrete harmonic analysis to solve problems in number theory
- Prove results in additive combinatorics and Ramsey theory
- Use a work methodology appropriate to the task.
- Continue to work through difficulties or initial failure to find optimal solutions.
- Demonstrate a capacity for creativity.
- Demonstrate the capacity for critical thinking
lectures in hybrid form, exercise sessions with the teaching assistant in hybrid form
Written homework assignments, written final exam
Lecture notes will be provided
In the programs
- Semester: Fall
- Exam form: Written (winter session)
- Subject examined: Combinatorial number theory
- Lecture: 2 Hour(s) per week x 14 weeks
- Exercises: 2 Hour(s) per week x 14 weeks