Sara Billey, Ioana Dumitriu, Chris Hoffman, Monty McGovern, Isabella Novik
| First Year | |||
|---|---|---|---|
| If Combinatorics is offered, take that. Otherwise, take Complex Analysis (534/5/6). Also take the following: | |||
| 504 | 505 | 506 | (Algebra) |
| 544 | 545 | 546 | (Manifolds) |
|
|
Choose from the following, depending on what is offered: | ||
| (Classes in areas such as Combinatorial Geometry, Algebraic Combinatorics, Algebraic Structures, Probability, Discrete Optimization, etc.) | |||
| 507 | 508 | (Algebraic Geometry (after some commutative algebra)) | |
| 564 | 565 | 566 | (Algebraic Topology) |
| (Algorithm design and computational complexity*) | |||
-
*Some exposure to algorithm design and theories of computational complexity is required. This could be provided by one or more of the following courses given by the Computer Science department: 421, 431, 521-522 or 531-532. Admission to these courses requires special permission from the Computer Science department, but for qualified students that is not hard to arrange.
-
COMPUTER PROGRAMMING:
-
Students studying combinatorics should have reasonable programming skills. In particular, PhD students are strongly recommended to pass the computer programming exam.
-
SEMINAR:
-
Students interested in combinatorics should consider enrolling in and attending the Combinatorics Seminar on a weekly basis. The topics covered in the seminar range over a broad spectrum of research in combinatorics and should provide students with potential areas for further reading or thesis options.
