Contents
Rhea Section for MA279: "Modern Mathematics"
Professor Walther, Spring 2016
Welcome!
Please write [[Category:MA279Spring2016Walther]] at the bottom of each of your pages,
OTHERWISE NO CREDIT !
(If you use the "Create a child page" button, this should happen automatically...)
Course Info
- Instructor: Prof. Walther
- Office: MATH 746
- email: walther at math dot purdue dot edu
- Office hours: Tue 1:30-2:30, Th 2:00-3:00.
- Class time and location: TTh 9:00-10:15, UNIV 217
- Book: Excursions in modern mathematics (P. Tannenbaum), 7th edition.
Important Links
Course Related Material
- Course Notes
- Discussion of Homework Problems (Just keep adding to it!)
Discussion
- post link to discussion page here
- post link to discussion page here
Other Links
- Math Club Homepage
- Rhea's Math Squad
- Study Abroad
- The 2013 Big 10 Graduate School Expo
- Math Internships and Research Opportunities (REU's)
- Math Game Competition
Your turn! Student Projects
As per the syllabus, 5% of your grade will be based on contributing a Rhea page on a subject related to the course. To pick a subject, simply write your group name next to it. No more than one group per subject. Your page will be graded based on content as well as interactions with other people (page views, comments/questions on the page, etc.). The number of links to other courses and subjects will also be taken into account: the more the merrier! Please do not simply copy the lecture notes and do not plagiarize. Read Rhea's copyright policy before proceeding.
For some lovely contributions, see Honors Project 2011 by Daniel Lee
Deadline: Sunday before dead week
| Topic Number | Topic Description | Team Name |
|---|---|---|
| 1 | The Chinese Postman Problem (5.c) | Name |
| 2 | Swarm Intelligence (6.c) | Name |
| 3 | [[Walther_MA279_Spring2016_topic3|DNA-based computing (6.b)] | Name |
| 4 | Privacy and Social Networks (7.c) | Name |
| 5 | Alternatives to Kruskal's algorithm (7.a) | Name |
| 6 | P vs NP: a Clay Millennium Problem with economic flavor | Name |
| 7 | Dijkstra's algorithm and its variants for shortest paths (7.b) | Name |
| 8 | Tournaments (8.c) | Name |
| 9 | The graph isomorphism problem: theory and applications | Name |
| 10 | Scheduling (Chapter 8) | Name |
| 11 | The transportation problem: a glimpse into linear programming | Name |
| 12 | The economic impact of mathematical algorithms in society | Name |
