|
Course: |
MTH G331 Algebraic Combinatorics |
|
Instructor: |
|
|
Time and Place: |
Mon-Wed |
|
Textbook: |
|
The subject of algebraic combinatorics is (not very surprisingly) interplay between algebra and combinatorics. This is beneficial for both disciplines. On the one hand, algebraic methods can be used with much success for studying classical combinatorial objects such as graphs, posets, etc. On the other hand, there are many algebraic questions that can be stated in combinatorial terms and solved by combinatorial methods, sometimes bringing to life new combinatorial concepts of independent interest. For instance, the representation theory of symmetric groups is closely related with the combinatorics of partitions and Young tableaux. This course discusses both kinds of development. The main objects to be discussed are graphs and trees on the one side, and posets and partitions on the other, with numerous interactions among them. The prerequisites include basic facts from enumerative combinatorics and good working knowledge of basic linear algebra.
The grade will be based on homework assignments, and possibly students' presentations.
Northeastern University
Boston, MA,
Office: 431 LA
Phone: (617) 373-5648
Email: andrei (at) neu (dot) edu
Back to my home page.
Created: July 17, 2006.
Last modified: September 7, 2006.