warning: Creating default object from empty value in /www/www.mathtube.org/modules/taxonomy/taxonomy.pages.inc on line 33.

Scientific

Embedding questions in symplectic geometry

Speaker: 
Dusa McDuff
Date: 
Fri, Nov 4, 2011
Location: 
PIMS, University of British Columbia
Conference: 
PIMS/UBC Distinguished Colloquium
Abstract: 
As has been known since the time of Gromov's Nonsqueezing Theorem, symplectic embedding questions lie at the heart of symplectic geometry. In the past few years we have gained significant new insight into the question of when there is a symplectic embedding of one basic geometric shape (such as a ball or ellipsoid)into another (such as an ellipsoid or torus). After a brief introduction to symplectic geometry, this talk will describe some of this progress, with particular emphasis on results in dimension four.

On Hilbert's 10th Problem - Part 4 of 4

Speaker: 
Yuri Matiyasevich
Date: 
Wed, Mar 1, 2000
Location: 
PIMS, University of Calgary
Conference: 
Mini Courses by Distinguished Chairs
Abstract: 

A Diophantine equation is an equation of the form $ D(x_1,...,x_m) $ = 0, where D is a polynomial with integer coefficients. These equations were named after the Greek mathematician Diophantus who lived in the 3rd century A.D.

Hilbert's Tenth problem can be stated as follows:
Determination of the Solvability of a Diophantine Equation. Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients, devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in rational integers.

This lecture is part 4 of a series of 4.

N.B. This video was transferred from an old encoding of the original media. The audio and video quality may be lower than normal.

On Hilbert's 10th Problem - Part 3 of 4

Speaker: 
Yuri Matiyasevich
Date: 
Wed, Mar 1, 2000
Location: 
PIMS, University of Calgary
Conference: 
Mini Courses by Distinguished Chairs
Abstract: 

A Diophantine equation is an equation of the form $ D(x_1,...,x_m) $ = 0, where D is a polynomial with integer coefficients. These equations were named after the Greek mathematician Diophantus who lived in the 3rd century A.D.

Hilbert's Tenth problem can be stated as follows:
Determination of the Solvability of a Diophantine Equation. Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients, devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in rational integers.

This lecture is part 3 of a series of 4.

N.B. This video was transferred from an old encoding of the original media. The audio and video quality may be lower than normal.

On Hilbert's 10th Problem - Part 2 of 4

Speaker: 
Yuri Matiyasevich
Date: 
Wed, Mar 1, 2000
Location: 
PIMS, University of Calgary
Conference: 
Mini Courses by Distinguished Chairs
Abstract: 

A Diophantine equation is an equation of the form $ D(x_1,...,x_m) $ = 0, where D is a polynomial with integer coefficients. These equations were named after the Greek mathematician Diophantus who lived in the 3rd century A.D.

Hilbert's Tenth problem can be stated as follows:
Determination of the Solvability of a Diophantine Equation. Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients, devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in rational integers.

This lecture is part 2 of a series of 4.

N.B. This video was transferred from an old encoding of the original media. The audio and video quality may be lower than normal.

On Hilbert's 10th Problem - Part 1 of 4

Speaker: 
Yuri Matiyasevich
Date: 
Fri, Feb 11, 2000
Location: 
PIMS, University of Calgary
Conference: 
Mini Courses by Distinguished Chairs
Abstract: 

A Diophantine equation is an equation of the form $ D(x_1,...,x_m) $ = 0, where D is a polynomial with integer coefficients. These equations were named after the Greek mathematician Diophantus who lived in the 3rd century A.D.

Hilbert's Tenth problem can be stated as follows:
Determination of the Solvability of a Diophantine Equation. Given a diophantine equation with any number of unknown quantities and with rational integral numerical coefficients, devise a process according to which it can be determined by a finite number of operations whether the equation is solvable in rational integers.

This lecture is part 1 of a series of 4.

N.B. This video was transferred from an old encoding of the original media. The audio and video quality may be lower than normal.

Sparse Optimization Algorithms and Applications

Speaker: 
Stephen Wright
Date: 
Mon, Apr 4, 2011
Location: 
PIMS, University of British Columbia
Conference: 
IAM-PIMS-MITACS Distinguished Colloquium Series
Abstract: 
In many applications of optimization, an exact solution is less useful than a simple, well structured approximate solution. An example is found in compressed sensing, where we prefer a sparse signal (e.g. containing few frequencies) that matches the observations well to a more complex signal that matches the observations even more closely. The need for simple, approximate solutions has a profound effect on the way that optimization problems are formulated and solved. Regularization terms can be introduced into the formulation to induce the desired structure, but such terms are often non-smooth and thus may complicate the algorithms. On the other hand, an algorithm that is too slow for finding exact solutions may become competitive and even superior when we need only an approximate solution. In this talk we outline the range of applications of sparse optimization, then sketch some techniques for formulating and solving such problems, with a particular focus on applications such as compressed sensing and data analysis.

Multi Variable Operator Theory with Relations

Speaker: 
Ken Davidson
Date: 
Tue, May 24, 2011
Location: 
PIMS, University of Victoria
Conference: 
Canadian Operator Symposium 2011 (COSY)
Abstract: 
TBA

Min Protein Patter Formation

Speaker: 
William Carlquist
Date: 
Thu, Jul 14, 2011
Location: 
PIMS, University of Victoria
Conference: 
AMP Math Biology Workshop
Conference: 
IGTC Summit
Abstract: 
This talk was one of the IGTC Student Presentations.

Memory Induced Animal Movement Patterns

Speaker: 
Ulrike Schlaegel
Date: 
Thu, Jul 14, 2011
Location: 
PIMS, University of Victoria
Conference: 
AMP Math Biology Workshop
Conference: 
2011 IGTC Summit
Abstract: 
This talk was one of the IGTC Student Presentations.

The Mathematics of Doodling

Speaker: 
Ravi Vakil
Date: 
Mon, May 30, 2011
Location: 
PIMS, University of British Columbia
Conference: 
2011 Niven Lecture
Abstract: 
Doodling has many mathematical aspects: patterns, shapes, numbers, and more. Not surprisingly, there is often some sophisticated and fun mathematics buried inside common doodles. I'll begin by doodling, and see where it takes us. It looks like play, but it reflects what mathematics is really about: finding patterns in nature, explaining them, and extending them. By the end, we'll have seen some important notions in geometry, topology, physics, and elsewhere; some fundamental ideas guiding the development of mathematics over the course of the last century; and ongoing work continuing today.
Syndicate content