Outline | People | Reading | Grading | Academics | Homepage |
Course Outline* | ||||||
Lecture | Topic(s) | Notes | Book(s) | |||
---|---|---|---|---|---|---|
1. Aug 24 | What are discrete models: Fibonacci's rabbits | DMM §1 | ||||
2. Aug 29 | Graphs and digraphs: basic set theoretic definitions | DMM §2 | ||||
3. Aug 31 | (Di)Graphs continued: toric mesh, hypercube | Class notes | ||||
4. Sep 5 | Paths, reachability, connectedness | DMM §2.2 | ||||
5. Sep 7 | Vertex basis, strong components | DMM §2.3 | ||||
6. Sep 12 | Matrix representation, transitive closure | DMM §2.4 | ||||
7. Sep 14 | Return of homework 1; strong components via transitive closure | |||||
8. Sep 19 | Catch-up |
|
||||
9. Sep 21 | Review for first exam |
|
|
|||
10. Sep 26 | First Exam | Counts 17.5% | ||||
11. Sep 28 |
Return of first exam;
fair division and apportionment
|
Class notes (in pdf)
|
TA §3 and 4
|
|||
12. Oct 3 | Basic definition and examples of trees; rooting a tree |
|
DMM §2.2, Ex 22
|
|||
Wed, Oct 4, 5pm | Last day to drop the course |
|||||
13. Oct 4 | Expression trees, parenthesized strings |
Class notes;
biography of Lukasiewicz.
|
|
|||
14. Oct 10 | Depth-first-seach trees; strongly connected orientation in a graph |
|
DMM§3.3
|
|||
Thurs-Fri, Oct 12-13 | Fall Break, no class | |||||
15. Oct 17 | Testing for cycles in a digraph by DFS |
|
DMM §3.3
|
|||
16. Oct 19 | Expression grammars and parse trees |
Class notes
|
|
|||
17. Oct 24 |
Linearization of parse trees;
MathML and XML
|
|
|
|||
18. Oct 26 |
Lindenmeyer systems;
fractals
|
Online notes
|
TA §12
|
|||
19. Oct 31 |
More fractals
|
Definition
of Mandelbrot and Julia sets
|
|
|||
20. Nov 2 |
Chromatic number; planarity
|
History of 4 color theorem
|
DMM §3.6
|
|||
21. Nov 7 | Review for exam; catch-up |
|||||
22. Nov 9 | Second exam | Counts 17.5% | ||||
23. Nov 14 | Return of exam; Boolean expressions |
|
||||
Wed, Nov 15 | Topic for term paper must be declared at 5pm | |||||
24. Nov 16 |
Boolean expressions and propositional calculus continued
|
Class notes
|
|
|||
Mon, Nov 20 | Approvals of topics for term papers by me are posted | |||||
25. Nov 21 |
Computing a k-element clique
in a graph is as hard as factoring
an integer
|
Class notes
|
|
|||
Thursday-Friday, Nov 22-24 | Thanksgiving, no class | |||||
26. Nov 28 |
Arrows axioms, impossibility
|
Arrow's autobio
|
DMM §7.2
|
|||
27. Nov 30 |
Fair elections continued
|
|
|
|||
28. Dec 5 | Markov chains | DMM §5 | ||||
29. Dec 7 | Presentation by Vegh | |||||
Thu, Dec 14, 09h00-12h00 and 14h00-17h00, NEW HA 335. | Presentations continue | |||||
Presentation titles
|
On-line information: All information on courses that I teach (except individual grades) is now accessible via html browsers, which includes this syllabus. My web page listing all my courses' is at
There will be five to six homework assignments of approximately equal weight, two mid-semester examinations during the semester, and a term paper and a short presentation of it at the end of the sememster.
I will check who attends class, including the paper presentations by your class mates on Dec 6. You will forfeit 5% of your grade if you miss 3 or more classes without a valid justification. I you miss a class because you are sick, etc., please let me know. I may require you to document your reason.
For a term paper, you are asked to select and read a mathematical paper or a chapter/section in a book, whose topic is in discrete mathematical models. You can select a section in DMM that was not covered in class. The term paper is a 3-5 page summary (typed, single spaced). You will present the information to me in a 10-15 minute talk. I will give more details on what I expect from the presentation and the write-up during class.Grade split up | |
Accumulated homework grade | 40% |
Term paper + presentation | 20% |
First mid-semester exam | 17.5% |
Second mid-semester exam | 17.5% |
Class attendance | 5% |
Course grade | 100% |
If you need assistance in any way, please let me know (see also the University's policy).
Collaboration on homeworks: I expect every student to be his/her own writer. Therefore the only thing you can discuss with anyone is how you might go about solving a particular problem. You may use freely information that you retrieve from public (electronic) libraries or texts, but you must properly reference your source.
Late submissions: All programs must be submitted on time. The following penalties are given for (unexcused) late submissions:
©2006 Erich Kaltofen. Permission to use provided that copyright notice is not removed.