Lectures: TR 2.30 - 4.00pm at E17-136
Instructor: Dr. Vidya Venkateswaran
E-mail: vidyav@math.mit.edu
Office: E17-331
Office Hours: W 3.30-5.00pm
Here is the course syllabus, which describes course requirements and the grading policy, and here is a list of possible topics.
| Date | Slot | Presenter | Topic |
|---|---|---|---|
| Tu Feb 10 | Talk 1 | Snow day | |
| Tu Feb 10 | Talk 2 | Snow day | |
| Th Feb 12 | Talk 1 | Callie M. | Infinity of primes |
| Th Feb 12 | Talk 2 | Frances R. | Friends and politicians |
| Tu Feb 17 | Talk 1 | No class | |
| Tu Feb 17 | Talk 2 | No class | |
| Th Feb 19 | Talk 1 | Dwyane G. | Five-coloring plane graph |
| Th Feb 19 | Talk 2 | Steven F. | Turan's graph theorem |
| Tu Feb 24 | Talk 1 | Carolyn C. | Completing the Latin square |
| Tu Feb 24 | Talk 2 | Manita S. | Tiling rectangles |
| Th Feb 26 | Talk 1 | Adit R. | Representing numbers as the sums of two squares |
| Th Feb 26 | Talk 2 | Sayeed T. | Communicating without errors |
| Tu Mar 3 | Talk 1 | Anthony S. | Law of quadratic reciprocity |
| Tu Mar 3 | Talk 2 | Seve E. | The Dinitz Problem |
| Th Mar 5 | Talk 1 | Michelle B. | Cayley's formula for the number of trees |
| Th Mar 5 | Talk 2 | Caelan G. | How to guard a museum |
| Tu Mar 10 | Talk 1 | Elizabeth S. | Lines in the plane and decompositions of graphs |
| Tu Mar 10 | Talk 2 | Eben B. | Shuffling cards |
| Th Mar 12 | Talk 1 | Kamil M. | Pigeonhole and double counting |
| Th Mar 12 | Talk 2 | Quiz 1 | |
| Tu Mar 17 | Talk 1 | Callie M. | Probability makes counting (sometimes) easy |
| Tu Mar 17 | Talk 2 | Frances R. | Lattice Paths and Determinants |
| Th Mar 19 | Talk 1 | Dwyane G. | Bertrand's postulate |
| Th Mar 19 | Talk 2 | Steven F. | Three applications of Euler's formula |
| Tu Mar 24 | Talk 1 | No class | |
| Tu Mar 24 | Talk 2 | No class | |
| Th Mar 26 | Talk 1 | No class | |
| Th Mar 26 | Talk 2 | No class | |
| Tu Mar 31 | Talk 1 | Carolyn C. | The slope problem |
| Tu Mar 31 | Talk 2 | Manita S. | Binomial coefficients are (almost) never powers |
| Th Apr 2 | Talk 1 | Adit R. | Chromatic number of Kneser graphs |
| Th Apr 2 | Talk 2 | Sayeed T. | Permanents and the Power of Entropy |
| Tu Apr 7 | Talk 1 | Anthony S. | Every finite division ring is a field |
| Tu Apr 7 | Talk 2 | Seve E. | Three Famous Theorems on Finite Sets |
| Th Apr 9 | Talk 1 | Michelle B. | Some irrational numbers |
| Th Apr 9 | Talk 2 | Caelan G. | Three times $\pi^{2}/6$ |
| Tu Apr 14 | Talk 1 | Elizabeth S. | Cauchy's Rigidity Theorem |
| Tu Apr 14 | Talk 2 | Eben B. | Every large point set has an obtuse angle |
| Th Apr 16 | Talk 1 | Kamil M. | Touching Simplices |
| Th Apr 16 | Talk 2 | Quiz 2 | |
| Tu Apr 21 | Talk 1 | no class | |
| Tu Apr 21 | Talk 2 | no class | |
| Th Apr 23 | Talk 1 | Dwyane G. | Dijkstra's algorithm |
| Th Apr 23 | Talk 2 | Frances R. | Bayesian methods and applications to Shepp's urn scheme |
| Tu Apr 28 | Talk 1 | Callie M. | Dependent random choice |
| Tu Apr 28 | Talk 2 | Steven F. | Adjacency matrices |
| Th Apr 30 | Talk 1 | Carolyn C. | Graphs with bounded clique number |
| Th Apr 30 | Talk 2 | Manita S. | Infection Spread |
| Tu May 5 | Talk 1 | Adit R. | Young Tableaux, Hooke's formula, and RSK algorithm |
| Tu May 5 | Talk 2 | Sayeed T. | Maximum Cut and Satisfiability Problems |
| Th May 7 | Talk 1 | Anthony S. | Isomorphic subgraphs within a graph |
| Th May 7 | Talk 2 | Seve E. | PageRank algorithm |
| Tu May 12 | Talk 1 | Michelle B. | Minc's conjecture |
| Tu May 12 | Talk 2 | Caelan G. | Conjugate gradient algorithm |
| Th May 14 | Talk 1 | Elizabeth S. | Ore's conjecture and the Grotzsch theorem |
| Th May 14 | Talk 2 | Eben B. | Quasi-Random Graphs |
| Date TBA | Makeup meeting | Kamil M. | Independence number of triangle-free graphs |