## Scientific Lectures

- 7-May-07

We analyze portfolio credit risk in light of dynamic "frailty," in the form of incompletely observed covariates. Common dependence by firms on unobservable time-varying default covariates is estimated to cause large changes in conditiona more››

University of British Columbia

- 4-May-07

In these two lectures I will survey my recent work with Lupercio and Xicotencatl on the properties of the homology of the free loop space of an orbifold. In the first lecture I will review the work of Chas and Sullivan on string topology and I wil more››

University of British Columbia

- 2-May-07

Spanning Trees, Random Graphs, and Random Walks

In the usual Erdõs-Rényi model of random graphs, each pair of n vertices is connected by an edge independently with probability c/n for some constant c. When c > 1, it has a unique 'giant' component. How quickly does the number of spannin more››

University of British Columbia

- 2-May-07

In these two lectures I will survey my recent work with Lupercio and Xicotencatl on the properties of the homology of the free loop space of an orbifold. In the first lecture I will review the work of Chas and Sullivan on string topology and I wil more››

University of British Columbia

- 30-Apr-07

Modular tensor categories from semisimple algebras

Modular tensor categories are finitely semisimple Abelian categories with some additional structure that allows us to obtain combinatorial invariants of oriented framed tangles. Reshetikhin and Turaev invented them in order to construct their 3-ma more››

University of British Columbia

- 30-Apr-07

Chow group of 0-cycles on a surface over a p-adic field with infinite torsion subgroup

In this talk I would like to demonstrate how Hodge theory can play a crucial role in an arithmetic question. The issue is to construct an example of a projective smooth surface X over a p-adic field K such that for any prime more››

University of Alberta

- 30-Apr-07
- 1-May-07

Infinite profinite groups encapture asymptotic properties of arrays of finite groups. We will discuss the important examples of (large) profinite groups and their relations to number theory, geometry and theoretical computer science. more››

Simon Fraser University

- 27-Apr-07

Symposium on Kinetic Equations and Methods

A conference in honour of the 10th anniversary of the founding of the Pacific Institute for the Mathematical Sciences. World leaders from diverse branches of kinetic theory will gather for an intense two-day worksh more››

University of Victoria

- 26-Apr-07

Adaptive evolution and concentrations in parabolic PDEs

Living systems are subject to constant evolution. Their environment can be considered as a nutrient shared by all the population. This allows certain individuals, characterized by a ‘physiological trait’, to expand faster because they are bett more››

University of Alberta

- 26-Apr-07

A Nonlinear PDE Model for Lakes and Rivers

Simon Fraser University

- 25-Apr-07

Prandtl Conjecture and von Neumann Paradox for Shock Reflections

We plan to discuss the two fundamental problems, the Prandtl Conjecture and von Neumann Paradox, in the theory of supersonic flows with shock waves. These problems were raised in the first half of the 20th century and clearly formulated in the cla more››

University of British Columbia

- 24-Apr-07

The sharp isoperimetric inequality on minimal submanifolds

We will describe the history of the conjecture that the isoperimetric inequality with the Rn constant should hold for a domain on a minimal submanifold of dimension n in Euclidean space. We will then describe a new method which pr more››

University of Washington

- 24-Apr-07

Mathematical analysis of models for chemotaxis: parabolic, hyperbolic, kinetic

TBA more››

University of British Columbia

- 24-Apr-07

Mihalis Yannakakis is the Percy K. and Vida L. W. Hudson Professor of Computer Science at Columbia University. Prior to joining Columbia, he was Director of the Computing Principles Research Department at Bell Labs (1991-2001) and at Avaya Labs (2 more››

Simon Fraser University

- 19-Apr-07

Scheduling, Percolation, and the Worm Order

When can you schedule a multi-step process without having to take backward steps? Critical are an old concept called "submodularity", a new structure called the "worm order", and a variation of what physicists call "percol more››

University of Washington

- 19-Apr-07

Gauss Sums: Finding the Root of Unity

A Gauss sum over a finite field GF(q) is a sum of q algebraic numbers. It is often useful to evaluate Gauss sums explicitly, for instance, in coding theoretic or cryptographic applications. For small q, the evaluation of Gauss sums can be done nai more››

University of Calgary

- 19-Apr-07

A unified approach to modelling trajectories

The talk will concern the employment of stochastic gradient systems in the modeling and statistical analysis of biological and ecological processes of moving particles. The work is stimulated by scientific questions and data sets of the movements more››

Simon Fraser University

- 18-Apr-07

Braid groups of the projective plane and the splitting problem

TBA more››

University of British Columbia

- 18-Apr-07

Random walk on the incipient infinite cluster for oriented percolation

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation in d spatial dimensions and one time dimension. For d>6, we obtain bounds on exit times, transition probabilities, and the range o more››

University of British Columbia

- 18-Apr-07

Values and Ideals in Combinatorial Problems

The absolute value of complex numbers is surprisingly useful in the investigation of certain combinatorial problems. The connection often arises from imbedding finite cyclic groups into the complex numbers by sending the group elements to roots of more››

University of Calgary