MATH 4360

Combinatorial Modeling

Lec 01 selected

This course introduces a common framework for combinatorial structures (graphs, digraphs, hypergraphs, posets, preorders, lattices, finite topologies, simplicial complexes), with an emphasis on how to model these structures with other fields of mathematics, such as matrix theory and linear algebra, commutative algebra, topology, analysis, probability and logic.

Sections

Lecture

From the syllabus

From the Winter 2025 syllabus by Jason I. Brown. Open the PDF

Grading

30%Assignments (2)Two assignments, 15% each
40%Tests (2)Two tests, 20% each
20%Project written componentDue April 3
10%Project presentation30-minute in-class presentation April 1 or 3

Textbook

  • Discrete Structures and Their Applications, J.I. Brown

Course rules

Missed work
Submit the Student Self-Declaration of Absence form in Brightspace within six days; at most two forms are allowed.
Late assignments
Contact the instructor before the due date to arrange an alternate date; a penalty may apply.
Missed tests
Contact the instructor on or before the test date and provide your academic schedule to arrange a make-up.
Academic integrity
Assignments and projects must be completed independently; generative AI and large language models are prohibited.

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