Scientific

The state-of-the-art in hyperelliptic curve cryptography

Author: 
Craig Costello
Date: 
Wed, Jun 19, 2013 to Fri, Jun 21, 2013
Location: 
PIMS, University of Calgary
Conference: 
Workshop on Curves and Applications
Abstract: 

The state-of-the-art in hyperelliptic curve cryptography

Notes: 
Class: 
Subject: 

Splitting of Abelian varieties

Author: 
V. Kumar Murty
Date: 
Wed, Jun 19, 2013 to Fri, Jun 21, 2013
Location: 
PIMS, University of Calgary
Conference: 
Workshop on Curves and Applications
Abstract: 

Splitting of Abelian varieties

Notes: 
Class: 
Subject: 

Search games and Optimal Kakeya Sets

Speaker: 
Yuval Peres
Date: 
Fri, Sep 6, 2013
Location: 
PIMS, University of British Columbia
Conference: 
PIMS/UBC Distinguished Colloquium Series
Abstract: 

A planar set that contains a unit segment in every direction is called a Kakeya set. These sets have been studied intensively in geometric measure theory and harmonic analysis since the work of Besicovich (1928); we find a new connection to game theory and probability. A hunter and a rabbit move on an n-vertex cycle without seeing each other until they meet. At each step, the hunter moves to a neighboring vertex or stays in place, while the rabbit is free to jump to any node. Thus they are engaged in a zero sum game, where the payoff is the capture time. We show that every rabbit strategy yields a Kakeya set; the optimal rabbit strategy is based on a discretized Cauchy random walk, and it yields a Kakeya set K consisting of 4n triangles, that has minimal area among such Kakeya sets. Passing to the scaling limit yields a simple construction of a random Kakeya set with zero area from two Brownian motions. (Talk based on joint work withY. Babichenko, R. Peretz, P. Sousi and P. Winkler). 

Class: 
Subject: 

Mathematics and the Planet Earth: a Long Life Together II

Speaker: 
Ivar Ekeland
Date: 
Wed, Jul 17, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Mathematics of Planet Earth 2013
Abstract: 

When Colombus left Spain in 1492, sailing West, he knew that the Earth was round and was expecting to land in Japan. Seventeen centuries earlier, around 200 BC, Eratosthenes had shown that its circumference was 40,000 km, just by a smart use of mathematics, without leaving his home town of Alexandria. Since then, we have learned much more about Earth: it is a planet, it has an inner structure, it carries life , and at every step mathematics have been a crucial tool of discovery and understanding. Nowadays, concerns about the human footprint and climate change force us to bring all this knowledge to bear on the global problems facing us. This is the last challenge for mathematics: can we control change?
This is a two-part lecture, investigating how our idea of the world has influenced the development of mathematics. In the first lecture on July 15, I will describe the situation up to the twentieth century, in the second one on July 17 I will follow up to the present time and the global challenges humanity and the planet are facing today.
 

Class: 

Mathematics and the Planet Earth: a Long Life Together I

Speaker: 
Ivar Ekeland
Date: 
Mon, Jul 15, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Mathematics of Planet Earth 2013
Abstract: 

When Colombus left Spain in 1492, sailing West, he knew that the Earth was round and was expecting to land in Japan. Seventeen centuries earlier, around 200 BC, Eratosthenes had shown that its circumference was 40,000 km, just by a smart use of mathematics, without leaving his home town of Alexandria. Since then, we have learned much more about Earth: it is a planet, it has an inner structure, it carries life , and at every step mathematics have been a crucial tool of discovery and understanding. Nowadays, concerns about the human footprint and climate change force us to bring all this knowledge to bear on the global problems facing us. This is the last challenge for mathematics: can we control change?

This is a two-part lecture, investigating how our idea of the world has influenced the development of mathematics. In the first lecture (July 15), I will describe the situation up to the twentieth century, in the second one (July 17) I will follow up to the present time and the global challenges humanity and the planet are facing today.

Class: 

Taking Advantage of Degeneracy in Cone Optimization: with Applications to Sensor Network Localization

Author: 
Henry Wolkowicz
Date: 
Thu, Aug 8, 2013 to Sat, Aug 10, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Workshop on Numerical Linear Algebra and Optimization
Abstract: 

Taking Advantage of Degeneracy in Cone Optimization: with Applications to Sensor Network Localization

Class: 

Search Games and Optimal Kakeya Sets

Author: 
Yuval Peres
Date: 
Fri, Sep 6, 2013
Location: 
PIMS, University of British Columbia
Abstract: 

Search Games and Optimal Kakeya Sets: Yuval Peres
Based on joint work with Y. Babichenko, R. Peretz, P. Sousi and P. Winkler

Class: 
Subject: 

Solving linear systems by orthogonal tridiagonalization (GMINRES and/or GLSQR)

Author: 
Michael Saunders
Date: 
Thu, Aug 8, 2013 to Sat, Aug 10, 2013
Location: 
PIMS, University of British Columbia
Conference: 
Workshop on Numerical Linear Algebra and Optimization
Abstract: 

A general matrix A can be reduced to tridiagonal form by orthogonal
transformations on the left and right: UTAV = T. We can arrange that the
rst columns of U and V are proportional to given vectors b and c. An iterative
form of this process was given by Saunders, Simon, and Yip (SINUM 1988) and
used to solve square systems Ax = b and ATy = c simultaneously. (One of the
resulting solvers becomes MINRES when A is symmetric and b = c.)

The approach was rediscovered by Reichel and Ye (NLAA 2008) with emphasis
on rectangular A and least-squares problems Ax ~ b. The resulting solver was
regarded as a generalization of LSQR (although it doesn't become LSQR in
any special case). Careful choice of c was shown to improve convergence.

In his last year of life, Gene Golub became interested in \GLSQR" for
estimating cTx = bTy without computing x or y. Golub, Stoll, and Wathen
(ETNA 2008) revealed that the orthogonal tridiagonalization is equivalent to a
certain block Lanczos process. This reminds us of Golub, Luk, and Overton
(TOMS 1981): a block Lanczos approach to computing singular vectors.

Class: 

Pages