Difference between revisions of "15-344"

From Drorbn
Jump to: navigation, search
Line 28: Line 28:
 
{{15-344:Dror/Students Divider}}
 
{{15-344:Dror/Students Divider}}
  
If you are reading section 7.1 in our textbook, you may find example 3 intriguing. Attempting to solve the problem without looking for a recurrence relation, I found a solution using graph theoretic tools (to be precise, Euler's formula).  
+
'''(1).''' If you are reading section 7.1 in our textbook, you may find example 3 intriguing. Attempting to solve the problem without looking for a recurrence relation, I       found a solution using graph theoretic tools (to be precise, Euler's formula).  
  
 
[[Media:15-344-Plane Division.pdf | Graph Theory Revisited: Euler's Formula and a Combinatorial Problem]]
 
[[Media:15-344-Plane Division.pdf | Graph Theory Revisited: Euler's Formula and a Combinatorial Problem]]
 +
 +
'''(2).''' If you took [http://drorbn.net/?title=12-267 MAT267] (Also Taught by Professor Bar-Natan), you may remember that Catalan number was discussed in a lecture.
 +
 +
[http://drorbn.net/dbnvp/12-267-121106.php Catalan Number Revisited: Power Series, Combinatorial Information and Ordinary Differential Equations]

Revision as of 20:35, 15 December 2015


Introduction to Combinatorics

Department of Mathematics, University of Toronto, Fall 2015

Agenda: Understand graphs and learn to count.

Instructor: Dror Bar-Natan, drorbn@math.toronto.edu (no math over email!), Bahen 6178, 416-946-5438. Office hours: by appointment.

Classes: Tuesdays 3-5 at MP 202 and Thursdays 2-3 at MP 203.

Teaching Assistant
Teaching Assistant: Gaurav Patil (g.patil@mail.utoronto.ca). Office hours: Mondays 3:30-4:30PM at 215 Huron, room 1012, and Tuesdays 6-7PM at math department lounge, on the 6th floor of the Bahen building.

Tutorials: Two sessions - Thursdays 4-5 and Thursdays 5-6, both at LM 158.

Text

Our main text book will be Applied Combinatorics (sixth edition) by Alan Tucker, ISBN 978-0-470-45838-9; it is a required reading.

Further Resources

Dror's notes above / Students' notes below

(1). If you are reading section 7.1 in our textbook, you may find example 3 intriguing. Attempting to solve the problem without looking for a recurrence relation, I found a solution using graph theoretic tools (to be precise, Euler's formula).

Graph Theory Revisited: Euler's Formula and a Combinatorial Problem

(2). If you took MAT267 (Also Taught by Professor Bar-Natan), you may remember that Catalan number was discussed in a lecture.

Catalan Number Revisited: Power Series, Combinatorial Information and Ordinary Differential Equations