18.02A/CC.182A
Calculus
Mark Behrens
Mon-Fri, Jan 9-13, 17-20, 23-27, 30-3, 12-01:00pm, 54-100, Recitation: TR 10am or 2pm
Pre-register on WebSIS and attend first class.
No listeners
Prereq: GIR:CAL1
Level: U 12 units Standard A - F Grading CALC II
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: Galina Lastovkina, 2-108, x3-4977, galina@math.mit.edu
|
18.095
Mathematics Lecture Series
Alan Edelman
Pre-register on WebSIS and attend first class.
Listeners welcome at individual sessions (series)
Prereq: GIR:CAL1
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: Alan Edelman, 2-343, x3-7770, edelman@math.mit.edu
Dance of the Astonished Topologist
Tara Holm
I will give a friendly introduction to some key ideas and tools in topology, including covering spaces and monodromy. The main example will come from square dancing, a hobby I picked up whilst a gradate student at MIT. No prior experience with topology or square dancing will be assumed.
co-sponsor: Tech Squares.
Mon Jan 9, 01-02:30pm, 35-225
Invisibility cloaks
Steven Johnson
On the mathematics by which objects can be rendered invisible in some wave equations, and the prospects of achieving this in reality.
Wed Jan 11, 01-02:30pm, 2-190
Hilbert's third problem; or, why freshmen have to learn calculus
Jonathan Novak
In 1900 Hilbert asked: given two polyhedra of equal volume, is it always possible to cut one of them into finitely many polyhedral pieces which can be reassembled into the other? If the answer to this question is yes, then we don't need limiting processes to compute volumes of polyhedra. If it's no, we're stuck with calculus. Come and find out which way the cookie crumbles.
Fri Jan 13, 01-02:30pm, 2-190
Random Matrix Theory: Cutting edge research and applications in science, engineering, and finance
Alan Edelman
Random matrix theory is the natural third member of the sequence: scalar probability, vector probability, matrix probability. It came last because it was harder, but it is also richer. Pure mathematics loves that there is still so much to discover. New applications are found every day. Learn a bit today and even more in 18.338 this upcoming semester.
Wed Jan 18, 01-02:30pm, 2-190
A Game That Everyone Thinks is Fair
Paul Hand
Suppose a hat contains two distinct real numbers. You pick one number at random and have to guess whether the other number is bigger or smaller than it. Can you be correct more than 50% of the time? Almost everyone says no, but, surprisingly, the answer is yes. Come learn some probability in order to see why.
Fri Jan 20, 01-02:30pm, 2-190
Knots and Numbers.
Haynes Miller
How are knots enumerated and told apart? We'll see that knots and numbers are inseparably entangled, and conduct a proof by square dance.
Mon Jan 23, 01-02:30pm, 2-190
Elliptic Curves
Bjorn Poonen
The theme of this lecture is to show how geometry can be
used to understand the rational number solutions to a polynomial equation.
Wed Jan 25, 01-02:30pm, 2-190
Geometry and Topology: applications, research and art
Tanya Khovanova
Why are manhole covers round? Bring your answer to this famous interview question. We will use manhole covers as a starting point to discuss some modern research in convex geometry. In the second part of the lecture I will explain the topology behind the drawings of Anatoly Fomenko.
Fri Jan 27, 01-02:30pm, 2-190
Alexander Postnikov
Mon Jan 30, 01-02:30pm, 2-190
Ramsey theory
Jacob Fox
The philosophy of Ramsey theory is that "Every large system
contains a large well-organized subsystem." It is currently one of the most active areas of research within combinatorics, overlapping substantially with number theory, geometry, analysis, logic and computer science. This
lecture will introduce some of the fundamental results and problems in the area.
Wed Feb 1, 01-02:30pm, 2-190
|
|
