| Math 121b |
|
| Combinatorial Analysis | |
| Winter 2005-06 | |
|
TR 3:00 - 4:30 PM, 151
Sloan |
|
|
|
Instructor:
Peter
Keevash, 280 Sloan, 395-4369, keevash@caltech.edu
Grader: Benjamin Leitner, 156 Sloan, 395-6805, leitner@caltech.edu, office hours: 10pm Tuesdays |
|
|
|
|
| Next Tuesday (March 7th) will be the final class for this course. |
|
|
|
Ma 121 is the advanced undergraduate/introductory graduate course in combinatorics. In the second term we will concentrate on two powerful techniques for solving combinatorial problems: the linear algebra method and the probabilistic method. Topics covered will include classical results of extremal set theory, designs and codes from the algebraic perspective, together with sieves and random walks from the probabilistic perspective. We will also explore some connections with theoretical computer science, such as computational complexity and derandomisation. |
|
|
| Grades will be based
on homework assignments. There will be no examinations. You may discuss
homework problems with other students, but solutions should be written up
individually, in your own words.
Late homework will not be tolerated in this class. Any work received after its deadline will receive no credit. |
|
|
|
|
|
|