Math 386: Combinatorics
Fall 2024
Links to: Schedule | Announcements (test information, textbook corrections and additions) | Additional Problems | My home page
Teacher
Thomas Zaslavsky
Office: WH-216
Email: zaslav@math.binghamton.edu
Links to my department home page and personal home page.
Class meets M, W, F 10:50–12:20 in CW 206.
Office hours
- M, W, F 1:30–3:30. No appointment is necessary at these times. If I seem busy, tell me you are waiting! (or I might not notice).
- Other hours by arrangement; feel free to make an appointment by e-mail or catch me after class.
Syllabus
The textbook is Peter J. Cameron, Combinatorics: Topics, Techniques, Algorithms, supplemented by Richard A. Brualdi, Introductory Combinatorics. I hope to cover most of Cameron's Chapters 1–10, depending on how the time works out, and most (but not all!) sections in most chapters. ** marks the fundamental chapters, * marks other chapters of high priority.
| Chapter |
|---|
| **3. Subsets, partitions, permutations |
| 1. What is combinatorics? |
| 2. On numbers and counting |
| **5. The principle of inclusion and exclusion |
| **4. Recurrence relations and generating functions |
| *6. Latin squares and SDRs |
| *9. Finite geometry (part) |
| 8. Steiner triple theory (part) |
| *7. Extremal set theory (part) |
| *10. Pigeonhole Principle and Ramsey's theorem (but in Brualdi) (part) |
You will have to do a lot of reading and thinking outside class. The minimum time you'll need to spend outside class is about 10 hours a week. Count on that.
Here is a link to the schedule of topics and assignments.
Course goals:
Develop theoretical and computational skills in basic combinatorics and several areas of more advanced combinatorics.
Grading System
- There will be three tests, including the final exam. There will also be quizzes and homework collection. Your grade will be based on the tests, quizzes, homework, and class participation.
- Test 1 (Wed., Oct. 16) (NOT Mon., Oct. 14): 20%.
- Test 2 (Tues., Nov. 26): 20%.
- Final (Fri. Dec. 13, 8-10 a.m. in FA 241): 30%.
- Quizzes, homework, and other classwork: 30%.
Homework
- Homework is essential in combinatorics.
- It's a problem-oriented subject where you learn by doing. It can be challenging, too; don't expect to solve every single problem.
- For harder problems, it often helps a lot if you try the problem one day and go back to it a day later. Work ahead.
- I will not cover everything in lectures; you have to learn a lot by reading for yourself.
- I expect you to read the assigned sections carefully before the class.
- The assignments will be weekly so you can spread them out, but don't delay.
- You must write your homework solutions by yourself.
- You may discuss the problems before writing up the solution, but you must write in your own words and formulas.
- Copying is a violation of academic honesty (see the policy).
- I encourage you to form study groups. Discussion with other students is a big part of learning math.
- Hand-in homework should be typed in LaTeX or neatly written, and not squeezed into a small space. (I must be able to read your solution.)
- Staple multiple sheets (paper clips and paper folds don't work).
- Also, remove all stubs if you tear out pages from a spiral binder.
- Hand-in homework is due at the beginning of class.
- If you're late to class, leave your papers on my desk when you arrive, not when you leave.
- Late homework will have a penalty or be refused.
- Homework grading system: 4 points per graded problem or part of a problem.
- 4 pts: Complete and correct.
- 3 pts: Almost complete and correct.
- 2 pts: A significant part is correct but there is a significant lack.
- 1 pt: A good start.
- 0 pts: Anything that isn't even a good start: a bad start, very confused, etc.
- PLAGIARISM WARNING.
- Do the homework. That does not include looking up solutions on line (or off line), even if you don't copy them. I do allow you to work together, but I do not allow copying and I do not allow looking up solutions except from scholarly publications. If you find a solution to one of Cameron's exercises on line, DO NOT USE IT. If you are not sure, ask me.
- Solutions that appear not to be your own work will receive negative credit and possibly more serious consequences.
- If you solve a problem together with other students, list their names.
- If you do use any assistance, on line or off, including help from other people in the class or not in the class (that includes tutors), you must cite your source (or credit the person) and explain what kind of help you got from the source. If you don't do that, you are committing plagiarism, which is not only a scholarly crime but is also subject to disciplinary action from the university.
Quizzes
There will be short quizzes. There are no make-up quizzes.
Test dates
- Test 1: Wed., October 16 (NOT Mon., October 14)
- Test 2: Tues., November 26
- Final exam: Fri., December 13, 8–10 a.m. in FA 241
Exam policy
- University PHOTO ID is required to take the final exam.
- No calculators are allowed during exams or quizzes.
- Test grading guidelines are posted after the test is graded.
- The final is comprehensive and mandatory. There will be no make-up for the final exam except for extraordinary circumstances.
Classroom behavior
Always turn your cell phone to silent before entering the classroom. No chatting, emailing, surfing, texting, etc. If you do, I may confiscate your device for the rest of the class.
Academic Dishonesty
Any instance of academic dishonesty will be referred to the Harpur College Academic Honesty Committee. Academic honesty violations can result in suspension from the University for multiple semesters. See above for guidelines about avoiding plagiarism (a serious violation).
Links to: Schedule | Announcements (test information, textbook corrections) | Additional Problems | My home page