Homework | 200 |
Midterm Test 1 | 100 |
Midterm Test 2 | 100 |
Final | 200 |
Total | 600 |
Date | Section and Homework |
---|---|
Sept 24 | Introduction, 8.1, (ASY 1.1) |
26 | 9.1 Periodic points (ASY 1.6) |
29 | 9.2 Graphical method (ASY 1.2) |
30 | Homework 1: 9.1: 1ab, 2, 3, 4 |
Oct 1 | 9.3 Stability (ASY 1.3 & 1.4) |
3 | 9.3.2 Logistic family (ASY 1.5) |
6 | 9.4 Bifurcation of periodic points (ASY 11.1 & 12.2) |
7 | Homework 2: 9.2.1; 9.3.1; 9.3.6; 9.3.9; 9.3.12 |
8 | 9.4 Bifurcation of periodic points (ASY 11.1 & 12.2) & 9.4.1 Bifurcation diagram (ASY 1.5 & 12.1) |
10 | 9.5 Schwarzian derivative (ASY 3.5) |
13 | 9.6 Conjugacy (ASY 3.3) |
14 | Homework 3: 9.4.1; 9.4.2; 9.4.3; 9.5.1; 9.5.2; 9.5.3 |
15 | 9.6 Conjugacy (ASY 3.3) |
17 | 9.7 Applications |
20 | Review & Look at : 9.6.1 |
21 | Test 1 ( covers Chapter 9 ) |
22 | 10.1 Transition graphs (ASY 1.8, 3.4) |
24 | 10.1.1 Sharkovskii Theorem (ASY Challenges 1 & 3) |
27 | 10.1.1 Sharkovskii Theorem (ASY Challenges 1 & 3) |
28 | Homework 4: 10.1:1,2,3,5 |
29 | 10.2 Topological transitivity (ASY 3.2) |
31 | 10.3 Sequences of Symbol |
Nov 3 | 10.3 Sequences of Symbol; 10.4 Sensitive dependence (ASY 1.7) | |
4 | Homework 5: 10.2: 1, 2, 3; 10.3: 1, 2 | |
5 | 10.5 Cantor sets (ASY 4.1) | |
7 | 10.5 Cantor sets (ASY 4.1) | |
10 | 10.6 Subshifts (ASY 6.3); 10.6.1 Counting periodic points | |
11 | Homework 6: 10.4: 1, 6; 10.5: 2, 3 | |
12 | 10.7 Applications | |
14 | 11.1 Limit sets (ASY 6.1) | |
17 | Review & Look at: 10.6:1, 3, 5 | |
18 | Test 2; | |
19 | 11.2 Chaotic attractors (ASY 6.2) | |
21 | 11.2.1 Expanding maps with discontinuites | |
24 | 11.2.1 Expanding maps with discontinuites | |
25 | Homework 7: 11.1.2; 11.2: 1, 2, 4 | |
26 | No class | |
28 | Thanksgiving | |
Dec 1 | 11.3 Lyapunov exponents (ASY 3.1); Look at 11.3: 1,7 | |
2 | No class; | |
3 | Review | |
5 | Review | |
8 | Final, 9-11 AM (Final cannot be rescheduled) |