Posts Tagged Syllabus

Syllabus

This syllabus is for Andrew Snowden’s Undergraduate Seminar in Topology at MIT. Description This course is a seminar in topology. The main mathematical goal is to learn about the fundamental group, homology and cohomology. The main non-mathematical goal is to obtain experience giving math talks. Lectures will be delivered by the students, with two students speaking at each class. There are no exams. There will be some homework assignments and a final paper. Seminar leader Andrew Snowden e-mail: asnowden at math dot mit dot edu Office: 2-175 Office hours by appointment Time and location The seminar typically meets Monday, Wednesday

Read more

Planning the term

Here are some suggestions to consider as you design a math class that includes communication. Learning to communicate math vs. communicating to learn math As you plan the term, first ask yourself why you want to include communication in your math class. Do you want students to learn to communicate math effectively, in writing or orally? write or speak about math in order to better learn math? communicate about math to reduce math anxiety? communicate about math so you can assess their understanding? Your answer will shape your assignments as well as the instruction and feedback you provide. Helping students

Read more

Schedule and Assignments

[The following schedule is for Steven Kleiman’s 2010 Undergraduate Seminar in Computational Commutative Algebra and Algebraic Geometry, in which the students give the lectures. The main page for this course is here.] Homework: Problems with numbers between braces ({}) are to be written up formally in TeX and passed in by Thursday of the week after they are assigned; they may be emailed either in TeX form or dvi form directly to the TA.   Assignments Date First lecture Second Lecture 1. T. 2/2 Steve Kleiman Sec. 1-1 p.5: 2, {6b} Steve Kleiman Sec. 1-2 p.12: {6}, 8, 10 2.

Read more

Course Description

Computational algebra and algebraic geometry [The following notes are about Steven Kleiman’s 2010 Undergraduate Seminar in Computational Commutative Algebra and Algebraic Geometry, in which the students give the lectures. The main page for this course is here.] Prerequisites: {18.06, 18,700, or 18.701} plus {18.703 or 18.702} Descriptions of these courses can be found here. Text Book: “Ideals, Varieties, and Algorithms” by Cox, Little, and O’Shea, UTM Springer, third edition, 2007. Google books has most of the book online. You can find it HERE. Grades: – Based equally on classwork, homework, and the term paper; no exams or final. – Written

Read more