video | James Colliander

Ubiquity of Mathematics: Ingrid Daubechies

Sun, 12 May 2013 19:09:11 +0000

Your browser does not support the <video> tag.

University of Toronto Math Department Colloquium Videos Winter 2013

Wed, 08 May 2013 19:08:10 +0000

The Department of Mathematics at the University of Toronto has recently deployed a new granular content management system called KBasix for sharing files and web content. We’ve deployed and enriched a KBasix system to create a video upload-transcode-stream service for the videos of seminars and colloquia that take place in our department. I am grateful to Pamela Brittain, Marco de la Cruz-Heredia, Emile LeBlanc and Habiba Mohtadi for their efforts at making it possible for the world to tune into our colloquium stream!

Wednesday April 24, 2013

“Linearization of Lie groupoids – Rui Loja Fernandes“

Your browser does not support the <video> tag.

Thursday March 28, 2013

“What is quantum probability? - Greg Kuperberg“

Your browser does not support the <video> tag.

Wednesday March 20, 2013

“Cherednik algebras and torus knots - Pavel Etingof”

Your browser does not support the <video> tag.

Wednesday March 13, 2013

“Thin Matrix Groups and Diophantine Analysis - Peter Sarnak”

Your browser does not support the <video> tag.

Wednesday March 06, 2013

“Trees and Wheels and Balloons and Hoops and Why I Care – Dror Bar-Natan”

Your browser does not support the <video> tag.

Wednesday February 06, 2013

“Universal spaces for birational invariants - Yuri Tschinkel”

Your browser does not support the <video> tag.

Wednesday January 30, 2013

“Operator limits of random matrices - Balint Virag”

Your browser does not support the <video> tag.

Wednesday January 23, 2013

“Unexpected applications of polynomials in combinatorics - Larry Guth”

Your browser does not support the <video> tag.

Ubiquity of Mathematics: Luis Seco

Tue, 07 May 2013 19:07:02 +0000

Your browser does not support the <video> tag.

Luis Seco Interivew - Transcript

Ubiquity of Mathematics: Spyros Alexakis

Mon, 06 May 2013 19:06:12 +0000

Your browser does not support the <video> tag. Spryridon Alexakis - Transcript

Ubiquity of Mathematics: Adrian Nachman

Fri, 03 May 2013 19:04:57 +0000

Your browser does not support the <video> tag.
Adrian Nachman Interview - Transcript

Ubiquity of Mathematics: Charles Fefferman

Thu, 02 May 2013 19:03:43 +0000

This is Episode 1 of a 5 part video series entitled Ubiquity of Mathematics. I am grateful to the Department of Mathematics, the Fields Institute, Richard Cerezo, and Andrea MacLeod for making this project happen. I also thankful the mathematicians interviewed for this series:

The other episodes will appear shortly. Here is the transcript and here is the video of the interview with Charles Fefferman:

Your browser does not support the <video> tag.

Larry Guth Colloquium: Unexpected Applications of Polynomials in Combinatorics

Mon, 11 Feb 2013 20:01:01 +0000

My former colleague Larry Guth (now at MIT) visited us recently and gave a beautiful colloquium talk. The Department has recently deployed a video streaming service so we are able to share Larry’s talk with the world. We look forward to sharing other videos in the future.

Here is the video:

Your browser does not support the <video> tag.

Unexpected applications of polynomials in combinatorics

by Larry Guth | MIT Time: 16:10 (Wednesday, Jan. 23, 2013) Location: BA6183, Bahen Center, 40 St George St Abstract: In the last five years, several hard problems in combinatorics have been solved by using polynomials in an unexpected way. In some cases, the proofs are very short, and I will present a complete proof in the lecture. One of the problems is the joints problem. Given a set of lines in $R^3$, a joint is a point that lies in three non-coplanar lines. Given $L$ lines in $R^3$, how many joints can there be? Another problem is the distinct distance problem in the plane. If P is a set of points in the plane, the distance set of $P$ is the set of all distances from one point of $P$ to another. If $P$ is a set of $N$ points in the plane, how small can the distance set of $P$ be? The proofs involve studying a set of points in a vector space by finding a polynomial of controlled degree that vanishes at the points, and then using the geometry of the zero-set to understand the combinatorial properties of the points. The goal for the talk is to give an overview of this new method.