Thu, 12 Jun 2003

14:00 - 15:00
Comlab

Pascal Matrices (and Mesh Generation!)

Prof Gilbert Strang
(MIT)
Abstract

In addition to the announced topic of Pascal Matrices (abstract below) we will speak briefly about more recent work by Per-Olof Persson on generating simplicial meshes on regions defined by a function that gives the distance from the boundary. Our first goal was a short MATLAB code and we just submitted "A Simple Mesh Generator in MATLAB" to SIAM.

This is joint work with Alan Edelman at MIT and a little bit with Pascal. They had all the ideas.

Put the famous Pascal triangle into a matrix. It could go into a lower triangular L or its transpose L' or a symmetric matrix S:


[ 1 0 0 0 ]
[ 1 1 1 1 ]
[ 1 1 1 1]
L = [ 1 1 0 0 ] L' =[ 0 1 2 3 ]S =[ 1 2 3 4]

[ 1 2 1 0 ]
[ 0 0 1 3 ]
[ 1 3 6 10]

[ 1 3 3 1 ]
[ 0 0 0 1 ]
[ 1 4 10 20]

These binomial numbers come from a recursion, or from the formula for i choose j, or functionally from taking powers of (1 + x).

The amazing thing is that L times L' equals S. (OK for 4 by 4) It follows that S has determinant 1. The matrices have other unexpected properties too, that give beautiful examples in teaching linear algebra. The proof of L L' = S comes 3 ways, I don't know which you will prefer:

1. By induction using the recursion formula for the matrix entries.
2. By an identity for the coefficients i+j choose j in S.
3. By applying both sides to the column vector [ 1 x x2 x3 ... ]'.

The third way also gives a proof that S3 = -I but we doubt that result.

The rows of the "hypercube matrix" L2 count corners and edges and faces and ... in n dimensional cubes.

Thu, 17 Jun 2004

14:00 - 15:00
Comlab

Generating good meshes and inverting good matrices

Prof Gilbert Strang
(MIT)
Abstract

An essential first step in many problems of numerical analysis and

computer graphics is to cover a region with a reasonably regular mesh.

We describe a short MATLAB code that begins with a "distance function"

to describe the region: $d(x)$ is the distance to the boundary

(with d

Fri, 26 Nov 2010

11:00 - 12:00
SR2

Lectures on global Springer theory III

Zhiwei Yun
(MIT)
Abstract

Study the parabolic Hitchin fibrations for Langlands dual groups. Sketch the proof of a duality theorem of the natural symmetries on their cohomology.

Wed, 24 Nov 2010

12:00 - 13:00
L3

Lectures on global Springer theory II

Zhiwei Yun
(MIT)
Abstract

Extend the affine Weyl group action in Lecture I to double affine Hecke algebra action, and (hopefully) more examples.

Tue, 23 Nov 2010

10:00 - 11:00
L3

Lectures on global Springer theory I

Zhiwei Yun
(MIT)
Abstract

Introduce the parabolic Hitchin fibration, construct the affine Weyl group action on its fiberwise cohomology, and study one example.

Wed, 17 Jun 2009

14:00 - 15:00
Comlab

Random triangles: are they acute or obtuse?

Prof Gil Strang
(MIT)
Abstract

This is a special talk outside the normal Computational Mathematics and Application seminar series. Please note it takes place on a Wednesday.

Tue, 02 Jun 2009
12:00
L3

A black hole uniqueness theorem.

Spyridon Alexakis
(MIT)
Abstract
I will discuss recent joint work with A. Ionescu and S.
Klainerman on the black hole uniqueness problem. A classical result of
Hawking (building on earlier work of Carter and Robinson) asserts that any
vacuum, stationary black hole exterior region must be isometric to the
Kerr exterior, under the restrictive assumption that the space-time metric
should be analytic in the entire exterior region.
We prove that Hawking's theorem remains valid without the assumption of
analyticity, for black hole exteriors which are apriori assumed to be "close"
to the Kerr exterior solution in a very precise sense. Our method of proof
relies on certain geometric Carleman-type estimates for the wave operator.
Thu, 26 Mar 2009
11:00
L3

Applications of the Cobordism Hypothesis

Jacob Lurie
(MIT)
Abstract

In this lecture, I will illustrate the cobordism hypothesis by presenting some examples. Exact content to be determined, depending on the interests of the audience.

Subscribe to MIT