MATH 3370

Comb Tech and Structures

Lec 01 selected

We introduce counting techniques and combinatorial structures, and show their application and use in all branches of mathematics. Counting techniques include combinations and permutations, the pigeonhole principle, inclusion/exclusion. Other topics include recurrence relations, generating functions and power series. Structures include partial orders, set systems and transversals, and simplicial complexes

Sections

Lecture

From the syllabus

From the Winter 2025 syllabus by Isaac McMullin. Winter 2027 is taught by Janssen J., so details may differ. Open the PDF

Grading

40%Assignments (4)10% each
20%MidtermFebruary 28; closed-book, in class
40%Final examThree hours; closed-book and in person

Textbook

  • Introductory Combinatorics, Richard A. Brualdi (optional)

Course rules

Late work
Late assignments are not accepted unless an extension is arranged with the instructor at least three days before the deadline.
Missed work
A missed assignment or midterm earns zero unless you submit an SDA; missed assignments are reweighted across remaining assignments, and missed midterms require a make-up.
SDA limit
Students may use no more than two Student Self-Declaration of Absence forms in the course.
Collaboration
Students may collaborate on assignment problem-solving, but each must submit their own writing.
Generative AI
Work written by someone else or by generative AI or a large language model is not allowed.
Attendance
Students are expected to attend every class.

Have a more recent syllabus for MATH 3370? Sign in to share it