The topic will be symmetric functions. Most of the material will come from Chapter 7 of the lecturer's book Enumerative Combinatorics, volume 2.
Office hour: MF 3-4, room E17-434
grader: Wuttisak Trongsiriwat (email@example.com)
Problem sets. Problem sets will be due about once every two weeks. You will be asked to hand in a subset of your choosing of specified size from a list of problems. Hand in at most one part from any multipart problem unless specified otherwise. Each problem has a difficulty factor [d], such as [3-]. This is converted into a weight w(d), as follows.
Most, if not all of the problems, will be selected from here (version of 20 November 2013). Be sure you are using a version dated August 31 or later, as earlier versions have different problems numbers! Throughout the course later versions of the problems will only involve corrections; problem numbering will remain the same. If any new problems are added, they will be in a different file. You can get a head start in the course by solving all these problems. Problems should be solved primarily on your own. Some "reasonable" collaboration is permitted, but you shouldn't just obtain the solution from another source. Do not hand in a solution that you did not obtain on your own or did not obtain by collaboration with another student in the course! If you do collaborate with one or more students on a problem, please indicate their names.
Quiz: There will be an in-class quiz on December 6. It will count 20% of the course grade. Problem sets count 80%. Note. The only valid excuses for postponing or preponing the quiz are illness or serious personal problems.