|
|
| Recommended
Program: Combinatorics |
|
Eric Babson, Sara Billey,
Branko Grünbaum, Vic Klee, Isabella Novik, and Rekha Thomas
| First Year |
| 504 |
505 |
506 |
(Algebra) |
| 544 |
545 |
546 |
(Manifolds) |
|
Second Year
|
Choose from the following, depending on what
is offered:
|
| 581 |
582 |
583 |
(Foundations in Combinatorics) |
| |
|
|
(Topics classes in areas such as Combinatorial
Geometry, Algebraic Combinatorics, Representation Theory, Commutative
Algebra, 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:
-
Student
studying combinatorics should have reasonable programming
skills. In particular, PhD sutdents are strong recommended
to pass the computer programming exam.
-
SEMINAR:
-
Students
interested in combinatorics should consider enrolling 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.
|
|
