18.02A
Calculus
Arthur Mattuck
Mon-Fri, Jan 7-11, 14-18, 22-25, 28-1, 12-01:00pm, 54-100, Recitation: TR 10am or 2pm
Pre-register on WebSIS and attend first class.
No listeners
Prereq: 18.01A or 18.01
Level: U 12 units Standard A - F Grading
First half is taught during the last six weeks of the Fall term; covers material in the first half of 18.02 (through double integrals). Second half of 18.02A can be taken either during IAP (daily lectures) or during the first half of the Spring term; it covers the remaining material in 18.02.
Contact: Stephanie (Stevie) Gallarelli, 2-108, x3-4977, nonna@math.mit.edu
|
18.095
Mathematics Lecture Series
John Bush
Pre-register on WebSIS and attend first class.
Listeners welcome at individual sessions (series)
Prereq: 18.01
Level: U 6 units Graded P/D/F Can be repeated for credit
Ten lectures by mathematics faculty members on interesting topics from both classical and modern mathematics. All lectures accessible to students with calculus background and an interest in mathematics. At each lecture, reading and exercises are assigned. Students prepare these for discussion in a weekly problem session.
Students taking 18.095 for credit are expected to attend regularly and to do problem sets. Recitation Thursday at 10:30 or 1:00.
Contact: John Bush, 2-392, x3-4387, bush@math.mit.edu
Computational Mesh Generation
Per-Olof Persson
Mon Jan 7, 01-02:30pm, 2-190
Riemann Sums Revisited
Daniel Stroock
Wed Jan 9, 01-02:30pm, 2-190
The Fast Fourier Transform
Steven Johnson
Fri Jan 11, 01-02:30pm, 2-190
Mathematical Games
Richard Stanley
We will discuss some classes of two-player perfect information games that have an interesting mathematical theory. The theory will be illustrated by the games Left-Right Hackenbush and Neutral Hackenbush (which includes the famous game Nim).
Mon Jan 14, 01-02:30pm, 2-190
"Euler"
Haynes Miller
Wed Jan 16, 01-02:30pm, 2-190
Number Theory and Codes
Alvaro Pelayo
Fri Jan 18, 01-02:30pm, 2-190
Spherical Harmonics
David Vogan
Wed Jan 23, 01-02:30pm, 2-190
Knots and Statistical Mechanics
Tomasz Mrowka
Knots have long appeared in various guises in physics. In
this lecture we will explore how statistical mechanics can
be used to distinguish knots by taking their temperature.
Fri Jan 25, 01-02:30pm, 2-190
Computer Simulations of Fluids
Jean-Christophe Nave
Mon Jan 28, 01-02:30pm, 2-190
Benjamin Brubaker
Wed Jan 30, 01-02:30pm, 2-190
|
18.098
Independent Activities
Street-Fighting Mathematics
Sanjoy Mahajan
Mon, Wed, Fri, Jan 7, 9, 11, 14, 16, 18, 23, 25, 28, 30, 1, 01-02:00pm, 4-231
Pre-register on WebSIS and attend first class.
Limited to 57 participants.
Listeners allowed, space permitting
Prereq: 18.01 or equivalent
Level: U 3 units Graded P/D/F Can be repeated for credit
Studies or special individual reading arranged in consultation with individual faculty members and subject to departmental approval.
The art of guessing results and solving problems without doing a proof or an exact calculation. Techniques include extreme-cases reasoning, dimensional analysis, successive approximation, discretization, generalization, and pictorial analysis. Application to mental calculation, solid geometry, musical intervals, logarithms, integration, infinite series, solitaire, and differential equations. (No epsilons or deltas are harmed by taking this course.)
Web: http://mit.edu/18.098/
Contact: Sanjoy Mahajan, 5-122, x3-0602, sanjoy@mit.edu
|
18.998
Special Topics in Mathematics
Introduction to Combinatorial Game Theory
Elwyn Berlekamp
Mon-Sat, Jan 15, 28-2, 03-04:30pm, 2-146, Jan 15th 3 to 5 pm 2-147
Pre-register on WebSIS and attend first class.
Listeners allowed, space permitting
Prereq: Permission of instructor
Level: H 3 units Standard A - F Grading Can be repeated for credit
Opportunity for group study of advanced subjects in mathematics not otherwise included in the curriculum. Offerings are initiated by members of the Mathematics faculty on an ad hoc basis, subject to departmental approval.
Introduction Tues, Jan 15 from 3-5; Next classes MTWRF Jan 28 - Feb 2 from 3-4:30. Students who wish to receive credit will be graded by an oral final exam.
We will study combinatorial game theory, according to the first volume of "Winning Ways". This theory can be used to find explicit winning strategies for many positions in a wide variety of playable games, including Go endgames.
Web: http://math.berkeley.edu/~berlek/cgt/cgt-info.html
Contact: Elwyn Berlekamp, 2-236, x3-4381
|
|
