Mathematical Sciences Research Institute

Home > Scientific > Colloquia & Seminars > All Colloquia & Seminars > Upcoming

Upcoming Colloquia & Seminars

  1. DMS Research Seminar: Quasi-isometric rigidity of Teichmuller space

    Location: MSRI: Simons Auditorium
    Speakers: Howard Masur (University of Chicago)

    In the first part of the talk I will introduce the notion of a quasi-isometry between  metric spaces and  what it means for a space to be quasi-isometrically rigid. I will then give some history of this subject starting with Mostow strong rigidity and more recently, rigidity of the mapping class group.    I will then talk about Teichmuller space with the Teichmuller metric and state  some of the known properties of this metric that are useful for studying quasi-isometries.  In the second part of the talk I will discuss a recent joint theorem with Alex Eskin and Kasra Rafi where we prove Teichmuller space is quasi-isometrically rigid.

    Updated on Apr 30, 2015 04:57 PM PDT
  2. GAAHD Postdoc Seminar: Diophantine approximation in Lie groups

    Location: MSRI: Simons Auditorium
    Speakers: Nicolas de Saxce (Université de Paris XIII (Paris-Nord))

    We will study the diophantine properties of random finitely generated subgroups of Lie groups, focusing mainly on the case of nilpotent Lie groups.

    Updated on May 01, 2015 12:21 PM PDT
  3. Fibonacci Plays Billiards with Dr. Elwyn Berlekamp

    Location: MSRI: Simons Auditorium
    Speakers: Elwyn Berlekamp (University of California, Berkeley)

    Please join MSRIs Directorate for a fun talk led by Dr. Elwyn Berlekamp: 

    One version of the classic traveling salesman problem seeks to determine whether or not, in any given graph, there exists a "Hamiltonian path" which traverses every node exactly once.   In the general case, this problem is well-known to be NP Hard.   In one interesting subclass of this problem, the nodes are taken to be the first N integers, {1,2,3,...,N}, where there is a branch between J and K iff J+K is in a specified set S = {S[1], S[2], S[3],...,S[M]}.   Or, given S, for what values of N does a Hamiltonian path exist?  How fast can the elements of S grow such that there exist solutions for infinitely many N?
    The answer to the second question turns out to be a close relative of the Fibonacci numbers, for which we construct solutions by observing the path of a billiard ball which travels at 45 degree angles to the sides of its table.  Using the same billiard ball methodology, we also find some particular solutions when S is the set of squares or the set of cubes. 

    Created on Apr 30, 2015 09:42 AM PDT
  4. GAAHD Research Seminar

    Location: MSRI: Simons Auditorium
    Updated on Feb 20, 2015 09:52 AM PST
  5. Open ended seminar

    Location: MSRI: Baker Board Room
    Updated on Mar 06, 2015 09:50 AM PST
  6. DMS Research Seminar

    Location: MSRI: Simons Auditorium
    Speakers: Marc Burger (Eidgenössische TH Zürich-Hönggerberg), Fanny Kassel (Université de Lille I (Sciences et Techniques de Lille Flandres Artois))
    Updated on Jan 28, 2015 02:14 PM PST